Skip to main navigation Skip to search Skip to main content

Scheduling jobs on a k-stage flexible flow-shop

  • Universidad del Norte
  • Universidad de la Sabana

Research output: Contribution to journal › Journal Article › peer-review

64 Citations (Scopus)

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 languageEnglish
Pages (from-to)29-40
Number of pages12
JournalAnnals of Operations Research
Volume164
Issue number1
DOIs
Publication statusPublished - Nov 2008
Externally publishedYes

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