Models and algorithms for a staff scheduling problem

Mathematical Programming

Volumn 98, Issue , 2003, Pages 445-476

  Caprara, Alberto ^a   Monaci, Michele ^a   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Branch and bound; Column generation; Computational results; Heuristic algorithms; Integer linear programming; Max imum flow; Staff scheduling

Indexed keywords

BRANCH AND BOUNDS; COLUMN GENERATION; COMPUTATIONAL RESULTS; INTEGER LINEAR PROGRAMMING; MAX-IMUM FLOW; STAFF SCHEDULING;

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; SCHEDULING;

ITERATIVE METHODS;

EID: 13844269586     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0413-7     Document Type: Article

References (27)

1. Aykin, T.: Optimal shift scheduling with multiple break windows. Management Science 42, 591-602 (1996)
2. Aykin, T.: A comparative evaluation of modeling approaches to the labor shift scheduling problem. European Journal of Operational Research 125, 381-397 (2000)
3. Balakrishnan, N., Wong, R.T.: A network model for the rotating workforce scheduling problem. Networks 20, 25-42 (1990)
4. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Vance, P.H.: Crew scheduling. In R.W. Hall, editor, Handbooks of Transportation Science, pages 493-521, Norwell, MA, 1999. Kluwer Academic Publisher
5. Bartholdi III, J.J.: A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Operations Research 29, 501-510 (1981)
6. Bartholdi III, J.J., Orlin, J.B., Ratliff, H.D.: Cyclic scheduling via integer programs with circular ones. Operations Research 28, 1074-1085 (1980)
7. Beaumont, N.: Scheduling staff using mixed integer programming. European European Journal of Operational Research 98, 473-484 (1997)
8. Bechtold, S.E., Jacobs, L.W.: The equivalence of general set-covering and implicit integer programming formulations for shift scheduling. Naval Research Logistics 43, 233-250 (1996)
9. Billionnet, A.: Integer programming to schedule a hierarchical workforce with variable demands. European Journal of Operational Research 114, 105-114 (1999)
10. Brusco, M.J., Jacobs, L.W.: Personnel tour scheduling when starting-time restrictions are present. Management Science 44, 534-547 (1998)
11. Brusco, MJ., Jacobs, L.W.: Optimal models for meal-break and start-time flexibility in continuous tour scheduling. Management Science 46, 1630-1641 (2000)
12. Brusco, MJ., Jacobs, L.W., Bongiorno, RJ., Lynos, D.V., Tang, B.: Improving personnel scheduling at airline stations. Operations Research 43, 741-751 (1995)
13. Caprara, A., Fischetti, M., Toth, P., Vigo, D., Guida, P.L.: Algorithms for railway crew management. Mathematical Programming 79, 125-141 (1997)
14. Cook, WJ., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley & Sons, Inc, 1998
15. Cormen, T.H., Leiserson, CE., Rivest, R.R.: Introduction to Algorithms. MIT Press, 1990
16. Ernst, A.T, Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research, (to appear)
17. Gamache, M., Soumis, F., Marquis, G., Desrosiers, J.: A column generation approach for large-scale aircrew rostering problems. Operations Research 47, 247-263 (1999)
18. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, San Francisco, 1979
19. Geoffrion, A.M.: Lagrangean relaxation for integer programming. Mathematical Programming Study 2, 82-114 (1974)
20. Jacobs, L.W., Brusco, M.J.: Overlapping start-time bands in implicit tour scheduling. Management Science 42, 1247-1259 (1996)
21. Jarrah, A.I.Z., Bard, J.F., deSilva, A.: Solving large-scale tour scheduling problems. Management Science 40, 1124-1144 (1994)
22. Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. European Journal of Operational Research 107, 1-18 (1998)
23. Marcotte, O.: An instance of the cutting stock problem for which the rounding property does not hold. Operations Research Letters 4, 239-243 (1986)
24. Mehrotra, A., Murphy, K.E., Trick, M.A.: Optimal shift scheduling: a branch-and-price approach. Naval Research Logistics 47, 185-200 (2000)
25. Thompson, G.M.: Improved implicit optimal modeling of the labor shift scheduling problem. Management Science 41, 595-607 (1995)
26. Thompson, G.M.: Labor staffing and scheduling models for controlling service levels. Naval Research Logistics 44, 719-740 (1997)
27. Tien, J.M., Kamiyama, A.: On manpower scheduling algorithms. SIAM Review 24, 275-287 (1982)