Job lateness in flowshops with setup and removal times separated
- 1 September 1998
- journal article
- research article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 49 (9) , 1001-1006
- https://doi.org/10.1057/palgrave.jors.2600583
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: