Skip to main content
SpringerLink
Log in

Job Shop Scheduling With Deadlines

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper we deal with a variant of the Job ShopScheduling Problem. We consider the addition of release dates anddeadlines to be met by all jobs. The objective is makespanminimization if there are no tardy jobs, and tardiness minimizationotherwise. The problem is approached by using a Shifting Bottleneckstrategy. The presence of deadlines motivates an iterative use of aparticular one machine problem which is solved optimally. Theoverall procedure is heuristic and exhibits a good trade-off betweencomputing time and solution quality.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • J. Adams, E. Balas, and D. Zawack, “The shifting bottleneck procedure for job shop scheduling,” Management Science, vol. 34, pp. 391–401, 1988.

    Google Scholar 

  • E. Balas and A. Vazacopoulos, “Guided local search and shifting bottleneck procedure for job shop scheduling,” Management Science Research Report #MSSR–609, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1994. To appear in Management Science.

    Google Scholar 

  • E. Balas, J.K. Lenstra, and A. Vazacopoulos, “The one machine problem with delayed precedence constraints and its use in job shop scheduling,” Management Science, vol. 41, pp. 94–109, 1995.

    Google Scholar 

  • J. Carlier, “The one-machine sequencing problem,” European Journal of Operational Research, vol. 11, pp. 42–47, 1982.

    Google Scholar 

  • E. Demirkol, S. Mehta, and R. Uzsoy, “Benchmarking for shop scheduling problems,” Research Memorandum No. 96-4, Purdue University, 1996.

  • H. Fisher and G.L. Thompson, “Probabilistic learning combinations of local job-shop scheduling rules,” in Industrial Scheduling, J.F. Muth and G.L. Thompson (Eds.), Prentice-Hall: Englewood Cliffs, NJ, 1963.

    Google Scholar 

  • V.J. Leon, Personal communication, 1992.

  • V.J. Leon and S.D. Wu, “On scheduling with ready-times, due-dates and vacations,” Naval Research Logistics, vol. 39, pp. 53–65, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, PA, USA

    Egon Balas & Giuseppe Lancia

  2. University of Udine, Italy

    Paolo Serafini

  3. Fairleigh Dickinson University, Teaneck, NJ, USA

    Alkiviadis Vazacopoulos

Authors
  1. Egon Balas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Lancia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Serafini
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alkiviadis Vazacopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balas, E., Lancia, G., Serafini, P. et al. Job Shop Scheduling With Deadlines. Journal of Combinatorial Optimization 1, 329–353 (1998). https://doi.org/10.1023/A:1009750409895

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009750409895

Search

Navigation