A flexible flowshop problem with total flow time minimization
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol.132, no.3, pp.528-538, 2001 (SCI-Expanded, Scopus)
- Publication Type: Article / Article
- Volume: 132 Issue: 3
- Publication Date: 2001
- Doi Number: 10.1016/s0377-2217(00)00142-9
- Journal Name: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Page Numbers: pp.528-538
- Keywords: flexible flowshop, parallel machines, total flow time, SHOP
- Middle East Technical University Affiliated: Yes
Abstract
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.