1. Approximation algorithms for the three-machine proportionate mixed shop scheduling.
- Author
-
Liu, Longcheng, Chen, Yong, Dong, Jianming, Goebel, Randy, Lin, Guohui, Luo, Yue, Ni, Guanqun, Su, Bing, Xu, Yao, and Zhang, An
- Subjects
- *
APPROXIMATION algorithms , *COMPUTATIONAL complexity , *MACHINE shops , *NP-hard problems , *POLYNOMIAL time algorithms , *RETAIL stores - Abstract
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 M 3 | p r p t | C max , in which by "proportionate" each job has equal processing times on all three machines. Koulamas and Kyparisis (2015) [6] 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 first 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 then present a fully polynomial-time approximation scheme (FPTAS). On the negative side, while the F 3 | p r p t | 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. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF