Solving personnel tour scheduling problems using the dual all-integer cutting plane

IIE Transactions (Institute of Industrial Engineers)

Volumn 30, Issue 9, 1998, Pages 835-844

  Brusco, Michael J ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBLEM SOLVING; RELAXATION PROCESSES; SET THEORY; WORK-REST SCHEDULES;

DUAL ALL-INTEGER CUTTING PLANE; GENERALIZED SET-COVERING FORMULATIONS (GSCF); PERSONNEL TOUR SCHEDULING;

SCHEDULING;

EID: 0032154832     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179808966529     Document Type: Article

References (38)

1. Baker, K.R., (1974) Scheduling a full-time workforce to meet cyclic staffing requirements. Management Science, 20, 1561–1568.
2. Burns, R.N., and Carter, M.W., (1985) Workforce size and single shift schedules with variable demands. Management Science, 31, 599–607.
3. Emmons, H., (1985) Workforce scheduling with cyclic requirements and constraints on days off, weekends off, and workstretch. HE Transactions, 17, 8–16.
4. Burns, R.N., and Koop, G.J., (1987) A modular approach to optimal multiple-shift manpower scheduling. Operations Research, 35, 100–110.
5. Hung, R., (1994) A multiple-shift workforce scheduling model under the 4-day workweek and weekend labour demands. Journal of the Operational Research Society, 45, 1088–1092.
6. Hung, R., (1994) Multiple-shift workforce scheduling under the 3-4 workweek with different weekday and weekend requirements. Management Science, 40, 280–284.
7. Hung, R., and Emmons, H., (1993) Multiple-shift workforce scheduling under the 3-4 compressed workweek with a hierarchical workforce. HE Transactions, 25, 82–89.
8. Brusco, M.J., Jacobs, L.W., Bongiorno, R.J., Lyons, D.V., and Tang, B., (1995) Improving personnel scheduling at airline stations. Operations Research, 43, 741–751.
9. Buffa, E.S., Cosgrove, M.J., and Luce, B.J., (1976) An integrated work shift scheduling system. Decision Sciences, 7, 620–630.
10. McGinnis, L.F., Culver, W. D., and Deane, R.H., (1978) One- and two-phase heuristics for workforce scheduling. Computers and Industrial Engineering, 2, 7–15.
11. Henderson, W.B., and Berry, W.L., (1976) Heuristic methods for telephone operator shift scheduling an experimental analysis. Management Science, 22, 1372–1380.
12. Keith, E., (1979) Operator scheduling. AHE Transactions, 11, 37–41.
13. Morris, J.G., and Showalter, M.J., (1983) Simple approaches to shift, days-off, and tour scheduling. Management Science, 29, 942–950.
14. Bechtold, S.E., Brusco, M.J., and Showalter, M.J., (1991) A comparative evaluation of labor tour scheduling methods. Decision Sciences, 22, 683–699.
15. Easton, F.F., and Rossin, D.F., (1991) Sufficient working subsets for the tour scheduling problem. Management Science, 37, 1441–1451.
16. Easton, F.F., and Rossin, D.F., (1991) Equivalent alternative solutions for the tour scheduling problem. Decision Sciences, 22, 985–1007.
17. Glover, F., and McMillan, C., (1986) The general employee scheduling problem An integration of MS and AI. Computers and Operations Research, 13, 563–573.
18. Easton, F.F., and Rossin, D.F., (1996) A stochastic goal program for employee scheduling. Decision Sciences, 27, 541–568.
19. Easton, F.F., and Mansour, N., (1993) A distributed genetic algorithm for employee scheduling problems, in Genetic Algorithms Proceedings of the Fifth International Conference, Morgan Kau-fmann Publishers, San Mateo, CA, Forrest, S. (ed.), pp. 360–367.
20. Brusco, M.J., and Jacobs, L.W., (1993). A simulated annealing approach to flexible labor scheduling problems. Journal of the Operational Research Society, 44, 1191–1200.
21. Easton, F.F., and Rossin, D. F., (1997) Overtime schedules for full-time service workers. Omega, 25, 285–299.
22. Thompson, G. M., (1996) A simulated-annealing heuristic for shift scheduling using non-continuously available employees. Computers and Operations Research, 23, 275–288.
23. Bailey, J.E., (1985) Integrated days-ofTand shift personnel scheduling. Computers and Industrial Engineering, 9, 395–404.
24. Bechtold, S.E., and Jacobs, L.W., (1990) Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science, 36, 1339–1351.
25. Jacobs, L.W., and Brusco, M.J., (1996) Overlapping start-time bands in implicit tour scheduling. Management Science, 42, 1247–1259.
26. Jarrah, A., Bard, J., and de Silva, A., (1994) Solving large-scale tour scheduling problems. Management Science, 40, 1124–1144.
27. Ozkarahan, I., and Bailey, J.E., (1988) Goal programming model subsystem of a flexible nurse scheduling support system. HE Transactions, 20, 306–316.
28. Thompson, G.M., (1995) Improved implicit optimal modeling of (he shift scheduling problem. Management Science, 41, 595–607.
29. Bechtold, S.E., and Brusco, M.J., (1994) Working set generation methods for labor tour scheduling. European Journal of Operational Research. 74, 540–551.
30. Gomory, R.E., (1963) An algorithm for integer solutions to linear programs, in Recent Advances in Mathematical Programming, Graves, R.L. and Wolfe, P. (eds), McGraw-Hill, New York, pp. 269–302.
31. Li, C., Robinson, Jr, E.P., and Mabert, V.A., (1991) An evaluation of tour scheduling heuristics with differences in employee productivity and cost. Decision Sciences, 22, 700–718.
32. Brusco, M. J., and Johns, T. R., (1996) A sequential integer programming method for discontinuous labor tour scheduling. European Journal of Operational Research 95, 537–548
33. Salkin, H. M., and Mathur, K., (1989) Foundations of Integer Programming, North-Holland Elsevier Science Publishing Company, Inc, New York
34. Austin, L.M., and Hanna, M.E., (1983) A bounded dual (all-integer) integer programming algorithm with an objective cut. Naval Research Logistics Quarterly, 30, 271–281.
35. Hanna, M. E., and Austin, L.M., (1985) An advanced start algorithm for all-integer programming. Computers and Operations Research, 12, 301–309.
36. Schrage, L., (1991) User's Manual for Linear, Integer, and Quadratic Programming with LINDO, Release 5.0, The Scientific Press, San Francisco, CA.
37. Gomory, R.E., (1958) Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64, 275–278.
38. Mabert, V. A., and Watts, C. A., (1982) A simulation analysis of tour-shift construction procedures. Management Science, 28, 520–532.