在容量不同的平行批处理机环境下,针对工件带有不同尺寸和机器适用限制的最小化制造跨度的批调度问题,提出一种有效的蚁群优化算法.该算法基于解的浪费空间定义启发式信息,针对机器容量约束提出两种用于构建解的候选集,从而有效缩小搜索空间,并引入局部优化方法提高解的质量.仿真实验结果表明,所提出算法具有较好的性能,并且优于已有的其他算法. An efficient ant colony optimization algorithm is proposed for batch scheduling problem of minimizing the manufacturing span of workpieces with different sizes and machine applicable limits in parallel batch machines of different capacities. The algorithm is based on the definition of waste space of solution For the machine capacity constraint, two kinds of candidate sets are proposed to construct the solution, so as to effectively reduce the search space and introduce a local optimization method to improve the quality of the solution. Simulation results show that the proposed algorithm has good performance and excellent There are other algorithms available.