Scheduling a Work Conserving Queue with Deadlines: Minimizing the Cost of Getting the Work Done on Time

  • Randolph Hall
Conference paper


The literature on job-shop scheduling with deadlines has been shaped by this paradigm: Paradigm 1
  1. (1)

    Jobs are processed over a fixed number of hours per day, and overtime is unavailable;

  2. (2)

    Some jobs will inevitably be tardy; and

  3. (3)

    The performance of a scheduling system should be measured on the basis of job tardiness (or earliness).



Idle Time Arrival Process Production Period Service Period Schedule Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Baker, K.R. and G.D. Scudder (1990) “Sequencing with Earliness and Tardiness Penalties: A Review,” Operations Research, V. 38, pp. 22–36.CrossRefGoogle Scholar
  2. Blackstone, J.H., D.T. Phillips and G.L. Hogg (1982) “A State-of-the-art Survey of Dispatching Rules for Manufacturing Job Shop Operations,” International Journal of Production Research. V. 20, pp. 27–45.CrossRefGoogle Scholar
  3. French, S. (1982) Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood, Chichester, U.K.Google Scholar
  4. Graves, S.C. (1981) “A Review of Production Scheduling,” Operations Research. V. 29, pp. 646–675.CrossRefGoogle Scholar
  5. Sen, T. and S.K. Gupta (1984) “A State-of-Art Survey of Static Scheduling Research Involving Due Dates,” Omega. V. 12, pp. 63–76.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1991

Authors and Affiliations

  • Randolph Hall

There are no affiliations available

Personalised recommendations