A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows

Journal of the Operational Research Society

Volumn 49, Issue 6, 1998, Pages 603-615

  Aykin, T ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Integer programming; Service operations management; Shift scheduling

Indexed keywords

ALGORITHMS; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; OPERATIONS RESEARCH;

OPTIMAL SHIFT SCHEDULING; SERVICE OPERATIONS MANAGEMENT;

WORK-REST SCHEDULES;

EID: 0032096643     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600472     Document Type: Article

References (21)

1. Dantzig GB (1954). A comment on Edie’s ‘Traffic delays at toll booths’. Ops Res 2: 339-341.
2. Edie LC (1954). Traffic delays at toll booths. Ops Res 2: 107-138.
3. Aykin T (1996). Optimal shift scheduling with multiple break windows. Mgmt Sei 42: 591-603.
4. Thompson GM (1988). A eomparison of teehniques for sehe- duling non-homogeneous employees in a serviee environment subjeet to non-eyelieal demand, Unpublished Ph.D. dissertation, Florida State University.
5. Showalter MJ and Mabert VA (1988). An evaluation of a full/part-time tour scheduling methodology. IntJ Ops & Prod Res 8: 54-71.
6. Nanda R and Browne J (1992). Introduction to Employee Scheduling. Van Nostrand Reinhold: New York, N.Y.
7. Bedworth DD and Bailey JE(1987). Integrated Production Control Systems, 2nd ed. John Wiley and Sons: New York.
8. Glover F, McMillan C and Grover R (1985). A heuristic programming approach to the employee scheduling problem and some thoughts on ‘Managerial Robots’. J Ops Mgmt 4: 113-128.
9. Easton FF and Rossin DF (1991). Sufficient working subsets for the tour scheduling problem. Mgmt Sci 37: 1441-1451.
10. Holloran TJ and Byrn JE (1986). United Airlines station manpower planning. Interfaces 16: 39-50.
11. Spencer T, Brigandi T, Barlow G and Gomez R (1992). A decision support system for workforce management. In Modelling and Simulation. Proceedings of the 23rd annual Pittsburg conference, part 5.
12. Khoong CM and Lau HC (1992). ROMAN: An integrated approach to manpower planning and scheduling. In: Balci O, Sharda R and Zenios S (eds). Computer Science and Operations Research: New Developments in Their Interfaces. Pergamon Press: New York.
13. Segal M (1974). The operator-scheduling problem: A network flow approach. Ops Res 22: 808-823.
14. Keith EG (1979). Operator scheduling. AIII Trans 11: 37-41.
15. Henderson WB and Berry WL (1976). Heuristic methods for telephone operator shift scheduling: An experimental analysis. Mgmt Sci 22: 1372-1380.
16. Bartoldi JJ (1981). A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Ops Res 29: 501-510.
17. Buffa ES (1980). Modern Production and Operations Management, 6th ed. John Wiley and Sons: New York.
18. Bailey J and Fields J (1985). Personnel scheduling with flexshift models. J Ops Mgmt 5: 327-338.
19. Bechtold SE and Jacobs LW (1990). Implicit modeling of flexible break assignments in optimal shift sheduling. Mgmt Sci 36: 1339-1351.
20. Thompson GM (1995). Improved implicit optimal modelling of labor shift scheduling problem. Mgmt Sci 41: 595-607.
21. Moondra SL (1976). An L.P model for work force scheduling for banks. J Bank Res 6: 299-301.