A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
提出一种分支定界算法，解决具有不同加工时间、释放日期和单位尺寸的并行批调度问题，目标是最小化最大完工时间。实验表明该方法在求解时间上优于混合整数规划和单机文献方法。
In this paper, we present a branch and bound algorithm for the parallel batch scheduling of jobs having different processing times, release dates and unit sizes. There are identical machines with a fixed capacity and the number of jobs in a batch cannot exceed the machine capacity. All batched jobs are processed together and the processing time of a batch is given by the greatest processing time of jobs in that batch. We compare our method to a mixed integer program as well as a method from the literature that is capable of optimally solving instances with a single machine. Computational experiments show that our method is much more efficient than the other two methods in terms of solution time for finding the optimal solution.