Abstract
This paper considers a two-stage flexible flow shop scheduling problem, where there are a single machine at the first stage and m parallel machines at the second stage. Each task can be processed by multiple parallel machines at the second stage. The objective is to minimize the makespan. Under some special conditions there is a 3-approximation algorithm for this problem. We propose a new (\(2+\epsilon \))-approximation algorithm without any condition. For the case where all parallel machines assigned to a task at the second stage must have contiguous addresses, we propose two polynomial time approximation algorithms with approximate ratio less than or equal to 3 by using the existing parallel machine scheduling and strip packing results. Meanwhile two special cases are discussed when the machines number of the second stage is 2 and 3 respectively. Two approximation algorithms with approximation ratios of 2.5 and 2.67 under linear time complexity are proposed. Finally a new lower bound of the model is provided according to the classical Johnson algorithm which improves the previous result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alisantoso D, Khoo KP, Jiang PY (2003) An immune algorithm approach to the scheduling of a flexible PCB flow shop. Int J Adv Manuf Technol 22:819–827
Almeder C, Hartl RF (2013) A meta heuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer. Int J Prod Econ 145(1):88–95
Arthanari TS, Ramamurthy KG (1971) An extension of two machines sequencing problem. Opsearch 8(1):10–22
Choi BC, Lee K (2013) Two-stage proportionate flexible flow shop to minimize the makespane. J Comb Optim 25(1):123–134
Drozdowski M (1996) Scheduling multiprocessor tasks—an overview. Eur J Oper Res 94(2):215–230
Gupta JND, Lauff V, Werner F (2002) Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput Oper Res 29(10):1417–1439
He LM, Sun SJ, Luo RZ (2008) Two-stage flexible flow shop scheduling problems with a batch process on second stage. Chin J Eng Math 25(2):829–842
Jansen K, Thole R (2010) Approximation algorithms for scheduling parallel jobs. SIAM J Comput 39(3):3571–3615
Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Eur J Oper 1(1):61–68
Lee CY, Vairaktarakis GL (1994) Minimizing makespan in hybrid flowshop. Oper Res Lett 16(3):149–158
Lin HT, Liao CJ (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86(2):133–143
Moseley B, Kumar R (2011) On scheduling in map-reduce and flow-shops. ACM Symp Parallelism Algorithms Archit 8(1):289–298
Salvador MS (1973) A solution to a special class of flow shop scheduling problems. In: Symposium of theory of scheduling and its applications, pp 83–91
Steinberg A (1997) A strip-packing algorithm with absolute performance bound 2. SIAM J Comput 26:401–409
Sun JH, Deng QX, Meng YK (2014) Two-stage workload scheduling problem on GPU architectures formulation and approximation algorithm. J Softw 25(2):298–313
Wang W, Hunsucker JL (2003) An evaluation of the CDS heuristicin flow shops with multiple processors. J Chin Inst Ind Eng 20(3):295–304
Acknowledgements
This research was partially supported by NSFC (11101065, 11701062), Liaoning Natural Science Foundation (20170540050), Dalian science and technology program (2015R095).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhang, M., Lan, Y. & Han, X. Approximation algorithms for two-stage flexible flow shop scheduling. J Comb Optim 39, 1–14 (2020). https://doi.org/10.1007/s10878-019-00449-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-019-00449-3