A hybrid LS-CP solver for the shifts and breaks design problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6373 LNCS, Issue , 2010, Pages 46-61

  Di Gaspero, Luca ^a   Gärtner, Johannes ^b   Musliu, Nysret ^c   Schaerf, Andrea ^a   Schafhauser, Werner ^c   Slany, Wolfgang ^d  

^a UNIVERSITY OF UDINE   (Italy)

^b Ximes Inc   (Austria)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^d GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING MODEL; DESIGN PROBLEMS; HYBRID STRATEGIES; LARGE NEIGHBORHOOD SEARCH; LOCAL SEARCH OPERATORS; SCHEDULING PROBLEM; SERVICE INDUSTRIES;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; HEURISTIC ALGORITHMS; OPTIMIZATION;

HEURISTIC ALGORITHMS; SCHEDULING;

EID: 78349233101     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16054-7_4     Document Type: Conference Paper

References (20)

1. Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
2. Aykin, T.: Optimal shift scheduling with multiple break windows. Management Science 42(4), 591-602 (1996)
3. Aykin, T.: A comparative evaluation of modeling approaches to the labor shift scheduling problem. European J. of Operational Research 125, 381-397 (2000)
4. Bechtold, S.E., Jacobs, L.W.: Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science 36(11), 1339-1351 (1990)
5. Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., Slany, W.: An AI-based break-scheduling system for supervisory personnel. IEEE Intelligent Systems 25(2), 60-73 (2010)
6. Côté, M.-C., Gendron, B., Quimper, C.-G., Rousseau, L.-M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints (2009)
7. Dantzig, G.B.: A comment on eddie's traffic delays at toll booths. Operations Research 2, 339-341 (1954)
8. Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 490(1-3), 61-95 (1991)
9. Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., Slany, W.: The minimum shift design problem. Annals of Operations Research 155, 79-105 (2007)
10. Di Gaspero, L., Schaerf, A.: EASYLOCAL++: An object-oriented framework for flexible design of local search algorithms. Software - Practice & Experience 33(8), 733-765 (2003)
11. Hoos, H.H., Stützle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)
12. Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, G., Kochenberger, F. (eds.) Handbook of Metaheuristics, pp. 321-353. Kluwer Academic Publishers, Norwell (2002)
13. Musliu, N., Schaerf, A., Slany, W.: Local search for shift design. European J. of Operational Research 153(1), 51-64 (2004)
14. Musliu, N., Schafhauser, W., Widl, M.: A memetic algorithm for a break scheduling problem. In: Proceedings of the VIII Metaheuristic International Conference (MIC 2009), Hamburg, Germany, July 13-16 (2009)
15. Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 468-481. Springer, Heidelberg (2004)
16. Quimper, C.-G., Rousseau, L.-M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. J. of Heuristics 16(3), 373-391 (2010)
17. Rekik, M., Cordeau, J.-F., Soumis, F.: Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. of Scheduling 13(1), 49-75 (2010)
18. Gecode Team. Gecode: Generic constraint development environment, http://www.gecode.org
19. Tellier, P., White, G.: Generating personnel schedules in an industrial setting using a tabu search algorithm. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 293-302. Springer, Heidelberg (2006)
20. Widl, M., Musliu, N.: An improved memetic algorithm for break scheduling. In: Proceedings of the 7th International Workshop on Hybrid Metaheuristics (HM 2010). LNCS, Springer, Heidelberg (2010)