Hide/Show Apps

A flexible flowshop problem with total flow time minimization

Azizoğlu, Meral
Cakmak, E
Kondakci, S
In this study, we consider total flow time problem in a flexible flowshop environment. We develop a branch and bound algorithm to find the optimal schedule. The efficiency of the algorithm is enhanced by upper and lower bounds and a dominance criterion. Computational experience reveals that the algorithm solves moderate sized problems in reasonable solution times. (C) 2001 Elsevier Science B.V. All rights reserved.