摘要
研究工件加工时间是开工时间的简单线性函数的FlowShop调度问题。在这类问题中机器间满足某种优势关系。当目标函数是极小化加权完工时间和时,尽管比相应的经典问题复杂,但仍存在多项式时间算法。同时对工件的各工序无等待问题和机器无空闲问题也给出多项式时间算法。
This paper deals with the flow shop scheduling with job processing time being a simple linear function of the start- (ing) time. In these problems some dominance relations between machines can be satisfied. It is shown that the problems to (minimize) weighted sum of completion time, polynomial algorithms still exist, although these problems are more complicated (than) the classical ones. On the other hand, the no-wait and no-idle flow shop scheduling problems are considered, respec- (tively, polynomial algorithms are given.)
出处
《系统工程》
CSCD
北大核心
2004年第8期17-19,共3页
Systems Engineering
基金
教育部博士点基金资助项目(20020141013)
