Improved bounds for acyclic job shop scheduling

Combinatorica

Volumn 22, Issue 3, 2002, Pages 361-399

  Feige, Uriel ^a   Scheideler, Christian ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036433872     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930200018     Document Type: Article

References (14)

1. N. Alon, J. Spencer, and P. Erdos: The Probabilistic Method, Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, 1992.
2. J. Beck: An algorithmic approach to the Lovász local lemma, Random Structures and Algorithms 2(4), 343-365, 1991.
3. R. Cole, B. Maggs, and R. Sitaraman; On the Benefit of Supporting Virtual Channels in Wormhole Routers. In: Proc. of the 8th Symp. on Parallel Algorithms and Architectures, 131-141, 1996.
4. A. Czumaj and C. Scheideler: A new algorithmic approach to the general Lovász local lemma with appheations to scheduling and satisfiability problems, In: Proc. of the 32nd Symp. on Theory of Computing, 38-47, 2000.
5. L.A. Goldberg, M. Paterson, A. Srinivasan, and E. Sweedyk: Better approximation guarantees for job-shop scheduling, In: Proc. of the 8th Symp. on Discrete Algorithms, 599-608, 1997.
6. M. Hofri: Probabilistic Analysis of Algorithms: On Computing Methodologies for Computer Algorithms Performance Evaluation, Springer Verlag, 1987.
7. T. Leighton, B. Maggs, and S. Rao: Universal packet routing algorithms, In: Proc. of the 29th Symp. on Foundations of Computer Science, 256-271, 1988.
8. T. Leighton, B. Maggs, and S. Rao: Packet routing and job-shop scheduling in O(congestion+dilation) steps, Combinatoriea 14 (1994), 167-186.
9. T. Leighton, B. Maggs, and A. Richa: Fast algorithms for finding O(congestion+ dilation) packet routing schedules, Combinatorica 19(2) (1999), 1-27.
10. F. Meyer auf der Heide and B. Vöcking: A packet routing protocol for arbitrary networks, In: Proc. of the 12th Symp. on Theoretical Aspects of Computer Science, 291-302, 1995.
11. 1+ε N) local control packet switching algorithms, In: Proc. of the 29th Ann. ACM Symp. on Theory of Computing, 644-653, 1997.
12. Y. Rabani and E. Tardos: Distributed packet switching in arbitrary networks, In: 28th Ann. ACM Symp. on Theory of Computing, 366-375, 1996.
13. D. Shmoys: C. Stein, and J. Wein: Improved approximation algorithms for shop scheduling problems, SIAM J. on Comput. 23(3), 617-632, 1994.
14. D. Williamson, L. Hall, J. Hoogeveen, C. Hurkens, J. Lenstra, S., Sevastjanov, and D. Shmoys: Short shop schedules, Operations Research, 1996.