Journal of Combinatorial Optimization

, Volume 31, Issue 3, pp 1316–1334 | Cite as

An improved two-machine flowshop scheduling with intermediate transportation

  • Jianming Dong
  • Xueshi Wang
  • Jueliang Hu
  • Guohui LinEmail author


A two-machine flowshop scheduling problem with intermediate transportation is investigated in this paper, where jobs of varying sizes finished on the first machine need to be transported to the other machine for further processing. One service vehicle of a limited capacity is used for transportation between the two machines. The problem objective is to minimize the makespan, that is the finishing time of the last job on the second machine. Using a better bin-packing algorithm and balancing between two schedules, we present an \(\frac{11}{5}\)-approximation algorithm for the problem, which improves the previously best \(\frac{7}{3}\)-approximation algorithm by Gong and Tang.


Flowshop scheduling Bin-packing Approximation algorithm Worst-case performance analysis 



Dong is supported by the Zhejiang Provincial Natural Science Foundation Grants No. LY13A010015 and the Science Foundation of Zhejiang Sci-Tech University (ZSTU) Grants No. 13062171-Y; Hu is supported by National Natural Science Foundation of China Grants No. 11271324 and 11471286; Lin is supported by NSERC and the Science Foundation of Zhejiang Sci-Tech University (ZSTU) Grants No. 14062170-Y. Lin’s work was mostly done during his sabbatical leave at the ZSTU. The authors are grateful to the anonymous reviewers for their insightful comments that improve the presentation greatly.


  1. Chang Y-C, Lee C-Y (2004) Machine scheduling with job delivery coordination. Eur J Oper Res 158:470–487MathSciNetCrossRefzbMATHGoogle Scholar
  2. Cheng B, Yang S, Hu X, Li K (2014) Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes. Int J Syst Sci 45:571–578MathSciNetCrossRefzbMATHGoogle Scholar
  3. Cheng TCE, Gordon VS, Kovalyov MY (1996) Single machine scheduling with batch deliveries. Eur J Oper Res 94:277–283CrossRefzbMATHGoogle Scholar
  4. Jr Coffmann EG, Galambos G, Martello S, Vigo D (1998) Bin packing approximation algorithms: combinatorial analysis. Kluwer Academic Publishers, Philip Drive NorwellGoogle Scholar
  5. de la Vega WF, Lueker GS (1981) Bin packing can be solved within \(1 + \epsilon \) in linear time. Combinatorica 1:349–355MathSciNetCrossRefzbMATHGoogle Scholar
  6. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San FranciscozbMATHGoogle Scholar
  7. Garey MR, Johnson DS (1985) A \(71/60\) theorem for bin-packing. J Complex 1:65–106MathSciNetCrossRefzbMATHGoogle Scholar
  8. Gong H, Tang L (2011) Two-machine flowshop scheduling with intermediate transportation under job physical space consideration. Comput Oper Res 38:1267–1274MathSciNetCrossRefzbMATHGoogle Scholar
  9. Johnson SM (1954) Optimal two- and three-machine production schedules with setup times included. Naval Res Logist 1:61–68CrossRefGoogle Scholar
  10. Lee C-Y, Chen Z-L (2001) Machine scheduling with transportation considerations. J Sched 4:3–24MathSciNetCrossRefzbMATHGoogle Scholar
  11. Lee C-Y, Strusevich VA (2005) Two-machine shop scheduling with an uncapacitated interstage transporter. IIE Trans 37:725–736CrossRefGoogle Scholar
  12. Maggu PL, Das G (1980) On \(2\times n\) sequencing problem with transportation times of jobs. Pure Appl Math Sci 12:1–6MathSciNetzbMATHGoogle Scholar
  13. Pinedo M (1995) Scheduling: theory algorithm and systems. Prentice-Hall, Englewoods CliffszbMATHGoogle Scholar
  14. Simchi-Levi D (1994) New worst-case results for the bin packing problem. Naval Res Logist 41:579–585MathSciNetCrossRefzbMATHGoogle Scholar
  15. Su C-S, Pan JC-H, Hsu T-S (2009) A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theoret Comput Sci 410:2581–2591MathSciNetCrossRefzbMATHGoogle Scholar
  16. Tang L, Guan J, Hu G (2010) Steel making and refining coordinated scheduling problem with waiting time and transportation consideration. Comput Ind Eng 58:239–248CrossRefGoogle Scholar
  17. Yue M, Zhang L (1995) A simple proof of the inequality \(\text{ MFFD }({L})\le \frac{71}{60}\,\text{ OPT }({L}) + 1\), \(\forall {L}\), for the MFFD bin-packing algorithm. Acta Mathematica Applicate Sinica 11:318–330MathSciNetCrossRefzbMATHGoogle Scholar
  18. Zhong WY, Dósa G, Tan ZY (2007) On the machine scheduling problem with job delivery coordination. Eur J Oper Res 182:1057–1072MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Jianming Dong
    • 1
  • Xueshi Wang
    • 1
  • Jueliang Hu
    • 1
  • Guohui Lin
    • 1
    • 2
    Email author
  1. 1.Department of MathematicsZhejiang Sci-Tech UniversityHangzhouChina
  2. 2.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations