三台机器比例混合车间调度问题的近似算法
Approximation algorithms for the three-machine proportionate mixed shop scheduling
摘要:
混合车间是一种制造基础设施,旨在处理一组流水作业和一组开放车间作业的混合物。混合车间的调度一般比流水车间和开放车间复杂得多,自20世纪80年代以来一直在研究。考虑三台机器按比例混合作业问题$M3 \mid prpt \mid C_{\max}$,其中每个工件在三台机器上的加工时间相等。Koulamas和Kyparisis [{ \it European Journal of Operational Research},243:70--74,2015]证明了该问题在某些非常特殊的情况下在多项式时间内是可解的;对于不可解的情况,他们提出了一种$5/3$ -近似算法。在本文中,我们提出了一个改进的$4/3$ -近似算法,并证明了这个比率的$4/3$是渐近紧的,当最大的作业是流水作业,我们提出了一个完全多项式时间近似计划(FPTAS)。在消极的一面,而$F3 \mid prpt \mid C_{\max}$问题是多项式时间可解的,我们显示了一个有趣的硬度结果,增加一个开放的车间作业的作业集,使问题NP-困难,如果这个开放的车间作业大于任何流水作业。我们也可以为这种特殊情况设计一个FPTAS。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。