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....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.展开更多
基金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 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.
