论文部分内容阅读
Identical parallel machine scheduling problem for minimizing the makespan is a very important productionscheduling problem. When its scale is large, many difficulties will arise in the course of solving identical parallel machinescheduling problem. Ant system based optimization algorithm (ASBOA) has shown great advantages in solving thecombinatorial optimization problem in view of its characteristics of high efficiency and suitability for practical applications.In this paper, an ASBOA for minimizing the makespan in identical machine scheduling problem is presented. Twodifferent scale numerical examples demonstrate that the ASBOA proposed is efficient and fit for large-scale identicalparallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantages over heuristicprocedure and simulated annealing method, as well as genetic algorithm.