| 转盘上的Flow-shop排序问题的复杂性 |
| |
| 引用本文： | 时凌.转盘上的Flow-shop排序问题的复杂性[J].武汉科技学院学报,2004(8). |
| |
| 作者姓名： | 时凌 |
| |
| 作者单位： | 湖北民族学院 数学系 湖北 恩施 |
| |
| 摘 要： | 讨论转盘上的Flow-shop排序问题,当运送不相等且只有一台机器的情况下,转盘上的Flow-shop排序问题是强NP-困难的.
|
| 关 键 词： | Flow-shop排序问题 转盘问题 NP-困难 |
The complexity of the flow - shop scheduling problem with transportation turntable |
| |
| SHI Ling.The complexity of the flow - shop scheduling problem with transportation turntable[J].Journal of Wuhan Institute of Science and Technology,2004(8). |
| |
| Authors: | SHI Ling |
| |
| Abstract: | We discuss the complexity of the flow - shop scheduling problem with transportation turntable. For different transportation times, we prove that this problem is hard in the strong sense. |
| |
| Keywords: | flow-shop scheduling problem transportation turntable hardness |
| 本文献已被 CNKI 维普 等数据库收录！ |
