Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

Alessandro Agnetis; Gur Mosheiov

doi:10.1007/s11590-016-1059-8

Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

Alessandro Agnetis, Gur Mosheiov^*

^*Corresponding author for this work

Business Administration

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

34 Scopus citations

Abstract

We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.

Original language	English
Pages (from-to)	885-892
Number of pages	8
Journal	Optimization Letters
Volume	11
Issue number	4
DOIs	https://doi.org/10.1007/s11590-016-1059-8
State	Published - 1 Apr 2017

Bibliographical note

Publisher Copyright:
© 2016, Springer-Verlag Berlin Heidelberg.

Keywords

Flowshop
Job rejection
Makespan
Position-dependent processing times
Scheduling

Access to Document

10.1007/s11590-016-1059-8

Cite this

@article{7891752f1559487fae2b215e2b9988fa,

title = "Scheduling with job-rejection and position-dependent processing times on proportionate flowshops",

abstract = "We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.",

keywords = "Flowshop, Job rejection, Makespan, Position-dependent processing times, Scheduling",

author = "Alessandro Agnetis and Gur Mosheiov",

note = "Publisher Copyright: {\textcopyright} 2016, Springer-Verlag Berlin Heidelberg.",

year = "2017",

month = apr,

day = "1",

doi = "10.1007/s11590-016-1059-8",

language = "אנגלית",

volume = "11",

pages = "885--892",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

number = "4",

}

TY - JOUR

T1 - Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

AU - Agnetis, Alessandro

AU - Mosheiov, Gur

PY - 2017/4/1

Y1 - 2017/4/1

N2 - We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.

AB - We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.

KW - Flowshop

KW - Job rejection

KW - Makespan

KW - Position-dependent processing times

KW - Scheduling

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

U2 - 10.1007/s11590-016-1059-8

DO - 10.1007/s11590-016-1059-8

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

AN - SCOPUS:84978080620

SN - 1862-4472

VL - 11

SP - 885

EP - 892

JO - Optimization Letters

JF - Optimization Letters

IS - 4

ER -

Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this