用遗传/禁忌搜索混合算法求解可变加工时间的调度问题  

Using Genetic/Tabu Search Mixture Algorithm for the Scheduling Problem with Variable Processing Times

作　　者：吴悦[1] 汪定伟[1] 

机构地区：[1]东北大学信息科学与工程学院

出　　处：《控制与决策》1998年第A07期428-432,共5页Control and Decision

基　　金：国家自然科学基金;国家863CIMS主题资助

摘　　要：有效地混合了遗传算法和禁忌搜索算法，对于一类加工时间可变的提前／拖期单机调度问题进行了研究。目标函数基于任务的提前／拖期惩罚、附加惩罚以及加工时间的偏离量惩罚，目标是确定最优的公共交货期、最优加工时间和最优加工顺序极小化目标函数，并与一般的遗传算法相比较。The mechanisms of genetic algorithm and tabu search are combined efficiently for the earliness/tardiness scheduling problem which the jobs have variable processing times on a single machine. The total objective function is based on earliness/tardiness penalties, additional penalties and the deviation of processing times penalties. The objective is to find the optimal common due-date, the optimal sequence and optimal processing times to minimize the objective function. The results of computational experiments using generally genetic algorithm are proposed to compare the results using GA/TS mixture algorithm, it is shown that GA/TS mixture algorithm is efficiently for the problem.

关 键 词：遗传算法 禁忌搜索算法 可变加工时间 调度问题 

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