%0 Generic
%A Paternina Arboleda, Carlos D.
%A Montoya Torres, Jairo R.
%A Acero Domínguez, Milton J.
%A Herrera Hernández, Maria C.
%8 2008
%@ 02545330
%U http://hdl.handle.net/10818/55642
%X 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
%I Annals of Operations Research
%T Scheduling jobs on a k-stage flexible flow-shop
%R 10.1007/s10479-007-0257-2
%~ Intellectum