A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops

Abstract We investigate the approximability of the m parallel two-stage flow-shop (mP2FS) problem, where a set of jobs is scheduled on the multiple identical two-stage flow-shops to minimize the makespan, i.e., the finishing time of the last job. Each job needs to be processed non-preemptively on one flow-shop without switching to the other flow-shops. This problem is a hybrid of the classic parallel machine scheduling and two-stage flow-shop scheduling problems. Its strong NP-hardness follows from the parallel machine scheduling problem when the number of machines is part of the input. Our main contribution is a polynomial-time approximation scheme (PTAS) for the mP2FS problem when the number of shops is part of the input, which improves the previous best approximation algorithm of a ratio ( 2 + ϵ ) . Owing to the strong NP-hardness, our PTAS achieves the best possible approximation ratio.

[1]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[2]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[3]  Randy Goebel,et al.  An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops , 2018, Theor. Comput. Sci..

[4]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

[5]  Steef L. van de Velde,et al.  Approximation algorithms for the parallel flow shop problem , 2012, Eur. J. Oper. Res..

[6]  Jianxin Wang,et al.  Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops , 2017, COCOON.

[7]  Bo Chen.  Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage , 1995 .

[8]  Leslie A. Hall.  Approximability of flow shop scheduling , 1998, Math. Program..

[9]  Jianer Chen,et al.  Approximation Algorithms on Multiple Two-Stage Flowshops , 2018, COCOON.

[10]  Sartaj Sahni,et al.  Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[11]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[12]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[13]  A. Kusiak,et al.  A scheduling problem in glass manufacturing , 1996 .

[14]  Yin-Feng Xu,et al.  Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72] , 2017, Theoretical Computer Science.

[15]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[16]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[17]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[18]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[19]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[20]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[21]  Hong Wang,et al.  Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions , 2005, Expert Syst. J. Knowl. Eng..

[22]  Jianer Chen,et al.  On Approximation Algorithms for Two-Stage Scheduling Problems , 2017, FAW.

[23]  Klaus Jansen,et al.  Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem , 2000, STACS.

[24]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[25]  George L. Vairaktarakis,et al.  The use of flowlines to simplify routing complexity in two-stage flowshops , 2000 .

[26]  Yin-Feng Xu,et al.  An FPTAS for the parallel two-stage flowshop problem , 2017, Theor. Comput. Sci..

[27]  Gerhard J. Woeginger,et al.  A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem , 2000, Theor. Comput. Sci..

[28]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .