Customer order scheduling on batch processing machines with incompatible job families
研究了单台和并行分批加工机器上考虑不兼容作业族的订单调度问题，目标是最小化订单完工时间和加权总完工时间，提出了多项式时间算法和启发式算法。
This paper addresses the order scheduling problems under configurations of single batch machine and parallel batch machines. Each order consists of several kinds of jobs from different incompatible job families with specific quantities. The batch machine is able to handle a group of jobs simultaneously. Incompatible job families are considered. The objectives are to minimise the order makespan and total weighted order completion time. We prove that the problems with minimising order makespan can be solved in polynomial time for single batch machine and parallel batch machines. As for minimising the total weighted order completion time, efficient heuristic algorithms together with the worst-case analysis are proposed. Numerical results show that the proposed algorithms can achieve high-quality solutions.