Journal of Combinatorial Optimization

, Volume 25, Issue 2, pp 279–307 | Cite as

Preemptive scheduling on two identical parallel machines with a single transporter

  • Hans Kellerer
  • Alan J. Soper
  • Vitaly A. Strusevich


We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal schedule and design an algorithm that either solves the problem to optimality or in the worst case behaves as a fully polynomial-time approximation scheme.


Scheduling with transportation Parallel machines Approximation scheme 


  1. Brucker P, Knust S, Cheng TCE, Shakhlevich NV (2004) Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Ann Oper Res 129:81–106 MathSciNetMATHCrossRefGoogle Scholar
  2. Dell’Amico M (1996) Shop problems with two machines and time lags. Oper Res 44:777–787 MATHCrossRefGoogle Scholar
  3. Hall LA (1998) Approximability of flow shop scheduling. Math Program, Ser B 82:175–190 MATHGoogle Scholar
  4. Hurink J, Knust S (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Appl Math 112:199–216 MathSciNetMATHCrossRefGoogle Scholar
  5. Kellerer H, Mansini R, Pferschy U, Speranza MG (2003) An efficient fully polynomial approximation scheme for the subset-sum problem. J Comput Syst Sci 66:349–370 MathSciNetMATHCrossRefGoogle Scholar
  6. Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin MATHCrossRefGoogle Scholar
  7. Kellerer H, Soper AJ, Strusevich VA (2010) Transporting jobs through a processing center with two parallel machines. In: Wu W, Daescu O (eds) COCOA 2010, part I. Lect notes comput sci, vol 6508, pp 408–422 Google Scholar
  8. Lee C-Y, Chen Z-L (2001) Machine scheduling with transportation times. J Sched 4:3–24 MathSciNetMATHCrossRefGoogle Scholar
  9. Lee C-Y, Strusevich VA (2005) Two-machine shop scheduling with an uncapacitated interstage transporter. IIE Trans 37:725–736 CrossRefGoogle Scholar
  10. Lushchakova IN, Soper AJ, Strusevich VA (2009) Transporting jobs through a two-machine open shop. Nav Res Logist 56:1–18 MathSciNetMATHCrossRefGoogle Scholar
  11. Qi X (2006) A logistic scheduling model: scheduling and transshipment for two processing centers. IIE Trans 38:609–618 CrossRefGoogle Scholar
  12. Soper AJ, Strusevich VA (2007) An improved approximation algorithm for the two-machine flow shop scheduling problem with an interstage transporter. Int J Found Comput Sci 18:565–591 MathSciNetMATHCrossRefGoogle Scholar
  13. Strusevich VA (1999) A heuristic for the two-machine open-shop scheduling problem with transportation times. Discrete Appl Math 1999:287–304 MathSciNetCrossRefGoogle Scholar
  14. Yu W, Hoogeveen H, Lenstra JK (2004) Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. J Sched 7:333–348 MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Hans Kellerer
    • 1
  • Alan J. Soper
    • 2
  • Vitaly A. Strusevich
    • 2
  1. 1.Institut für Statistik und Operations ResearchUniversität GrazGrazAustria
  2. 2.School of Computing and Mathematical Sciences, Old Royal Naval CollegeUniversity of GreenwichLondonUK

Personalised recommendations