A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time

Daniel Baraz, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

49 Scopus citations

Abstract

We study makespan minimization on an m machine flowshop. No idle time is allowed between consecutive operations on each machine. We introduce an efficient (O(n2)) greedy algorithm, which is shown numerically to perform better than a recently published heuristic.

Original languageAmerican English
Pages (from-to)810-813
Number of pages4
JournalEuropean Journal of Operational Research
Volume184
Issue number2
DOIs
StatePublished - 16 Jan 2008

Bibliographical note

Funding Information:
This paper was supported in part by the Rekanati Fund of The School of Business Administration, The Hebrew University, Jerusalem.

Keywords

  • Flowshop
  • Heuristics
  • Makespan
  • Scheduling

Fingerprint

Dive into the research topics of 'A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time'. Together they form a unique fingerprint.

Cite this