Modeling and algorithmic development of a staff scheduling problem

European Journal of Operational Research

Volumn 128, Issue 3, 2001, Pages 558-569

  Sarin, Subhash C ^a   Aggarwal, Sanjay ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SCHEDULING; STRATEGIC PLANNING;

COLUMN GENERATION METHOD; STAFF SCHEDULING;

OPERATIONS RESEARCH;

EID: 0035254122     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00421-X     Document Type: Article

References (42)

1. Arabeyre, J.P. et al., 1969. The airline crew scheduling problem: A survey. Transportation Science 3 (2), 140-163.
2. Baker, E.K. et al., 1979. Efficient heuristic solution to an airline crew scheduling problem. AIIE Transactions, 79-84.
3. Balas, E., 1975. Some valid inequalities for the set partitioning problem. MSRR 368, Carnegie-Mellon University, Pittsburgh, PA.
4. Balas E. An additive algorithm for solving linear programs with 0-1 variables. Operations Research. 13:1965;517-546.
5. Balas, E., Padberg, M.W., 1975. On the set covering problem: II. An algorithm for set partitioning. Operations Research 23 (1).
6. Balas, E., Samuelson, H., 1974. A symmetric subgradient cutting plane method for set partitioning. W.P. 5-74-75, Carnegie-Mellon University, Pittsburgh, PA.
7. Balinski M.L., Quandt R. On an integer program for a delivery problem. Operations Research. 12:1964;300-304.
8. Balinski M.L. Integer programming: Methods, uses, computation. Management Science. 12(3):1965;253-313.
9. Busacker R.G., Saati T.L. Finite Graphs and Networks. 1965;McGraw-Hill, New York.
10. Cassidy P.J., Bennett H.S. TRAMPS-A multi-depot vehicles scheduling system. Operational Research Quarterly. 23(2):1975;151-163.
11. Christofides, N., 1974. The vehicle routing problem. In: NATO Conference on Combinatorial Optimization, Paris.
12. Clarke G., Wright S.W. Scheduling of vehicles from a central depot to a number of delivery point. Operations Research. 12(4):1964;568-581.
13. Cobham, A. et al., 1961. An application of linear programming to the minimization of Boolean functions. Research Report RC-472, IBM Research Center.
14. Cobham, A., 1962. A statistical study of the minimization of Boolean functions using integer programming. Research Report RC-756, IBM Research Center.
15. Daly, W.N., Spierer, S.J., 1969. Private Communication. Mobile Oil Corporation.
16. Dantzig G.B., Ramser J.H. The truck dispatching problem. Management Science. 6(1):1959;80-91.
17. Day R.H. An optimal extracting from a multiple file data storage system: An application of integer programming. Operations Research. 13(3):1965;482-494.
18. Eilon S., Christofides N. The loading problem. Management Science. 17:1971;259-267.
19. Garfinkel R.S., Nemhauser G.L. Optimal political districting by implicit enumeration techniques. Management Science. 16(8):1970;B495-B508.
20. Garfinkel R.S., Nemhauser G.L. The set partitioning problem: Set covering with equality constraints. Operations Research. 17(5):1969;848-856.
21. Golden, B.L., 1975. Vehicle routing problems: Formulations and heuristic solution techniques. Technical Report No. 113, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
22. Gomory R.E. An algorithm for integer solutions to linear programs. Graves S.C., Wolfe P.M. Recent Advances in Mathematical Programming. 1963;McGraw-Hill, New York.
23. Hung M.S., Brown J.R. An algorithm for a class of loading problems. Naval Research Logistics Quarterly. 25:1978;289-297.
24. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences. 9:1974;256-278.
25. Kolner, T.N., 1966. Some highlights of a scheduling matrix generator system. Presented at the Sixth AGIFORS Symposium, United Airlines.
26. Levin, A., 1969. Fleet routing and scheduling problem for air transportation system. Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge, MA.
27. Marsten R.E. An algorithm for large set partitioning problems. Management Science. 20(5):1974;774-787.
28. Martello S., Toth P. A new algorithm for the zero-one knapsack problem. Management Science. 34:1988;633-644.
29. Martello, S., Toth, P., 1989. An exact algorithm for the bin packing problem. Presented at EURO X, Beograd.
30. Moreland, J.A., 1966. Scheduling of airline flight crews. Master's Thesis, Department of Aeronautica and Astronomics, Massachusetts Institute of Technology, Cambridge, MA.
31. Paul M.C., Unger S.H. Minimizing the number of states in incompletely specified sequential functions. IRE Transactions on Electronic Computers. EC-8:1959;356-367.
32. Pierce J.F., Lasky J.S. Improved combinatorial programming algorithms for a class of all-zero-one integer programming problem. Management Science. 19:1973;528-543.
33. Pierce J.F. Application of combinatorial programming to a class of all-zero-one integer programming problems. Management Science. 15:1968;191-209.
34. Pierce J.F. Pattern sequencing and matching in stock cutting operations. Tappi. 53(4):1970;668-678.
35. Revelle, C. et al., 1970. An analysis of private and public sector location models. Management Science 16 (12), 692-707.
36. Root J.C. An application of symbolic logic to a selection problem. Operations Research. 12(4):1964;519-526.
37. Rubin J. A technique for the solution of massive set covering problems, with application to airline crew scheduling. Transportation Science. 7(1):1973;34-48.
38. Salveson M.E. The assembly line balancing problem. Journal of Industrial Engineering. 6(3):1955;18-25.
39. Spitzer, M., 1961. Solution to the crew scheduling problem. Presented at the First AGIFORS Symposium.
40. Thiriez, H., 1969. Airline crew scheduling: A group theoretic approach. Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge, MA.
41. Valenta, J.R., 1969. Capital equipment decisions: A model for optimal systems interfacing. M.S. Thesis, Massachusetts Institute of Technology, Cambridge, MA.
42. Wanger, W.H., 1968. An application of integer programming to legislative redistricting. Presented at 34th National Meeting of ORSA, CROND, Inc., Philadelphia, PA.