摘要
当优化目标是总的流时间时, 两机成组作业流水车间调度问题是NP难解的。本文提出了一种两机成组作业流水车间优化调度的遗传算法。该遗传算法分两层:一层优化组内作业排序,一层优化组排序。仿真结果表明该方法的有效性。
Two-machine grouped jobs flowshop scheduling problem with the optimal objective of total flowtime is NP-hard. This paper presents a genetic algorithm on flowshop scheduling of two-machine grouped jobs. The genetic algorithm is formed by two levels: the permutation of jobs in groups is optimized in the first level; the permutation of the groups is optimized in the second level. Simulation results reveal this approach is very efficient.
出处
《系统仿真学报》
CAS
CSCD
2001年第z1期88-90,共3页
Journal of System Simulation
关键词
流水车间调度
遗传算法
成组作业
flowshop scheduling
genetic algorithm
grouped jobs
