Job shop scheduling with unit processing times

Mathematics of Operations Research

Volumn 31, Issue 2, 2006, Pages 381-389

  Bansal, Nikhil ^a   Kimbrel, Tracy ^a   Sviridenko, Maxim ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Shop scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; RANDOM PROCESSES; SCHEDULING;

APPROXIMATION ALGORITHMS; JOB SHOP PROBLEM; SHOP SCHEDULING; STRING MATCHING PROBLEM;

OPERATIONS RESEARCH;

EID: 33748434105     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1060.0189     Document Type: Article

References (20)

1. Akers, S. B. 1956. A graphical approach to production scheduling problems. Oper. Res. 4 244-245.
2. Alon, N., J. Spencer. 2000. The Probabilistic Method. John Wiley & Sons, New York.
3. Anderson, E. J., T. S. Jayram, T. Kimbrel. 2001. Tighter bounds on preemptive job shop scheduling with two machines. Computing 67 83-90.
4. Baptiste, P., J. Carlier, A. Kononov, M. Queyranne, S. Sevastianov, M. Sviridenko. Structural properties of preemptive schedules. Forthcoming.
5. Czumaj, A., C. Scheideler. 2000. A new algorithmic approach to the general Lovász local lemma with applications to scheduling and satisfiability problems. Proc. 32nd ACM Sympos. Theory Comput. (STOC), Portland, OR.
6. Feige, U., C. Scheideler. 2002. Improved bounds for acyclic job shop scheduling. Combinatorica 22(3) 361-399.
7. Goldberg, L. A., M. Paterson, A. Srinivasan, E. Sweedyk. 2001. Better approximation guarantees for job-shop scheduling. SIAM J. Discrete Math. 14 67-92.
8. Gonnet, G. 1981. Expected length of the longest probe sequence in hash code searching. J. Association Comput. Machinery 28(2) 289-304.
9. Gonzalez, T., S. Sahni. 1978. Flowshop and jobshop schedules: Complexity and approximation. Oper. Res. 26 36-52.
10. Jansen, K., R. Solis-Oba, M. Sviridenko. 2003. Makespan minimization in job shops: A linear time approximation scheme. SIAM J. Discrete Math. 16 288-300.
11. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys. 1993. Sequencing and scheduling: Algorithms and complexity. S. C. Graves, A. H. G. Rinnooy Kan, P. H. Zipkin, eds. Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, Vol. 4. North-Holland, Amsterdam, The Netherlands, 445-522.
12. Leighton, F. T., B. Maggs, S. Rao. 1994. Packet routing and jobshop scheduling in O(congestion + dilation) steps. Combinatorica 14 167-186.
13. Leighton, F. T., B. M. Maggs, A. W. Richa. 1999. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19 375-401.
14. Raab, M., A. Steger. 1998. Balls into bins - A simple and tight analysis. Randomization and Approximation Techniques in Computer Science (RANDOM), Barcelona, Spain. Lecture Notes in Computer Science, Vol. 1518. Springer, Berlin, Germany, 159-170.
15. Sevastianov, S. 1986. Bounding algorithm for the routing problem with arbitrary paths and alternative servers. Cybernetics 22 773-780.
16. Sevastianov, S. 1994. On some geometric methods in scheduling theory: A survey. Discrete Appl. Math. 55(1) 59-82.
17. Sevastianov, S. V., G. J. Woeginger. 1998. Makespan minimization in preemptive two machine job shops. Computing 60 73-79.
18. Shmoys, D., C. Stein, J. Wein. 1994. Improved approximation algorithms for shop scheduling problems. SIAM J. Comput. 23(3) 617-632.
19. Sotskov, Y., N. Shakhlevich. 1995. NP-hardness of shop-scheduling problems with three jobs. Discrete Appl. Math. 59(3) 237-266.
20. Williamson, D. P., L. A. Hall, J. A. Hoogeveen, C. A. J. Hurkens, J. K. Lenstra, S. V. Sevastianov. D. B. Shmoys. 1997. Short shop schedules. Oper. Res. 45 288-294.