Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms

Discrete Optimization

Volumn 3, Issue 4, 2006, Pages 327-340

  Hochbaum, Dorit S ^a   Levin, Asaf ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Cyclical scheduling; Multiple shift scheduling problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

COLUMN STRUCTURE; CONSTRAINT MATRIX; CYCLICAL SCHEDULING; MULTIPLE SHIFT SCHEDULING PROBLEM;

OPERATIONS RESEARCH;

EID: 33748466193     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2006.02.002     Document Type: Article

References (25)

1. Adamy U., Ambuehl C., Anand R.S., and Erlebach T. Call control in rings. Proceedings of ICALP 2002. LNCS vol. 2380 (2002) 788-799
2. Atallah M.J., Chen D.Z., and Lee D.T. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica 14 (1995) 15-26
3. Barnhart C., Johnson E.L., Nemhaurser G.L., and Vance P. Crew scheduling. In: Hall R.W. (Ed). Handbook of Transportation Science (1999), Kluwer Academic Publishing, Boston Mass 492-521
4. Bartholdi J.J., Orlin J.B., and Ratliff H.D. Cyclic scheduling via integer programs with circular ones. Operations Research 28 (1980) 1074-1085
5. Bartholdi J.J. A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. Operations Research 29 (1981) 501-510
6. Chvátal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4 (1979) 233-235
7. Dobson G. Worst-case analysis of greedy heuristics for integer programming with non-negative data. Mathematics of Operations Research 7 (1982) 515-531
8. T. Erlebach, private communication, 2003
9. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, San Francisco
10. Hall N.G., and Hochbaum D.S. A fast approximation algorithm for the multicovering problem. Discrete Applied Mathematics 15 (1986) 35-40
11. Hochbaum D.S., and Shanthikumar J.G. Convex separable optimization is not much harder than linear optimization. Journal of the ACM 37 (1990) 843-862
12. Hochbaum D.S., and Tucker P.A. Minimax problems with bitonic matrices. Networks 40 (2002) 113-124
13. Hochbaum D.S. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing 11 (1982) 555-556 an extended version: W.P. #64-79-80, GSIA, Carnegie-Mellon University, April 1980
14. Karzanov A.V. Maximum matching of given weight in complete and complete bipartite graphs. Kibernetika 1 (1987) 7-11
15. Koop G.J. Multiple shift workforce lower bounds. Management Science 34 (1988) 1221-1230
16. Kozen D., Vazirani U.V., and Vazirani V.V. NC algorithms for comparability graphs, interval gaphs, and testing for unique perfect matching. Proc. FSTTCS 1985. LNCS vol. 206 (1985) 496-503
17. Lau H.C. Combinatorial approaches for hard problems in manpower scheduling. Journal of the Operations Research Society of Japan 39 (1996) 88-98
18. Lund C., and Yannakakis M. On the hardness of approximating minimization problems. Journal of the ACM 41 5 (1994) 960-981
19. Morris J.G., and Showalter M.J. Simple approaches to shift, days off and tour scheduling problems. Management Science 29 (1983) 942-950
20. Mulmuley K., Vazirani U.V., and Vazirani V.V. Matching is as easy as matrix inversion. Combinatorica 7 (1987) 105-114
21. Orlin J.B. A faster strongly polynomial minimum cost flow algorithm. Operations Research 41 (1993) 338-350
22. Schrijver A. Combinatorial optimization polyhedra and efficiency (2003), Springer-Verlag, Berlin
23. Veinott A.F., and Wagner H.M. Optimal capacity scheduling: Parts I and II. Operations Research 10 (1962) 518-547
24. Vohra R.V. A quick heuristic for some cyclic staffing problems with breaks. Journal of Operational Research Society 39 (1988) 1057-1061
25. Yi T., Murty K.G., and Spera C. Matching in colored bipartite networks. Discrete Applied Mathematics 121 (2002) 261-277