摘要
由 m台机器构成的 Flow Shop,当工件在各机器上加工时间相同时 ,直觉上 ,等价于单机问题 .本文推测单机情形最优解的性质及其确定策略也应适合此调度模型 .
This paper considers a scheduling problem in m-machine flow shop with identical processing times on each machine. For some objective functions, it shows that the properties of optimal schedules and their determination policies for the single machine case are also available for this flow shop model.
出处
《南开大学学报（自然科学版）》
CAS
CSCD
北大核心
2002年第2期56-59,共4页
Acta Scientiarum Naturalium Universitatis Nankaiensis
关键词
调度问题
FLOW
SHOP
调度策略
最优解特征
scheduling problem
flow shop
scheduling policy
property of optimal schedule
