Full text

Turn on search term navigation

Copyright © 2013 Huawei Yuan et al. Huawei Yuan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

This paper considers the m-machine flow shop scheduling problem with the no-wait constraint to minimize total completion time which is the typical model in steel production. First, the asymptotic optimality of the Shortest Processing Time (SPT) first rule is proven for this problem. To further evaluate the performance of the algorithm, a new lower bound with performance guarantee is designed. At the end of the paper, numerical simulations show the effectiveness of the proposed algorithm and lower bound.

Details

Title
Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production
Author
Yuan, Huawei; Yuanwei Jing; Huang, Jinping; Ren, Tao
Publication year
2013
Publication date
2013
Publisher
John Wiley & Sons, Inc.
ISSN
1110757X
e-ISSN
16870042
Source type
Scholarly Journal
Language of publication
English
ProQuest document ID
1491647651
Copyright
Copyright © 2013 Huawei Yuan et al. Huawei Yuan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.