极小化不可行量函数的Flow Shop变异问题  

Variants of the Flow Shop Scheduling Problem to Minimize the Function of Infeasibilities

作　　者：赵传立[1] 张庆灵[1] 唐恒永[2] 

机构地区：[1]东北大学理学院,辽宁沈阳110005 [2]沈阳师范学院数学系,辽宁沈阳110034

出　　处：《系统工程与电子技术》2002年第9期90-93,共4页Systems Engineering and Electronics

基　　金：辽宁省科委自然科研基金资助课题 (9910 70 0 1) ;辽宁省教育厅科研基金资助课题 (2 0 2 62 2 5 0 99112 15 5 8)

摘　　要：讨论一类Flowshop的变异问题。在这类变异问题中 ,给定一个截止工期 ,该工期比Flowshop最优调度中的最大完工时间小。讨论的问题是在全部工件的完工时间不超过截止工期的限制下 ,极小化不可行量函数。这类问题与矩阵函数因子分解有着密切联系。基于对问题的分析 ,证明了这一问题等价于单机调度中极小化类似的延迟量函数。推广了已有的结论。A class of variants of the Flow shop scheduling problem are studied. In these variants a deadline which is less than the optimal makespan is given, and the task is to find a schedule that meets this deadline, thereby minimizing the function of infeasibilities. The problems are closelurelated with factorization problems for rational matrix functions. Through the analysis of the problem, it is proved that the problem is equivalent to a single-machine scheduling for minimizing an analogous function of delay. Some conclusions are generalized.\;

关 键 词：极小化不可行量函数 变异问题 调度问题 FLOW SHOP 

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