Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
Tài liệu tham khảo
Adamy, 2002, Call control in rings, vol. 2380, 788
Barnhart, 1999, Crew scheduling, 492
Bartholdi, 1980, Cyclic scheduling via integer programs with circular ones, Operations Research, 28, 1074, 10.1287/opre.28.5.1074
Bartholdi, 1981, A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering, Operations Research, 29, 501, 10.1287/opre.29.3.501
Chvátal, 1979, A greedy heuristic for the set-covering problem, Mathematics of Operations Research, 4, 233, 10.1287/moor.4.3.233
Dobson, 1982, Worst-case analysis of greedy heuristics for integer programming with non-negative data, Mathematics of Operations Research, 7, 515, 10.1287/moor.7.4.515
T. Erlebach, private communication, 2003
Garey, 1979
Hochbaum, 1990, Convex separable optimization is not much harder than linear optimization, Journal of the ACM, 37, 843, 10.1145/96559.96597
Hochbaum, 1982, Approximation algorithms for the set covering and vertex cover problems, SIAM Journal on Computing, 11, 555, 10.1137/0211045
Koop, 1988, Multiple shift workforce lower bounds, Management Science, 34, 1221, 10.1287/mnsc.34.10.1221
Lau, 1996, Combinatorial approaches for hard problems in manpower scheduling, Journal of the Operations Research Society of Japan, 39, 88, 10.15807/jorsj.39.88
Lund, 1994, On the hardness of approximating minimization problems, Journal of the ACM, 41, 960, 10.1145/185675.306789
Morris, 1983, Simple approaches to shift, days off and tour scheduling problems, Management Science, 29, 942, 10.1287/mnsc.29.8.942
Orlin, 1993, A faster strongly polynomial minimum cost flow algorithm, Operations Research, 41, 338, 10.1287/opre.41.2.338
Schrijver, 2003
Veinott, 1962, Optimal capacity scheduling: Parts I and II, Operations Research, 10, 518, 10.1287/opre.10.4.518
Vohra, 1988, A quick heuristic for some cyclic staffing problems with breaks, Journal of Operational Research Society, 39, 1057, 10.1057/palgrave.jors.0391110