The shift scheduling problem : different formulations and solution methods

• Autorzy: Jacquet-Lagreze E. , Montaut D. , Partouche A.
• Języki publikacji: EN

Abstrakty

EN

The shift scheduling problem (SSP) consists of determining a set of shifts to cover an extended and variable requirement curve, minimizing the cost. The formulation of the SSP as a set-covering problem has been much studied and many heuristic approaches have been proposed. However, no attempt has been made to solve the problem with Constraint Logic Programming (CLP). After a literature review, we solve the set-covering formulation with Integer Linear Programming (ILP) and CLP Owing to the bad performances of CLP, we suggest an implicit model and test it for the two solution methods. We compare the four approaches and finally conclude that II.P on the classical model gives much better results. Then we propose a very efficient heuristic based on ILP, that permits a high level of flexibility and we measure experimentally the benefit of more flexibility on productivity.

Słowa kluczowe

EN

scheduling; shift scheduling problem

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Foundations of Computing and Decision Sciences
• Rocznik: 1998
• Tom: Vol. 23, No. 4
• Strony: 199--217
• Opis fizyczny: Bibliogr. 30 poz.

Twórcy

autor

Jacquet-Lagreze E.

autor

Montaut D.

autor

Partouche A.

• Eurodecision 9, rue de la Porte de Buc, 78 000 Versailles, France,