Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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
Rocznik
Tom
Strony
199--217
Opis fizyczny
Bibliogr. 30 poz.
Twórcy
autor
autor
autor
- Eurodecision 9, rue de la Porte de Buc, 78 000 Versailles, France, info@eurodecision.fr
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BPP1-0002-0056