带惩罚费用的非同类机调度问题的粒子群算法

Particle Swarm Optimization Algorithm with Penalty Cost for Non-identical Machine Scheduling Problem

由于机器处理能力的限制,带惩罚费用的调度问题引起了研究人员的广泛关注.近年来的研究多数都是近似或最优算法的设计.粒子群优化算法,因其简单且易于实现等特点,已经应用于各种领域.针对带有惩罚费用的非同类机调度问题,设计了两种离散的粒子群优化算法,并通过实验比较了两种算法的优劣.

Due to the limitations of the machine processing,scheduling problem with penalty cost caused extensive concern of the researchers.In recent years,most of the similar studies are based on the design of approximate or optimal algorithm.Meanwhile,this paper designs two kinds of discrete particle swarm optimization algorithm for non-identical machine scheduling problem with penalty cost,because the particle swarm optimization algorithm is simple and easy to achieve and has been used in various fields.Furthermore,this study compares the pros and cons of the two algorithms through experiment.