By Topic

A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Zhixin Liu ; Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China ; Jinxing Xie ; Jianguo Li ; Jiefang Dong

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.

Published in:

Tsinghua Science and Technology  (Volume:8 ,  Issue: 1 )