Skip to main content
SpringerLink
Log in

Job-shop Scheduling Problem

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Complexity Results

Branch and Bound Algorithms

Upper Bounds

Lower Bounds

Branching

Immediate Selection

Heuristic Procedures

  Priority Rule Based Heuristics

  Shifting Bottleneck Heuristic

  Local Search

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Managem Sci 34:391–401

    MATH  MathSciNet  Google Scholar 

  2. Akers SB, Friedman J (1955) A non-numerical approach to production scheduling problems. Oper Res 3:429–442

    Google Scholar 

  3. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149–156

    MATH  Google Scholar 

  4. Balas E, Lenstra JK, Vazacopoulos A (1995) One machine scheduling with delayed precedence constraints. Managem Sci 41:94–1096

    MATH  Google Scholar 

  5. Blackstone JH, Phillips DT, Hogg GL (1982) A state of art survey of dispatching rules for manufacturing. Internat J Production Res 20:27–45

    Article  Google Scholar 

  6. Brinkkötter W, Brucker P (2001) Solving open benchmark instances for the jobshop problem by parallel head-tail adjustments. J Scheduling 4:53–64

    Article  MATH  Google Scholar 

  7. Brucker P (1988) An efficient algorithm for the job-shop problem with two jobs. Computing 40:353–359

    Article  MATH  MathSciNet  Google Scholar 

  8. Brucker P (1994) A polynomial algorithm for the two machine job-shop scheduling problem with fixed number of jobs. Oper Res Spektrum 16:5–7

    Article  MATH  MathSciNet  Google Scholar 

  9. Brucker P (1998) Scheduling algorithms, 2nd edn. Springer, Berlin

    MATH  Google Scholar 

  10. Brucker P, Jurisch B (1993) A new lower bound for the job-shop scheduling problem. Europ J Oper Res 64:156–167

    Article  MATH  Google Scholar 

  11. Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop problem. Discrete Appl Math 49:107–127

    Article  MATH  MathSciNet  Google Scholar 

  12. Brucker P, Kravchenko SA, Sotskov YN (1999) Preemptive job-shop scheduling problems with a fixed number of jobs. Math Meth Oper Res 49:41–76

    MATH  MathSciNet  Google Scholar 

  13. Carlier J, Pinson E (1989) An algorithm for solving the job-shop problem. Managem Sci 35:164–176

    MATH  MathSciNet  Google Scholar 

  14. Haupt R (1989) A survey of priority-rule based scheduling. OR Spektrum 11:3–16

    Article  MATH  MathSciNet  Google Scholar 

  15. Hefetz N, Adiri I (1982) An efficient algorithm for the two-machine unit-time jobshop schedule-length problem. Math Oper Res 7:354–360

    MATH  Google Scholar 

  16. Jackson JR (1956) An extension of Johnson's results on job lot scheduling. Naval Res Logist Quart 3:201–203

    Article  Google Scholar 

  17. Kubiak W, Sethi S, Sriskandarajah C (1995) An efficient algorithm for a job shop problem. Ann Oper Res 57:203–216

    Article  MATH  MathSciNet  Google Scholar 

  18. Lenstra JK, Rinnooy Kan AHG (1979) Computational complexity of discrete optimization problems. Ann Discret Math 4:121–140

    Article  MATH  MathSciNet  Google Scholar 

  19. Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343–362

    Article  MathSciNet  Google Scholar 

  20. Martin PD, Shmoys DB (1996) A new approach to computing optimal schedules for the job shop scheduling problem. Proc. 5th Internat. IPCO Conf.

    Google Scholar 

  21. Muth JF, Thompson GL (1963) Industrial scheduling. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  22. Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the job shop problem. Managem Sci 42:797–813

    MATH  Google Scholar 

  23. Panwalker SS, Iskander W (1977) A survey of scheduling rules. Oper Res 25:45–61

    Article  Google Scholar 

  24. Sotskov YN (1991) On the complexity of shop scheduling problems with two or three jobs. Europ J Oper Res 53:323–336

    Article  Google Scholar 

  25. Sotskov YN, Shakhlevich NV (1995) NP-hardness of shop-scheduling problems with three jobs. Discrete Appl Math 59:237–266

    Article  MATH  MathSciNet  Google Scholar 

  26. Timkovsky VG (1985) On the complexity of scheduling an arbitrary system. Soviet J Comput Syst Sci 23(5):46–52

    MathSciNet  Google Scholar 

  27. Vaessens RJM, Aarts EHL, Lenstra JK (1996) Job shop scheduling by local search. INFORMS J Comput 8:302–317

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachber. Math./Informatik, Universität Osnabrück, Osnabrück, Germany

    Peter Brucker

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Brucker, P. (2008). Job-shop Scheduling Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_313

Download citation

Publish with us

Policies and ethics

Search

Navigation