摘要
讨论了加工时间依赖开工时间的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.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2003年第3期292-294,共3页
Systems Engineering and Electronics
基金
东北大学博士学位论文基金(200208)
