On the complexity of manpower shift scheduling

Computers and Operations Research

Volumn 23, Issue 1, 1996, Pages 93-102

  Lau, Hoong Chuin ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003884721     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(94)00094-O     Document Type: Article

References (18)

1. F. Glover and C. McMillan, The general employee scheduling problem: An integration of MS and AL Comput. Ops Res. 13, 563-573 (1986).
2. J. Tien and A. Kamiyama, On manpower scheduling algorithms. SIAM Review 24, 275-287 (1982).
3. K. R. Baker and M. J. Magazine, Workforce scheduling with cyclic demands and day-off constraints. Mgmt Sci. 24, 161-167 (1977).
4. R. N. Burns and M. W. Carter, Work force size and single shift schedules with variable demands. Mgmt Sci. 31, 599-607 (1985).
5. R. N. Burns and G. J. Koop, A modular approach to optimal multiple-shift manpower scheduling. Ops Res. 35, 100-110 (1987).
6. J. G. Morris and M. J. Showalter. Simple approaches to shift, day off and tour scheduling problems. Mgmt Sci. 29, 942-950 (1983).
7. P. Carraresi and G. Gallo, A multi-level bottleneck assignment approach to the bus drivers' rostering problem. Eur. J. Ops Res. 16, 163-173 (1984).
8. S. Martello and P. Toth, A heuristic approach to the bus driver scheduling problem. Eur. J. Ops Res. 24, 106-117 (1986).
9. N. Balakrishnan and R. T. Wong, A network model for rotating workforce scheduling problem. Networks 20, 25-32 (1990).
10. G. Koop, Multiple shift workforce lower bounds. Mgmt Sci. 34, 1221-1230 (1988).
11. C. M. Khoong and H. C. Lau, ROMAN: An integrated approach to manpower planning and scheduling. In Computer Science and Operations Research: New Development in Their Interfaces (Edited by O. Balci, R. Sharda and S. Zenios), pp. 383-396. Pergamon Press, Oxford (1992).
12. C. M. Khoong, H. C. Lau and L. W. Chew, Automated manpower rostering: Techniques and experience. Int. Trans. Opl. Res. 1, 353-361 (1994).
13. S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5, 691-703 (1976).
14. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of N P-Completeness. Freeman, San Francisco, CA (1979).
15. C. M. Khoong, A simple but effective heuristic for workshift assignment. Omega 21, 395 (1993).
16. H. C. Lau, Manpower scheduling with shift change constraints. Lecture Notes in Comput. Sci. (Proc. ISAAC'94) 834, 616-624 (1994).
17. H. C. Lau, Combinatorial approaches for hard problems in manpower scheduling. Submitted (1994).
18. H. C. Lau, Preference-based scheduling via constraint satisfaction. In Optimization Techniques and Applications (Proc. ICOTA'92) (edited by K. H. Phua et al.), pp. 546-554. World Scientific (1992).