Skip to main content
SpringerLink
Log in

Scheduling chains with identical jobs and constant delays on a single machine

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

In this paper we study the single-machine problem 1|chains(l), p j = p|∑ C j in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between consecutive jobs in a chain are satisfied and the sum of all completion times of the jobs is minimized. We show that this problem is polynomially solvable.

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

  • Brucker P., Knust S. (1999). Complexity results for single-machine problems with positive finish-start time-lags. Computing 63:299–316

    Article  MATH  MathSciNet  Google Scholar 

  • Munier A., Sourd F. (2003). Scheduling chains on a single machine with non-negative time-lags. Math Meth Oper Res 57:111–123

    Article  MATH  MathSciNet  Google Scholar 

  • Wikum ED., Llewellyn DC., Nemhauser GL. (1994). One-machine generalized precedence constrained scheduling problems. Oper Res Lett 16:87–99

    Article  MATH  MathSciNet  Google Scholar 

  • Yu W. (1996). The two-machine flow shop problem with delays and the one-machine total tardiness problem. PhD Thesis, Technische Universiteit Eindhoven

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics/Computer Science, University of Osnabrück, Osnabrück, Germany

    Peter Brucker & Sigrid Knust

  2. Department of Industrial Engineering, Koc University, 34450, Sariyer, Istanbul, Turkey

    Ceyda Oğuz

Authors
  1. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sigrid Knust
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ceyda Oğuz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Brucker.

Additional information

AMS Classification 90B35 Scheduling

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Knust, S. & Oğuz, C. Scheduling chains with identical jobs and constant delays on a single machine. Math Meth Oper Res 63, 63–75 (2006). https://doi.org/10.1007/s00186-005-0014-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-005-0014-8

Keywords

Search

Navigation