| A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in Either Stage |
| |
| 作者姓名： | 刘志新 谢金星 李建国 董杰方 |
| |
| 作者单位： | [1]DepartmentofMathematicalSciences,TsinghuaUniversity,Beijing100084,China [3]WuhanIronandSteelGroupCompany,Wuhan430080,China |
| |
| 基金项目： | Supported by the National Natural Science Foundationof China( No. 6 990 40 0 7) |
| |
| 摘 要： | This paper studies the hybrid flow-shop scheduling problem with no-wait restrictions. The production process consists of two machine canters, one has a single machine and the other has more than one parallel machine. A greedy heuristic named least deviation algorithm is designed and its worst case performance is analyzed. Computational results are also given to show the algorithm‘s average performance compared with some other algorithms. The least deviation algorithm outperforms the others in most cases tested here, and it is of low computational complexity and is easy to carry out,thus it is of favorable application value.
|
| 关 键 词： | 混合流动商店规划 数学规划 混合编码 启发式 最小偏差算法 最坏情况性能 |
A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in Either Stage |
| |
| Abstract: | This paper studies the hybrid flow-shop scheduling problem with no-wait restrictions. The production process consists of two machine centers, one has a single machine and the other has more than one parallel machine. A greedy heuristic named least deviation algorithm is designed and its worst case performance is analyzed. Computational results are also given to show the algorithm's average performance compared with some other algorithms. The least deviation algorithm outperforms the others in most cases tested here, and it is of low computational complexity and is easy to carry out,thus it is of favorable application value. |
| |
| Keywords: | hybrid flowshop scheduling no wait heuristic worst case analysis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
