Job-Shop调度问题的优化模型及算法  

An Optimization Model and Its Algorithm for Job-Shop Scheduling Problems

作　　者：王锡禄[1] 姚伟力[2] 冯恩民[1] 

机构地区：[1]大连理工大学应用数学系,辽宁大连116023 [2]大连理工大学系统工程研究所,辽宁大连116023

出　　处：《系统工程理论与实践》2000年第11期84-89,93,共7页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金!( 1 9871 0 0 9)

摘　　要：建立了关于 Job-Shop调度问题的一般优化模型 ,将问题归结为双层规划 ,以特例形式给出了最小完工时间与提前 /拖期 Job-Shop调度批量模型 ,构造了一个有效的求解算法 ,数值实验表明了模型及算法的正确性和有效性 .The paper presents an optimization model with a general form for job shop scheduling problems, which are formulated into bilevel programming. Minimizing earliness penalty lot streaming problem and earliness/tardiness scheduling lot streaming problem are studied as the model′s two special cases.At last an effcient and practical algorithm is given and numerical experiments show the correctness of the model and the efficience of the algorithm.

关 键 词：遗传算法 JOB-SHOP调度问题 优化 数学模型 

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