The minimum shift design problem: theory and practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2832, Issue , 2003, Pages 593-604

  Gaspero, Luca Di ^a   Gärtner, Johannes ^b   Kortsarz, Guy ^c   Musliu, Nysret ^d   Schaerf, Andrea ^a   Slany, Wolfgang ^e  

^a UNIVERSITY OF UDINE   (Italy)

^b Ximes Inc   (Austria)

^c RUTGERS UNIVERSITY   (United States)

^d VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^e GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMERCIAL IMPLEMENTATION; DESIGN PROBLEMS; EXPERIMENTAL ANALYSIS; GREEDY HEURISTICS; HARDNESS OF APPROXIMATION; OPTIMAL ASSIGNMENT; SHIFT SCHEDULING; THEORY AND PRACTICE;

SCHEDULING;

EID: 0142183780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (27)

1. Emile Aarts and Jan Karl Lenstra, editors. Local Search in Combinatorial Optimization. Wiley, 1997.
2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice Hall, 1993.
3. K. Arata, S. Iwata, K. Makino, and S. Fujishige. Source location: Locating sources to meet flow demands in undirected networks. In SWAT, 2000.
4. J. Bar-Ilan, G. Kortsarz, and D. Peleg. Generalized submodular cover problems and applications. In The Israeli Symposium on the Theory of Computing, pages 110-118, 1996. Also in Theoretical Computer Science, to appear.
5. J.J. Bartholdi, J.B. Orlin, and H.D. Ratliff. Cyclic scheduling via integer programs with circular ones. Operations Research, 28:110-118, 1980.
6. M. Bellare. Interactive proofs and approximation: reduction from two provers in one round. In The second Israeli Symposium on the Theory of Computing, pages 266-274, 1993.
7. R.D. Carr, L.K. Fleischer, V.J. Leung, and C.A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Proc. of the 11th ACM/SIAM Symposium on Discrete Algorithms, 2000.
8. L. Equi, G. Gallo, S. Marziale, and A. Weintraub. A combined transportation and scheduling problem. European Journal of Operational Research, 97(1):94-104, 1997.
9. Guy Even, Guy Kortsarz, and Wolfgang Slany. On network design problems: Fixed cost flows and the covering steiner problem. In 8th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 2368, pages 318-329, 2002.
10. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Co., 1979.
11. N. Garg, M. Yannakakis, and V.V. Vazirani. Approximating max-flow min(multi)cut theorems and their applications. Siam J. on Computing, 25:235-251, 1996.
12. N. Garg, M. Yannakakis, and V.V. Vazirani. Primal-dual approximation algorithms for integral flow and multicuts in trees. Algorithmica, 18:3-20, 1997.
13. Johannes Gärtner, Nysret Musliu, and Wolfgang Slany. Rota: a research project on algorithms for workforce scheduling and shift design optimization. AI Communications: The European Journal on Artificial Intelligence, 14(2):83-92, 2001.
14. M. Goethe-Lundgren and T. Larsson. A set covering reformulation of the pure fixed charge transportation problem. Discrete Appl. Math., 48(3):245-259, 1994.
15. D. Hochbaum. Optimization over consecutive 1's and circular 1's constraints. Unpublished manuscript, 2000.
16. D.S. Hochbaum and A. Segev. Analysis of a flow problem with fixed charges. Networks, 19(3):291-312, 1989.
17. D. Kim and P.M. Pardalos. A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett., 24(4):195-203, 1999.
18. S.O. Krumke, H. Noltemeier, S. Schwarz, H.-C. Wirth, and R. Ravi. Flow improvement and network flows with fixed costs. In OR-98, Zürich, 1998.
19. G. Laporte. The art and science of designing rotating schedules. Journal of the Operational Research Society, 50:1011-1017, 1999.
20. H.C. Lau. Combinatorial approaches for hard problems in manpower scheduling. J. Oper. Res. Soc. Japan, 39(1):88-98, 1996.
21. C.E. Leiserson and J.B. Saxe. Retiming synchronous circuitry. Algorithmica, 6(1):5-35, 1991.
22. T.L. Magnanti and R.T. Wong. Network design and transportation planning: Models and algorithms. Transportation Science, 18:1-55, 1984.
23. Nysret Musliu, Johannes Gartner, and Wolfgang Slany. Efficient generation of rotating workforce schedules. Discrete Applied Mathematics, 118(1-2):85-98, 2002.
24. Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Local search for shift design. European Journal of Operational Research (to appear), http://www.dbai.tuwien.ac.at/proj/Rota/DBAI-TR-2001-45.ps.
25. C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
26. R. Raz and S. Safra. A sub constant error probability low degree test, and a sub constant error probability PCP characterization of NP. In Proc. 29th ACM Symp. on Theory of Computing, pages 475-484, 1997.
27. A.F. Veinott and H.M. Wagner. Optimal capacity scheduling: Parts i and ii. Operation Research, 10:518-547, 1962.