Advertisement

Mathematical Methods of Operations Research

, Volume 63, Issue 1, pp 63–75 | Cite as

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

  • Peter BruckerEmail author
  • Sigrid Knust
  • Ceyda Oğuz
Article

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.

Keywords

Scheduling Time-lags Delays Complexity results 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brucker P., Knust S. (1999). Complexity results for single-machine problems with positive finish-start time-lags. Computing 63:299–316zbMATHCrossRefMathSciNetGoogle Scholar
  2. Munier A., Sourd F. (2003). Scheduling chains on a single machine with non-negative time-lags. Math Meth Oper Res 57:111–123zbMATHCrossRefMathSciNetGoogle Scholar
  3. Wikum ED., Llewellyn DC., Nemhauser GL. (1994). One-machine generalized precedence constrained scheduling problems. Oper Res Lett 16:87–99zbMATHCrossRefMathSciNetGoogle Scholar
  4. Yu W. (1996). The two-machine flow shop problem with delays and the one-machine total tardiness problem. PhD Thesis, Technische Universiteit EindhovenGoogle Scholar

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  1. 1.Department of Mathematics/Computer ScienceUniversity of OsnabrückOsnabrückGermany
  2. 2.Department of Industrial EngineeringKoc UniversityIstanbulTurkey

Personalised recommendations