| Article ID: | iaor20022293 |
| Country: | India |
| Volume: | 22 |
| Issue: | 2 |
| Start Page Number: | 249 |
| End Page Number: | 257 |
| Publication Date: | May 2001 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Tang Hui-Chin |
This paper applies branch-and-bound technique to the permutation flow shop scheduling where the objective is to minimize makespan. A new lower bound of the branch-and-bound algorithm is presented. It shows that the new lower bound of the branch-and-bound algorithm is theoretically and empirically preferred.