| Article ID: | iaor20022294 |
| Country: | India |
| Volume: | 22 |
| Issue: | 2 |
| Start Page Number: | 321 |
| End Page Number: | 331 |
| Publication Date: | May 2001 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Tang Hui-Chin |
| Keywords: | flowshop |
In this paper, the three-machine flow shop scheduling (3FSS) with the objective of minimizing the makespan is considered. The algorithm developed by Chen, Glass, Potts and Strusevich (CGPS) is by far the best one in terms of the worst-case performance ratio for the 3FSS. This paper analyzes a particular condition in a step of the CGPS algorithm and proposes a modification to the CGPS algorithm by changing this condition. It is shown that this modified algorithm is more general one for the 3FSS.