不同容量平行机下差异工件尺寸的批调度算法

在容量不同的平行批处理机环境下, 针对工件带有不同尺寸和机器适用限制的最小化制造跨度的批调度问题, 提出一种有效的蚁群优化算法. 该算法基于解的浪费空间定义启发式信息, 针对机器容量约束提出两种用于构建解的候选集, 从而有效缩小搜索空间, 并引入局部优化方法提高解的质量. 仿真实验结果表明, 所提出算法具有较好的性能, 并且优于已有的其他算法.

Algorithms for scheduling on parallel batch machines with non-identical capacities and non-identical job sizes

To address the problem of minimizing the makespan for parallel batch process machines with non-identical machine capacities, non-identical jobs sizes and machine eligibility restriction, an effective ant colony optimization(ACO) algorithm is proposed. Based on the wasted space of the solution, the heuristic information is defined. Meanwhile, two candidate sets for constructing the solution are used to narrow the search space. To further enhance the solution quality, a local optimization approach is incorporated. The simulation results show that the proposed algorithm outperforms the other available algorithms.