Local search for shift design

European Journal of Operational Research

Volumn 153, Issue 1, 2004, Pages 51-64

  Musliu, Nysret ^a   Schaerf, Andrea ^b   Slany, Wolfgang ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Local search; Shift design; Tabu search; Workforce scheduling

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

LOCAL SEARCH; SHIFT DESIGN; TABU SEARCH; WORKFORCE SCHEDULING;

SCHEDULING;

EID: 0142126278     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00098-5     Document Type: Conference Paper

References (19)

1. Aarts E.H., Korst J., van Laarhoven P.J. Simulated annealing. Aarts E.H., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;John Wiley & Sons, Chichester.
2. Aarts E., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;Wiley.
3. Aykin T. Optimal shift scheduling with multiple break windows. Managament Science. 42(4):1996;591-602.
4. Aykin T. A comparative evaluation of modeling approaches to the labor shift scheduling problem. European Journal of Operational Research. 125:2000;381-397.
5. Balakrishnan N., Wong Richard T. A network model for the rotating workforce scheduling problem. Networks. 20:1990;25-42.
6. Bechtold S.E., Jacobs L.W. Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science. 36(11):1990;1339-1351.
7. Danzig G.B. A comment on eddie's traffic delays at toll booths. Operations Research. 2:1954;339-341.
8. Garey Michael R., Johnson David S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman and Co.
9. Glover F., Laguna M. Tabu search. 1997;Kluwer Academic Publishers.
10. Glover F., McMillan C. The general employee scheduling problem: An integration of MS and AI. Computers and Operations Research. 13(5):1986;563-573.
11. W.K. Jackson, W.S. Havens, H. Dollard, Staff scheduling: A simple approach that worked, Technical Report CMPT97-23, Intelligent Systems Lab, Centre for Systems Science, Simon Fraser University, 1997. Available from 〈citeseer.nj.nec.com/101034.html〉.
12. G. Kortsarz, W. Slany, The minimum shift design problem and its relation to the minimum edge-cost flow problem, Technical Report DBAI-TR-2000-46, Institut für Informationssysteme der Technischen Universität Wien, 2001. Available from 〈http://www.dbai.tuwien.ac.at/staff/slany/pubs/dbai-tr-2001-46.pdf〉.
13. Lau H.C. On the complexity of manpower scheduling. Computers and Operations Research. 23(1):1996;93-102.
14. Minton S., Johnston Mark D., Philips A.B., Laird P. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence. 58:1992;161-205.
15. Moondra L. An LP model for work force scheduling for banks. Journal of Bank Research. 7:1976;299-301.
16. Musliu N., Gärtner J., Slany W. Efficient generation of rotating workforce schedules. Discrete Applied Mathematics. 118(1-2):2002;85-98.
17. Reeves Colin R. Modern Heuristic Techniques for Combinatorial Problems. 1993;Halsted Press.
18. Thompson G. Improved implicit modeling of the labor shift scheduling problem. Management Science. 41(4):1995;595-607.
19. Tien J.M., Kamiyama A. On manpower scheduling algorithms. SIAM Review. 24(3):1982;275-287.