| Article ID: | iaor20041561 |
| Country: | India |
| Volume: | 24 |
| Issue: | 1 |
| Start Page Number: | 123 |
| End Page Number: | 135 |
| Publication Date: | Jan 2003 |
| Journal: | Journal of Information & Optimization |
| Authors: | Dileepan Parthasarati, Sen T., Raiszadeh F.M.E. |
This paper is an improvement to an extension of a previously published paper which considered the dual criteria of minimizing flowtime and maximum lateness of jobs in the two-machine flowshop system. We discover the conditions that determine which of the pairs 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, along with a computerized example problem.