A binary-rounding heuristic for multi-period variable-task-duration assignment problems

Computers and Operations Research

Volumn 23, Issue 8, 1996, Pages 819-828

  Miller, Janis L ^a   Franz, Lori S ^b  

^a CLEMSON UNIVERSITY   (United States)

^b UNIVERSITY OF MISSOURI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMAL SYSTEMS; PROBLEM ORIENTED LANGUAGES; THREE DIMENSIONAL;

BINARY ROUNDING HEURISTIC; MULTIPERIOD VARIABLE TASK DURATION ASSIGNMENT PROBLEMS;

INDUSTRIAL MANAGEMENT;

EID: 0030212563     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00073-9     Document Type: Article

References (24)

1. K. C. Gilbert and R. B. Hofstra, Multidimensional assignment problems. Decis. Sci. 19, 306-321 (1988).
2. G. T. Ross and A. A. Zoltners, Weighted assignment models and their application. Mgmt Sci. 25, 683-696 (1979).
3. J. E. Aronson, The multiperiod assignment problem: a multicommodity network flow model and specialized branch and bound algorithm. Eur. J. Opl Res. 9, 367-381 (1986).
4. B. Gavish and H. Pirkul, Algorithms for the multi-resource generalized assignment problem. Mgmt Sci. 37, 695-713 (1991).
5. W. B. Henderson and W. L. Berry, Heuristic methods for telephone operator shift scheduling: an experimental analysis. Mgmt Sci. 22, 1372-80 (1976).
6. S. E. Bechtold and M. J. Showalter, A methodology for labor scheduling in a service operating system. Decis. Sci. 18(1), 89-107 (1987).
7. E. S. Rosenbloom and N. F. Goertzen, Cyclic nurse scheduling. Eur. J. Opl Res. 31(1), 19-23.
8. L. S. Franz, H. M. Baker, G. K. Leong and T. R. Rakes, A mathematical model for scheduling and staffing multiclinic health regions. Eur. J. Opl Res. 41, 277-289 (1989).
9. L.J. Krajewski, L.P. Ritzman and J.P. McKenzie, Shift scheduling in banking operations: a case application. Interfaces 10, 1-6 (1980).
10. M.J. Showalter and V.A. Mabert, An evaluation of a full/part-time tour scheduling methodology. Int. J. Opns and Production Mgmt 8(7), 54-71 (1988).
11. J. G. Morris and M. J. Showalter, Simple approaches to shift, days-off and tour scheduling problems. Mgmt Sci. 29, 942-950 (1983).
12. R. V. Vohra, A quick heuristic for some cyclic staffing problems with breaks. J. Opl Res. Soc. 39, 1057-1061 (1988).
13. J. B. Mazzola and A. W. Neebe, Resource-constrained assignment scheduling. Opns Res. 34, 560-572 (1986).
14. D. de Werra, An introduction to timetabling. Eur. J. Opl Res. 19, 151-162 (1985).
15. H. Crowder, E. L. Johnson and M. W. Padberg, Solving large-scale zero-one linear programming problems. Opns Res. 31, 803-834 (1983).
16. A. Freville and G. Plateau, Heuristics and reduction methods for multiple constraints 0-1 linear programming problems. Eur. J. Opl Res. 24, 206-215 (1986).
17. S. H. Zanakis. Heuristic 0-1 linear programming: an experimental comparison of three methods. Mgmt Sci. 24(1), 91-104 (1977).
18. F. Glover, C. McMillian and R. Glover, A heuristic programming approach to the employee scheduling problem and some thoughts on managerial robots. J. of Opns Mgmt 4, 113-128 (1984).
19. J. J. Bartholdi, A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Opns Res. 29, 501-510 (1981).
20. R. M. Saltzman and F. S. Hillier, A heuristic ceiling point algorithm for general integer linear programming. Mgmt Sci. 38, 263-283 (1992).
21. F. Glover and D. C. Sommer, Pitfalls of rounding in discrete management decision problems. Decis. Sci. 6(2), 211-220 (1975).
22. H. A. Taha, Integer Programming Theory, Applications, and Computations, Academic Press, New York (1975).
23. G. D. Eppen and R. K. Martin, Solving multi-item capacitated lot-sizing problems using variable redefinition. Opns Res. 35, 832-848 (1987).
24. L. S. Franz and J. L. Miller, Scheduling medical residents to rotations: solving the large scale multiperiod staff assignment problem. Opns Res. 41, 269-279 (1993).