@misc{10818/55642,
year = {2008},
url = {http://hdl.handle.net/10818/55642},
abstract = {We consider the problem of makespan minimization on a flexible flow shop with
k stages and ms machines at any stage. We propose a heuristic algorithm based on the identification and exploitation of the bottleneck stage, which is simple to use and to understand by
practitioners. A computational experiment is conducted to evaluate the performance of the
proposed method. The study shows that our method is, in average, comparable with other
bottleneck-based algorithms, but with smaller variance, and that it requires less computational effort},
publisher = {Annals of Operations Research},
title = {Scheduling jobs on a k-stage flexible flow-shop},
doi = {10.1007/s10479-007-0257-2},
author = {Paternina Arboleda, Carlos D. and Montoya Torres, Jairo R. and Acero Domínguez, Milton J. and Herrera Hernández, Maria C.},
}