论文标题
一种解决方案程序，用于最大程度地减少并行批次环境中的总完成时间
A solution procedure for minimizing total completion time in a parallel-batching environment
论文作者
论文摘要
在许多制造过程中，出于容量原因通常需要批处理处理。这既适用于并行和串行批处理。但是，尽管串行批处理处理在文献中很大程度上研究了，因为它与设置问题有关，但对平行批处理处理的研究较少。在并行批处理中，制造工厂（例如，用于燃烧操作的烤箱）能够同时容纳和处理多个部分，并且不利用此类能力会导致制造工厂本身的容量降低，这将能够每隔时间单位处理较小的零件。在本文中，考虑了批处理处理环境中的调度问题。具体来说，提出了列生成算法，用于在单机器和并行机器布局中并行批处理。数值结果表明，由于使用新开发的下限，该算法能够在合理的计算时间内实现良好的解决方案，比文献可用的下限要强得多。
In many manufacturing processes, batch processing is frequently needed for capacity reasons. This applies both to parallel and serial batching. However, while the serial batch processing is largely studied in the literature, as it is related to the setup issues, the parallel batch processing is less investigated. In parallel batching, the manufacturing facility (e.g., ovens for burn-in operations) is able to accommodate, and process, several parts at the same time and not to exploit such ability leads to a reduction in the capacity of the manufacturing facility itself, which will be able to process less parts per time unit. In this paper, the scheduling problem in batch processing environments is considered. Specifically a column generation algorithm is proposed for parallel batching in both single machine and parallel machine layouts. Numerical results show that the proposed algorithm is able to achieve good solutions in reasonable computation time due to the use of a new developed lower bound much stronger than the literature available lower bounds.
