Approximation algorithms for the three-machine proportionate mixed shop scheduling

A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-shops, and have been studied since the 1980's. We consider the three machine proportionate mixed shop problem denoted as $M3 \mid prpt \mid C_{\max}$, in which each job has equal processing times on all three machines. Koulamas and Kyparisis [{\it European Journal of Operational Research}, 243:70--74,2015] showed that the problem is solvable in polynomial time in some very special cases; for the non-solvable case, they proposed a $5/3$-approximation algorithm. In this paper, we present an improved $4/3$-approximation algorithm and show that this ratio of $4/3$ is asymptotically tight; when the largest job is a flow-shop job, we present a fully polynomial-time approximation scheme (FPTAS). On the negative side, while the $F3 \mid prpt \mid C_{\max}$ problem is polynomial-time solvable, we show an interesting hardness result that adding one open-shop job to the job set makes the problem NP-hard if this open-shop job is larger than any flow-shop job. We are able to design an FPTAS for this special case too.

[1]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

[2]  Hans Kellerer,et al.  An Efficient Approximation Scheme for the Subset-Sum Problem , 1997, ISAAC.

[3]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[4]  Frank Werner,et al.  Complexity of mixed shop scheduling problems: A survey , 2000, Eur. J. Oper. Res..

[5]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[6]  Robert L. Bulfin,et al.  Scheduling ordered open shops , 1987, Comput. Oper. Res..

[7]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[8]  Natalia V. Shakhlevich,et al.  Scheduling two jobs with fixed and nonfixed routes , 2005, Computing.

[9]  Frank Werner,et al.  Shop‐scheduling problems with fixed and non‐fixedmachine orders of the jobs , 1999, Ann. Oper. Res..

[10]  Christos Koulamas,et al.  Review of the ordered and proportionate flow shop scheduling research , 2013 .

[11]  V. A. Strusevich,et al.  Two-Machine Super-Shop Scheduling Problem , 1991 .

[12]  Francis Y. L. Chin,et al.  On J-maximal and J-minimal Flow-Shop Schedules , 1981, JACM.

[13]  Hans Kellerer,et al.  Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem , 2004, J. Comb. Optim..

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

[15]  Christos Koulamas,et al.  The three-machine proportionate open shop and mixed shop minimum makespan problems , 2015, Eur. J. Oper. Res..

[16]  Hiroaki Ishii,et al.  The mixed shop scheduling problem , 1985, Discret. Appl. Math..