| Article ID: | iaor20021686 |
| Country: | Netherlands |
| Volume: | 132 |
| Issue: | 3 |
| Start Page Number: | 528 |
| End Page Number: | 538 |
| Publication Date: | Aug 2001 |
| Journal: | European Journal of Operational Research |
| Authors: | Kondakci Suna, Azizolu Meral, Cakmak Ergin |
| Keywords: | programming: branch and bound |
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.