| 各机器上具有相同加工时间F1oW Shop 调度问题 |
| |
| 引用本文： | 贾春福.各机器上具有相同加工时间F1oW Shop 调度问题[J].南开大学学报,2002,35(2):56-59. |
| |
| 作者姓名： | 贾春福 |
| |
| 作者单位： | 南开大学信息技术科学学院,天津300071 |
| |
| 摘 要： | 由m台机器构成的Flow Shop，当工件在各机器上加工时间相同时，直觉上，等价于单机问题。本文推测单机情形最优解的性质及其确定策略也应适合此调度模型。本文就一些目标函数验证了这一推测。
|
| 关 键 词： | 调度问题 Flow Shop 调度策略 最优解特征 |
| 文章编号： | 0465-7942(2002)02-0056-04 |
| 修稿时间： | 2000年11月9日 |
SCHEDULING IN FLOW SHOP WITH IDENTICAL PROCESSING TIME ON EACH MACHINE |
| |
| JIA Chunfu.SCHEDULING IN FLOW SHOP WITH IDENTICAL PROCESSING TIME ON EACH MACHINE[J].Acta Scientiarum Naturalium University Nankaiensis,2002,35(2):56-59. |
| |
| Authors: | JIA Chunfu |
| |
| Abstract: | 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. |
| |
| Keywords: | scheduling problem flow shop scheduling policy property of optimal schedule |
| 本文献已被 CNKI 维普 等数据库收录！ |
