Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Foundations of Computing and Decision Sciences

1 1998

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

The shift scheduling problem : different formulations and solution methods

Jacquet-Lagreze E., Montaut D., Partouche A.

Foundations of Computing and Decision Sciences

1998

Vol. 23, No. 4

199-217

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.