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

Daniel Baraz; Gur Mosheiov

doi:10.1016/j.ejor.2006.11.025

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

BA Business Department

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

50 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(n²)) greedy algorithm, which is shown numerically to perform better than a recently published heuristic.

Original language	English
Pages (from-to)	810-813
Number of pages	4
Journal	European Journal of Operational Research
Volume	184
Issue number	2
DOIs	https://doi.org/10.1016/j.ejor.2006.11.025
State	Published - 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

Access to Document

10.1016/j.ejor.2006.11.025

Cite this

@article{4cf431f6a6f849c09c45af3844e94690,

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

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.",

keywords = "Flowshop, Heuristics, Makespan, Scheduling",

author = "Daniel Baraz and Gur Mosheiov",

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

year = "2008",

month = jan,

day = "16",

doi = "10.1016/j.ejor.2006.11.025",

language = "אנגלית",

volume = "184",

pages = "810--813",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

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

AU - Baraz, Daniel

AU - Mosheiov, Gur

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

PY - 2008/1/16

Y1 - 2008/1/16

N2 - 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.

AB - 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.

KW - Flowshop

KW - Heuristics

KW - Makespan

KW - Scheduling

UR - https://www.scopus.com/pages/publications/34548509933

U2 - 10.1016/j.ejor.2006.11.025

DO - 10.1016/j.ejor.2006.11.025

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:34548509933

SN - 0377-2217

VL - 184

SP - 810

EP - 813

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this