论文标题
安排比例的批处理机
Scheduling a Proportionate Flow Shop of Batching Machines
论文作者
论文摘要
在本文中，我们研究了带有释放日期和固定数字$ m \ geq 2 $机器的批处理机的比例流店。到目前为止，日程安排问题在文献中几乎没有受到任何关注，但是由于现代生物中等医学生产过程的工业规模应用，最近其重要性大大提高。我们表明，对于任何固定数量的机器，MakePAN和完成时间的总和可以在多项式时间中最小化。此外，我们表明，如果所有发布日期均为$ 0 $，则可以使用所获得的算法来最大程度地减少加权总计完成时间，最大迟到，总迟到和（加权）多项式时间的滞纳工作数。以前，多项式时间算法仅因两台机器而闻名。
In this paper we study a proportionate flow shop of batching machines with release dates and a fixed number $m \geq 2$ of machines. The scheduling problem has so far barely received any attention in the literature, but recently its importance has increased significantly, due to applications in the industrial scaling of modern bio-medicine production processes. We show that for any fixed number of machines, the makespan and the sum of completion times can be minimized in polynomial time. Furthermore, we show that the obtained algorithm can also be used to minimize the weighted total completion time, maximum lateness, total tardiness and (weighted) number of late jobs in polynomial time if all release dates are $0$. Previously, polynomial time algorithms have only been known for two machines.
