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.
| Original language | English |
|---|---|
| Pages (from-to) | 29-40 |
| Number of pages | 12 |
| Journal | Annals of Operations Research |
| Volume | 164 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Nov 2008 |
| Externally published | Yes |
Keywords
- Computational experiments
- Flexible flow-shop
- Heuristic
ASJC Scopus subject areas
- General Decision Sciences
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'Scheduling jobs on a k-stage flexible flow-shop'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver