加工时间依赖开工时间的Flow Shop调度问题  

Flow Shop Scheduling Problems with processing time Dependent on Starting Time

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

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

出　　处：《系统工程与电子技术》2003年第3期292-294,共3页Systems Engineering and Electronics

基　　金：东北大学博士学位论文基金(200208)

摘　　要：讨论了加工时间依赖开工时间的Flow shop 调度问题。在这类问题中,工件的加工时间是开工时间的简单线性函数,机器间满足某种优势关系。对于这类问题,当目标函数是极小化最大完工时间时,尽管比相应的经典问题复杂,但仍存在多项式算法。如果目标函数是极小化加权完工时间和或极小化最大延误,则经典问题中的结论未必成立。This paper deals with the flow shop scheduling problems with processing time dependent on starting time. In these problems job processing time is a simple linear function of the starting time and some dominance relations, between machines can be satisfied. It is shown that for the problems to minimize make span,polynomial algorithms still exist, although these problems are more complicated than classical ones. When the objective is to minimize weighted sum of completion time or maximum delay,the solutions of a classical version may not hold.

关 键 词：调度 线性加工时间 Flow SHOP 线性函数 

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