Job lateness in flowshops with setup and removal times separated


ALLAHVERDİ A., Aldowaisan T.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, no.9, pp.1001-1006, 1998 (SCI-Expanded, SSCI, Scopus) identifier

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.