Optimal Shift Scheduling: A Branch-and-Price Approach

Naval Research Logistics

Volumn 47, Issue 3, 2000, Pages 185-200

  Mehrotra, Anuj ^a   Murphy, Kenneth E ^b   Trick, Michael A ^c  

^a UNIVERSITY OF MIAMI   (United States)

^b FLORIDA INTERNATIONAL UNIVERSITY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346054881     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(200004)47:3<185::AID-NAV1>3.0.CO;2-7     Document Type: Article

References (25)

1. D.W. Ashley. A spreadsheet optimization system for library staff scheduling. Comput Oper Res 22 (1995), 615-624.
2. T. Aykin. Optimal shift scheduling with multiple break windows. Manage Sci 42 (1996), 591-602.
3. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance, Branch-and-price: Column generation for huge integer programs, Oper Res 46 (1998), 316-329.
4. S.E. Bechtold and L.W. Jacobs, Implicit modeling of flexible break assignments in optimal shift scheduling, Manage Sci 36 (1990), 1339-1351.
5. S.E. Bechtold and L.W. Jacobs, Improvement of labour utilisation in shift scheduling for services with implicit optimal modeling, Int J Oper Prod Manage 11 (1991), 54-69.
6. E.S. Buffa, M.S. Cosgrove, and B.J. Luce, An integrated work shift scheduling system. Decision Sciences 7 (1976), 620-630.
7. G.B. Dantzig. A comment on Edie's traffic delays at toll booths, Oper Res 2 (1954), 339 341.
8. F.F. Easton and D.F. Rossin, Sufficient working subsets for the tour scheduling problem. Manage Sci 37 (1991), 1441 1451.
9. L.C. Edie, Traffic delays at toll booths, Oper Res 2 (1954), 107-138.
10. F. Glover and C. McMillan, The general employee scheduling problem: An integration of MS and AI, Comput Oper Res 13 (1986), 563-573.
11. W.B. Henderson and W.L. Berry, Heuristic methods for telephone operator shift scheduling, Manage Sci 22 (1976), 1372-1380.
12. T.J. Holloran and J.E. Byrn, United Airlines station manpower planning system, Interfaces 16 (1986), 39-50.
13. E.L. Johnson, A. Mehrotra, and G.L. Nemhauser, Min-cut clustering, Math Program 62 (1993), 133-151.
14. L. Kleinrock, Queuing systems, Vol 1, Wiley, New York, 1975.
15. G.F. MacPherson, How staffing affects ACD trunking requirements, Bus Commun Rev (1988), 36-39.
16. A. Mehrotra and M.A. Trick, A column generation approach for graph coloring, INFORMS J Comput 8 (1996), 344-354.
17. V. Mehrotra, Ringing up big business, ORMS Today (August 1997), 18-25.
18. S.L. Moondra, An LP model for work force scheduling in banks, J Bank Res 6 (1976), 299-301.
19. G.L. Nemhauser, M.W.P. Savelsbergh, and G.C. Sigismondi, MINTO, a Mixed INTeger Optimizer, Oper Res Lett 15 (1994), 47-58.
20. D.M. Ryan and B.A. Foster, An integer programming approach to scheduling, Computer scheduling of public transport urban passenger vehicle and crew scheduling, A. Wren (Editor), North-Holland, Amsterdam, 1981, pp. 269-280.
21. M. Segal, The operator-scheduling problem: A network-flow approach, Oper Res 22 (1974), 808-823.
22. G.M. Thompson, Improved implicit optimal modeling of the labor shift scheduling problem, Manage Sci 41 (1995), 595-607.
23. G.M. Thompson, Assigning telephone operators to shifts at New Brunswick Telephone Company, Interfaces 27(4) (1997), 1-11.
24. P.H. Vance, C. Barnhart, E.L. Johnson, and G.L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Comput Optim Appl III (1993), 111-130.
25. F. Vanderbeck, Decomposition and column generation for integer programs, Doctoral Thesis, Faculté des Sciences Appliquées, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 1994.