Proportionate flowshops with general position-dependent processing times

Gur Mosheiov

doi:10.1016/j.ipl.2010.11.016

Proportionate flowshops with general position-dependent processing times

Gur Mosheiov^*

^*Corresponding author for this work

Business Administration

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

24 Scopus citations

Abstract

Most scheduling studies assume constant (position-independent) job processing times. Most of the papers allowing position-dependent processing times consider only special cases, where the job processing times follow a specific function of the job-position. Polynomial time solutions have hardly been found for general position-dependent processing times in scheduling literature. In this note we provide one of these cases: we introduce a polynomial time solution for minimum makespan on an m-machine proportionate flowshop.

Original language	English
Pages (from-to)	174-177
Number of pages	4
Journal	Information Processing Letters
Volume	111
Issue number	4
DOIs	https://doi.org/10.1016/j.ipl.2010.11.016
State	Published - 15 Jan 2011

Bibliographical note

Funding Information:
Gur Mosheiov is The Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University, Jerusalem. This research was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem.

Keywords

Makespan
Position-dependent processing times
Proportionate flowshop
Scheduling

Access to Document

10.1016/j.ipl.2010.11.016

Cite this

@article{95728a25d21b435f9898b03cdfdac29b,

title = "Proportionate flowshops with general position-dependent processing times",

abstract = "Most scheduling studies assume constant (position-independent) job processing times. Most of the papers allowing position-dependent processing times consider only special cases, where the job processing times follow a specific function of the job-position. Polynomial time solutions have hardly been found for general position-dependent processing times in scheduling literature. In this note we provide one of these cases: we introduce a polynomial time solution for minimum makespan on an m-machine proportionate flowshop.",

keywords = "Makespan, Position-dependent processing times, Proportionate flowshop, Scheduling",

author = "Gur Mosheiov",

note = "Funding Information: Gur Mosheiov is The Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University, Jerusalem. This research was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem.",

year = "2011",

month = jan,

day = "15",

doi = "10.1016/j.ipl.2010.11.016",

language = "אנגלית",

volume = "111",

pages = "174--177",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Proportionate flowshops with general position-dependent processing times

AU - Mosheiov, Gur

N1 - Funding Information: Gur Mosheiov is The Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University, Jerusalem. This research was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem.

PY - 2011/1/15

Y1 - 2011/1/15

N2 - Most scheduling studies assume constant (position-independent) job processing times. Most of the papers allowing position-dependent processing times consider only special cases, where the job processing times follow a specific function of the job-position. Polynomial time solutions have hardly been found for general position-dependent processing times in scheduling literature. In this note we provide one of these cases: we introduce a polynomial time solution for minimum makespan on an m-machine proportionate flowshop.

AB - Most scheduling studies assume constant (position-independent) job processing times. Most of the papers allowing position-dependent processing times consider only special cases, where the job processing times follow a specific function of the job-position. Polynomial time solutions have hardly been found for general position-dependent processing times in scheduling literature. In this note we provide one of these cases: we introduce a polynomial time solution for minimum makespan on an m-machine proportionate flowshop.

KW - Makespan

KW - Position-dependent processing times

KW - Proportionate flowshop

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=78649496041&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2010.11.016

DO - 10.1016/j.ipl.2010.11.016

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

AN - SCOPUS:78649496041

SN - 0020-0190

VL - 111

SP - 174

EP - 177

JO - Information Processing Letters

JF - Information Processing Letters

IS - 4

ER -

Proportionate flowshops with general position-dependent processing times

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this