针对最小化制造跨度的差异工件尺寸单批处理机调度问题,通过将其转化为最小化浪费空间的问题,采用候选集策略构建分批以减少搜索空间,利用基于浪费空间的启发式更新信息素,提出一种改进的最大最小蚁群算法.此外,在算法中还引入了一种局部优化策略,以进一步提高算法的性能.仿真实验结果表明,所提出的算法优于其他几种已有算法,验证了所提出算法的有效性和鲁棒性. Aiming at the problem of single-batch scheduling problem with minimized manufacturing span, the problem of waste space is minimized by adopting a candidate set strategy to reduce the search space by using batch-based heuristic updating pheromone , An improved maximum and minimum ant colony algorithm is proposed.In addition, a local optimization strategy is introduced in the algorithm to further improve the performance of the algorithm.The simulation results show that the proposed algorithm is superior to other existing algorithms , Verify the validity and robustness of the proposed algorithm.