A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in Either Stage

被引：4

作者：

刘志新

谢金星

李建国

董杰方

机构：

[1] DONG Jiefang Department of Mathematical Sciences Tsinghua University

[2] Wuhan Iron and Steel Group Company

[3] Wuhan Iron and Steel Group Company Beijing

[4] China

[5] Wuhan

[6] Beijing

来源：

TsinghuaScienceandTechnology | 2003年 / 01期

关键词：

hybrid flowshop scheduling; no wait; heuristic; worst case analysis;

D O I：

暂无

中图分类号：

O226 [排队论（随机服务系统）];

学科分类号：

070105 ; 1201 ;

摘要：

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.

引用

页码：43 / 48

页数：6