| Article ID: | iaor1994119 |
| Country: | India |
| Volume: | 30 |
| Issue: | 1 |
| Start Page Number: | 35 |
| End Page Number: | 41 |
| Publication Date: | Mar 1993 |
| Journal: | OPSEARCH |
| Authors: | Sathe Y.S., Cadambi B.V. |
This paper considers the two-machine flowshop scheduling problem of minimising the mean flow time. Bagga and Kalra have proposed elimination rules that help to curtail the search in a branch and bound algorithm. Some new elimination rules are proposed in this paper, which can be used to develop near optimal branch and bound algorithms.