| Article ID: | iaor19981675 |
| Country: | India |
| Volume: | 18 |
| Issue: | 1 |
| Start Page Number: | 9 |
| End Page Number: | 16 |
| Publication Date: | Jan 1997 |
| Journal: | Journal of Information & Optimization Sciences |
| Authors: | Sen Tapan, Raiszadeh Farhad M.E. |
This paper considers the dual criteria of minimizing flowtime and maximum lateness of jobs in the two-machine flowshop systems. We discover the conditions that determine which of a pair of adjacent jobs in a sequence should precede the other to minimize either of the two objective functions. We also present a branch-and-bound procedure to arrive at an optimal solution.