基于改进萤火虫群优化算法的同类机调度问题

摘要

针对一类极小化最大完成时间和完成时间之和的同类机调度问题，给出问题的数学模型。考虑作业具有不同到达时间的同类机调度问题，提出一种改进的萤火虫群优化算法。借鉴遗传算法中的变异算子和选择算子，增强算法的全局搜索能力；加入爬山算法作为一种局部搜索算法，增强算法的局部搜索能力。这种全局搜索和局部搜索相结合的机制，使改进的萤火虫群优化算法表现出较高的寻优效率。通过大量实验验证了该算法的有效性。%For a class of parallel machine scheduling problems of minimizing the makespan and the total completion times,the mathematical model of the problem was given.Considering the parallel machine scheduling problem with different arrival times, an improved glowworm swarm optimization algorithm was proposed.The mutation operator and the selection operator of genetic algorithm were used to enhance the global search ability of the algorithm.The climbing algorithm was added as a local search al-gorithm,which enhanced the local search ability of the algorithm.The mechanism combining global search and local search makes the improved glowworm swarm optimization algorithm show higher searching efficiency.The effectiveness of the proposed algorithm is verified through plenty of experiments.