点击次数：

论文类型：期刊论文

发表时间：2015-09-20

发表刊物：Journal of Information and Computational Science

收录刊物：EI、Scopus

卷号：12

期号：14

页面范围：5495-5504

ISSN号：15487741

摘要：In this paper, we study scheduling problem on parallel machines, where each job is unrelated with others and can be processed by any machine, with the goal of minimizing makespan. Once the processing of a job starts, it must be completed without interruption. Instead of classical Particle Swarm Optimization (PSO) algorithm, we propose an improved algorithm with Levy Flight (LPSO). Through the experiments we find that the shortcoming of PSO, i. e., falling into prematurity, has been improved effectively, and the computational results show that the proposed LPSO algorithm is more competitive than the classical one. Copyright ? 2015 Binary Information Press.