用遗传算法解决在并行机上带有不同交货期窗口的Job-Shop调度问题  

Using Genetic Algorithm for Earliness and Tardiness Scheduling Problem with Different Due Windows on The Parallel Machines

作　　者：童刚[1] 李光泉 刘宝坤 

机构地区：[1]天津大学,天津300072

出　　处：《系统工程》2000年第3期37-42,共6页Systems Engineering

摘　　要：本文讨论了不同交货期窗口下的提前／拖期并行机调度问题，提出了染色 体用工件编号进行编码的编码规则，给出了用稳步遗传算法求解上述问 题的方法。仿真实验表明了算法及编码规则的可行性和有效性。In this paper,the earliness and tardiness scheduling problem with different due windows on parallel machines is presented. To compile chromatid core, the coding technique using job numbers is proposed. The steady-step genet- ic algorithm is used for the before-mentioned problem. The results of com- puter simulation experiment indicate that the algorithm and coding tech- nique are applicable and effective.

关 键 词：交货期窗口 并行机 遗传算法 JOB-SHOP调度问题 

分 类 号：O224[理学—运筹学与控制论] O242.23[理学—数学]