COMPUTERS & OPERATIONS RESEARCH, sa.9, ss.757-765, 1998 (SCI-Expanded)
This paper addresses the two-machine no-wait flowshop problem where the setup time of a job is separated from its processing time. The performance measure considered is the total flowtime. An elimination criterion is developed and optimal solutions are obtained for two special cases. For the generic case, a heuristic algorithm is provided. Computational experience shows that the algorithm yields good solutions. (C) 1998 Elsevier Science Ltd. All rights reserved.