A large neighbourhood search approach to the multi-activity shift scheduling problem

Journal of Heuristics

Volumn 16, Issue 3, 2010, Pages 373-392

  Quimper, Claude Guy ^a   Rousseau, Louis Martin ^b  

^a Omega Optimisation   (Canada)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Context free languages; Employee timetabling; Large neighborhood search; Regular languages; Shift scheduling; Very large scale neighborhood

Indexed keywords

ACTIVITY PROBLEM; COMPLEX REGULATION; CONSTRUCTION PROBLEM; EMPLOYEE TIMETABLING; GRAPH STRUCTURES; LARGE NEIGHBORHOOD SEARCH; LARGE NEIGHBOURHOOD; NEAR-OPTIMAL SOLUTIONS; REGULAR LANGUAGES; SHIFT SCHEDULING; WORK SHIFTS;

HUMAN RESOURCE MANAGEMENT; LAWS AND LEGISLATION; LINGUISTICS; SCHEDULING;

CONTEXT FREE LANGUAGES;

EID: 77952240490     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-009-9106-6     Document Type: Conference Paper

References (37)

1. R.K. Ahuja O. Ergun J.B. Orlin A.P. Punnen 2002 A survey of very large scale neighborhood search techniques Discrete Appl. Math. 123 75 102 1014.68052 10.1016/S0166-218X(01)00338-9 1922331 (Pubitemid 34775570)
2. Apt, K.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
3. T. Aykin 1996 Optimal shift scheduling with multiple break windows Manag. Sci. 42 4 591 602 0880.90065 10.1287/mnsc.42.4.591
4. T. Aykin 1998 A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows J. Oper. Res. Soc. 49 6 603 615 1131.90348
5. S. Bechtold L. Jacobs 1990 Implicit modeling of flexible break assignment in optimal shift scheduling Manag. Sci. 36 11 1339 1351 10.1287/mnsc.36.11.1339
6. S. Bechtold L. Jacobs 1996 The equivalence of general set-covering and implicit integer programming formulations for shift scheduling Nav. Res. Logist. 43 2 233 249 0871.90041 10.1002/(SICI)1520-6750(199603)43:2<233::AID- NAV5>3.0.CO;2-B 1375385
7. Bonaparte, A., Orlin, J.B.: Using grammars to generate very large scale neighborhoods for the traveling salesman problem and other sequencing problems. In: Integer Programming and Combinatorial Optimization, pp. 437-451 (2005)
8. Bouchard, M.: Optimisation des pauses dans le problème de fabrication des horaires avec quarts de travail. Memoire de maitrise, Ecole Polytechnique de Montreal (2004)
9. M. Brusco L. Jacobs 1993 A simulated annealing approach to the solution of flexible labor scheduling problems J. Oper. Res. Soc. 44 12 1991 1200
10. Cocke, J., Schwartz, J.T.: Programming languages and their compilers: Preliminary notes. Technical Report, Courant Institute of Mathematical Sciences, New York University (1970)
11. Côté, M.-C., Gendron, B., Rousseau, L.-M.: Modeling the regular constraint with integer programming. In: Fourth International Conference on Integration of AI and OR Techniques in Constraint Programming (CP-AI-OR 07), pp. 29-43 (2007)
12. G. Dantzig 1954 A comment on edie's traffic delay at toll booths Oper. Res. 2 339 341 10.1287/opre.2.3.339 70932
13. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Mateo (2003)
14. S. Demassey G. Pesant L.-M. Rousseau 2006 A cost-regular based hybrid column generation approach Constraints 11 4 315 333 1117.90066 10.1007/s10601-006-9003-7 2286710 (Pubitemid 44835823)
15. F. Easton N. Mansour 1999 A distributed genetic algorithm for deterministic and stochastic labor scheduling problems Eur. J. Oper. Res. 118 505 523 0933.90028 10.1016/S0377-2217(98)00327-0
16. L. Edie 1954 Traffic delays at toll booths J. Oper. Res. Soc. Am. 2 2 107 138
17. A. Ernst H. Jiang M. Krishnamoorthy B. Owens D. Sier 2004 An annotated bibliography of personnel scheduling and rostering Ann. Oper. Res. 127 21 144 1090.90078 10.1023/B:ANOR.0000019087.46656.e2 2072715
18. A. Ernst H. Jiang M. Krishnamoorthy D. Sier 2004 Staff scheduling and rostering: A review of applications, methods and models Eur. J. Oper. Res. 153 3 27 1053.90034 10.1016/S0377-2217(03)00095-X 2037199
19. F. Glover C. McMillan 1986 The general employee scheduling problem: An integration of ms and ai Comput. Oper. Res. 13 6 563 573 10.1016/0305-0548(86) 90050-X (Pubitemid 17480190)
20. Hopcroft, J., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (2001)
21. Kasami, T.: An efficient recognition and syntax-analysis algorithm for context-free languages. Technical Report Scientific Report AFCRL-65-758, Air Force Cambridge Research Lab, Bedford, MA (1965)
22. J.S. Loucks F.R. Jacobs 1991 Our scheduling and task assignment of a heterogeneous wok force: a heuristic approach Decis. Sci. 22 719 739 10.1111/j.1540-5915.1991.tb00361.x
23. Manning, C.D., Schütze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)
24. A. Mehrotra K. Murthy M. Trick 2000 Optimal shift scheduling: A branch-and-price approach Nav. Res. Logist. 47 185 200 0972.90032 10.1002/(SICI)1520-6750(200004)47:3<185::AID-NAV1>3.0.CO;2-7
25. Meyers, C., Orlin, J.B.: Very large-scale neighborhood search techniques in timetabling problems. In: The Practice and Theory of Automated Timetabling VI, pp. 36-52 (2006)
26. S. Moondra 1976 An linear programming model for work force scheduling for banks J. Bank Res. 6 299 301
27. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004), pp. 482-495 (2004)
28. Quimper, C.-G., Walsh, T.: Global grammar constraints. In: Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006), pp. 751-755 (2006)
29. Quimper, C.-G., Walsh, T.: Decomposing global grammar constraints. In: Principles and Practice of Constraint Programming (CP 2007), pp. 590-604 (2007)
30. M. Rekik J.-F. Cordeau F. Soumis 2004 Using benders decomposition to implicitly model tour scheduling Ann. Oper. Res. 118 111 133 10.1023/B:ANOR.0000019101.29692.2c 2072115
31. L. Ritzman L.J. Krajewski M.J. Showalter 1976 The disaggregation of aggregate manpower plans Manag. Sci. 22 1204 1214 10.1287/mnsc.22.11.1204
32. L.-M. Rousseau M. Gendreau G. Pesant 2001 Using constraint-based operators with variable neighborhood search to solve the vehicle routing problem with time windows J. Heuristics 8 1 43 58 10.1023/A:1013661617536
33. Sellmann, M.: The theory of grammar constraints. In: Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP 2006), pp. 530-544 (2007)
34. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP 1998), pp. 417-431 (1998)
35. G. Thompson 1995 Improved implicit optimal modelling of the shift scheduling problem Manag. Sci. 41 5 595 607 0836.90108 10.1287/mnsc.41.4.595
36. Vatri, E.: Integration de la generation de quart de travail et de l'attribution d'activites. Memoire de maitrise, Ecole Polytechnique de Montreal (2001)
37. 3 Inf. Control 10 2 189 208 0149.24803 10.1016/S0019-9958(67) 80007-X