Scheduling jobs on a k-stage flexible flow-shop

Carlos Paternina-Arboleda (), Jairo Montoya-Torres (), Milton Acero-Dominguez and Maria Herrera-Hernandez

Annals of Operations Research, 2008, vol. 164, issue 1, 29-40

Abstract: We consider the problem of makespan minimization on a flexible flow shop with k stages and m s 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. Copyright Springer Science+Business Media, LLC 2008

Keywords: Flexible flow-shop; Heuristic; Computational experiments (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-007-0257-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:164:y:2008:i:1:p:29-40:10.1007/s10479-007-0257-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-007-0257-2

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().