| Article ID: | iaor19992341 |
| Country: | United Kingdom |
| Volume: | 49 |
| Issue: | 9 |
| Start Page Number: | 1001 |
| End Page Number: | 1006 |
| Publication Date: | Sep 1998 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Allahverdi A., Aldowaisan T. |
This paper addresses the two-machine flowshop problem where the setup, processing, and removal times of the jobs are separated and are independent of the job sequence. This problem is considered with maximum lateness as a measure of performance. Elimination criteria are established for both the classical and ordered flowshops, and optimal sequences are obtained for special ordered flowshops.