摘要
多机多阶段流水车间(Flowshop)提前/拖期调度问题的目标是使工件的提前/拖期惩罚成本最小,这是一个NP完全问题,很难用一般的方法解决。本文首先给出了问题的数学模型, 然后构造并采用多种群并行自适应遗传算法求解该问题。仿真结果表明此算法不仅具有较强的全局收敛性,而且有更快的寻优速度,是求解复杂调度问题的有效算法。
The objective of earliness and tardiness flowshop scheduling problem with multiple processors is to minimize the total earliness and tardiness cost. It is difficulty to resolve this problem with a general way because it is a NP complete problem. In this paper, a model of this problem is presented and a multigroup parallel and adaptive genetic algorithm is constructed. The simulation results show that this method not only has global convergence, but also quicken the compution of evolution; the way of representing the chromosome can keep the feasibility of the solution. It is a good method for solving complex scheduling problem.
出处
《电工技术学报》
EI
CSCD
北大核心
2005年第4期58-61,共4页
Transactions of China Electrotechnical Society
基金
国家自然科学基金资助项目(60104009)
