Skip to main content
SpringerLink
Log in

Single-Machine Scheduling with Release Times and Tails

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We study the problem of scheduling jobs with release times and tails on a single machine with the objective to minimize the makespan. This problem is strongly NP-hard, however it is known to be polynomially solvable if all jobs have equal processing time P. We generalize this result and suggest an O(n 2 log nlog P) algorithm for the case when the processing times of some jobs are restricted to either P or 2P.

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

  • Carlier, J. (1982). "The One-Machine Sequencing Problem." European J. Oper. Res. 11, 42–47.

    Google Scholar 

  • Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NPCompleteness. San Francisco: Freeman.

    Google Scholar 

  • Garey, M.R., D.S. Johnson, B.B. Simons, and R.E. Tarjan. (1981). "Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines." SIAM J. Comput. 10, 256–269.

    Google Scholar 

  • Hoogeveen, J.A. (1995). "Minimizing Maximum Promptness and Maximum Lateness on a Single Machine." Math. Oper. Res. 21, 100–114.

    Google Scholar 

  • Jackson, J.R. (1955). "Scheduling a Production Line to Minimize the Maximum Lateness." Management Science Research Report 43, University of California, Los Angeles.

    Google Scholar 

  • McMahon, G. and M. Florian. (1975). "On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness." Oper. Res. 23, 475–482.

    Google Scholar 

  • Schrage, L. (1971). "Obtaining Optimal Solutions to Resource Constrained Network Scheduling Problems." Unpublished manuscript.

  • Vakhania, N. (2002). "Scheduling Equal-Length Jobs with Delivery Times on Identical Processors." Int. J. Comput. Math. 79(6), 715–728.

    Google Scholar 

  • Vakhania, N. (2003). "A Better Algorithm for Sequencing with Release and Delivery Times on Identical Processors." J. Algorithms 48, 273–293.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Science Faculty, State University of Morelos, Av. Universidad 1001, Cuernavaca, 62210, Morelos, Mexico, and

    Nodari Vakhania

  2. Inst. of Computational Math., Akuri 8, Tbilisi, 93, Georgia

    Nodari Vakhania

Authors
  1. Nodari Vakhania
    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

Vakhania, N. Single-Machine Scheduling with Release Times and Tails. Annals of Operations Research 129, 253–271 (2004). https://doi.org/10.1023/B:ANOR.0000030692.69147.e2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ANOR.0000030692.69147.e2

Search

Navigation