Advertisement

Journal of Combinatorial Optimization

, Volume 37, Issue 2, pp 668–684 | Cite as

A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops

  • Jianming Dong
  • Ruyan Jin
  • Jueliang Hu
  • Guohui LinEmail author
Article
  • 129 Downloads

Abstract

A two-stage openshop consists of a machine in the first stage and a machine in the second stage; a job processed on the two-stage openshop means it is processed non-preemptively by each of the two machines, in whichever order. We consider the scheduling problem at the availability of multiple parallel identical two-stage openshops, with the goal to minimize the makespan. By uncovering the important role of the critical job in the optimal schedule on a two-stage openshop, we propose to sort the jobs in the novel critical-job order, and use this order to design a pseudo-polynomial time dynamic programming exact algorithm to solve our scheduling problem with any fixed number of two-stage openshops. Afterwards, using the standard scaling technique, we develop the dynamic programming algorithm into a fully polynomial-time approximation scheme. These results improve previously proposed constant ratio approximation algorithms.

Keywords

Scheduling Two-stage openshop Makespan Dynamic programming Fully polynomial-time approximation scheme 

Notes

Acknowledgements

JD is supported by the NNSF China Grant No. 11501512 and the Zhejiang Provincial Natural Science Foundation Grant No. LY18A010029; part of his work was done while visiting the University of Alberta. JH is supported by the NNSF China Grants Nos. 11271324 and 11471286; part of his work was done while visiting the University of Alberta. GL is supported by NSERC Canada and the NNSF China Grant No. 61672323.

References

  1. Al-Salem A (2004) A heuristic to minimize makespan in proportional parallel flow shops. Int J Comput Inf Sci 2:98–107Google Scholar
  2. Cao D, Chen M (2003) Parallel flowshop scheduling using Tabu search. Int J Prod Res 41:3059–3073CrossRefzbMATHGoogle Scholar
  3. Chen B (1995) Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage. J Oper Res Soc 46:234–244CrossRefzbMATHGoogle Scholar
  4. Chen B, Strusevich VA (1993) Worst case analysis of heuristics for open shops with parallel machines. Eur J Oper Res 70:379–390CrossRefzbMATHGoogle Scholar
  5. Chen B, Glass CA, Potts CN, Strusevich VA (1996) A new heuristic for three-machine flow shop scheduling. Oper Res 44:891–898CrossRefzbMATHGoogle Scholar
  6. Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. Springer, Berlin, pp 1493–1641zbMATHGoogle Scholar
  7. Chen Y, Zhang A, Chen G, Dong J (2013) Approximation algorithms for parallel open shop scheduling. Inf Process Lett 113:220–224MathSciNetCrossRefzbMATHGoogle Scholar
  8. Dong J, Hu J, Kovalyov MY, Lin G, Luo T, Tong W, Wang X, Xu Y (2017) Corrigendum to “An FPTAS for the parallel two-stage flowshop problem. Theoretical computer science, 657: 64–72 (2017)”. Theor Comput Sci 687:93–94CrossRefGoogle Scholar
  9. Dong J, Tong W, Luo T, Wang X, Hu J, Xu Y, Lin G (2017) An FPTAS for the parallel two-machine flowshop problem. Theor Comput Sci 657:64–72CrossRefzbMATHGoogle Scholar
  10. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San FranciscozbMATHGoogle Scholar
  11. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129MathSciNetCrossRefzbMATHGoogle Scholar
  12. Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. J ACM 23:665–679MathSciNetCrossRefzbMATHGoogle Scholar
  13. Gonzalez T, Sahni S (1978) Flowshop and jobshop schedules: complexity and approximation. Oper Res 26:36–52MathSciNetCrossRefzbMATHGoogle Scholar
  14. Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39:359–364CrossRefzbMATHGoogle Scholar
  15. Gupta JND, Tunc EA (1991) Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. Int J Prod Res 29:1489–1502CrossRefGoogle Scholar
  16. Gupta JND, Hariri AMA, Potts CN (1997) Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann Oper Res 69:171–191CrossRefzbMATHGoogle Scholar
  17. Hall LA (1998) Approximability of flow shop scheduling. Math Program 82:175–190MathSciNetzbMATHGoogle Scholar
  18. Hochbaum D, Shmoys D (1987) Using dual approximation algorithms for scheduling problems: theoretical and practical results. J ACM 34:144–162MathSciNetCrossRefGoogle Scholar
  19. Hoogeveen JA, Lenstra JK, Veltman B (1996) Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard. Eur J Oper Res 89:172–175CrossRefzbMATHGoogle Scholar
  20. Jansen K, Sviridenko MI (2000) Polynomial time approximation schemes for the multiprocessor open and flow shop scheduling problem. In: Proceedings of STACS 2000, LNCS 1770, pp 455–465Google Scholar
  21. Johnson SM (1954) Optimal two- and three-machine production schedules with setup times included. Nav Res Logist 1:61–68CrossRefGoogle Scholar
  22. Pinedo M (2016) Scheduling: theory, algorithm and systems. Springer, BerlinCrossRefzbMATHGoogle Scholar
  23. Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1–18MathSciNetCrossRefzbMATHGoogle Scholar
  24. Sahni SK (1976) Algorithms for scheduling independent tasks. J ACM 23:116–127MathSciNetCrossRefzbMATHGoogle Scholar
  25. Schuurman P, Woeginger GJ (1999) Approximation algorithms for the multiprocessor open shop scheduling problem. Oper Res Lett 24:157–163MathSciNetCrossRefzbMATHGoogle Scholar
  26. Schuurman P, Woeginger GJ (2000) A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor Comput Sci 237:105–122MathSciNetCrossRefzbMATHGoogle Scholar
  27. Sevastianov SV, Woeginger GJ (1998) Makespan minimization in open shops: a polynomial time approximation scheme. Math Program 82:191–198MathSciNetzbMATHGoogle Scholar
  28. Tong W, Miyano E, Goebel R, Lin G (2016) A PTAS for multiple parallel identical multi-stage flowshops to minimize the makespan. In: Proceedings of the 10th international frontiers of algorithmics workshop (FAW 2016), LNCS 9711, pp 227–237Google Scholar
  29. Vairaktarakis G, Elhafsi M (2000) The use of flowlines to simplify routing complexity in two-stage flowshops. IIE Trans 32:687–699Google Scholar
  30. Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22:78–85CrossRefGoogle Scholar
  31. Williamson DP, Hall LA, Hoogeveen JA, Hurkens CAJ, Lenstra JK, Sevastianov SV, Shmoys DB (1997) Short shop schedules. Oper Res 45:288–294MathSciNetCrossRefzbMATHGoogle Scholar
  32. Zhang X, van de Velde S (2012) Approximation algorithms for the parallel flow shop problem. Eur J Oper Res 216:544–552MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsZhejiang Sci-Tech UniversityHangzhouChina
  2. 2.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations