Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection

Shir Fiszman; Gur Mosheiov

doi:10.1016/j.ipl.2017.12.004

Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection

Shir Fiszman, Gur Mosheiov^*

^*Corresponding author for this work

Business Administration

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

19 Scopus citations

Abstract

We study the scheduling problem of minimizing total load on a proportionate flowshop. We consider position-dependent job processing times in the most general way. We show that this problem is solved in O(n⁴) time, where n is the number of jobs. We then extend the setting to allow job-rejection, where the scheduler may decide to process only a subset of the jobs, and the rejected jobs are penalized. This extension is shown to be solved in O(n⁵) time.

Original language	American English
Pages (from-to)	39-43
Number of pages	5
Journal	Information Processing Letters
Volume	132
DOIs	https://doi.org/10.1016/j.ipl.2017.12.004
State	Published - Apr 2018

Bibliographical note

Funding Information:
This research was supported by the Israel Science Foundation (grant No. 1286/14 ). The second author was supported in part by the Recanati Fund of The School of Business Administration , and by Charles I. Rosen Chair of Management, The Hebrew University of Jerusalem , Israel.

Publisher Copyright:
© 2017

Keywords

Job-rejection
Position-dependent processing times
Proportionate flowshop
Scheduling
Total load

Access to Document

10.1016/j.ipl.2017.12.004

Cite this

@article{76889614060641b095a057d17b64ddb8,

title = "Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection",

abstract = "We study the scheduling problem of minimizing total load on a proportionate flowshop. We consider position-dependent job processing times in the most general way. We show that this problem is solved in O(n4) time, where n is the number of jobs. We then extend the setting to allow job-rejection, where the scheduler may decide to process only a subset of the jobs, and the rejected jobs are penalized. This extension is shown to be solved in O(n5) time.",

keywords = "Job-rejection, Position-dependent processing times, Proportionate flowshop, Scheduling, Total load",

author = "Shir Fiszman and Gur Mosheiov",

note = "Funding Information: This research was supported by the Israel Science Foundation (grant No. 1286/14 ). The second author was supported in part by the Recanati Fund of The School of Business Administration , and by Charles I. Rosen Chair of Management, The Hebrew University of Jerusalem , Israel. Publisher Copyright: {\textcopyright} 2017",

year = "2018",

month = apr,

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

language = "American English",

volume = "132",

pages = "39--43",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

}

TY - JOUR

T1 - Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection

AU - Fiszman, Shir

AU - Mosheiov, Gur

N1 - Funding Information: This research was supported by the Israel Science Foundation (grant No. 1286/14 ). The second author was supported in part by the Recanati Fund of The School of Business Administration , and by Charles I. Rosen Chair of Management, The Hebrew University of Jerusalem , Israel. Publisher Copyright: © 2017

PY - 2018/4

Y1 - 2018/4

N2 - We study the scheduling problem of minimizing total load on a proportionate flowshop. We consider position-dependent job processing times in the most general way. We show that this problem is solved in O(n4) time, where n is the number of jobs. We then extend the setting to allow job-rejection, where the scheduler may decide to process only a subset of the jobs, and the rejected jobs are penalized. This extension is shown to be solved in O(n5) time.

AB - We study the scheduling problem of minimizing total load on a proportionate flowshop. We consider position-dependent job processing times in the most general way. We show that this problem is solved in O(n4) time, where n is the number of jobs. We then extend the setting to allow job-rejection, where the scheduler may decide to process only a subset of the jobs, and the rejected jobs are penalized. This extension is shown to be solved in O(n5) time.

KW - Job-rejection

KW - Position-dependent processing times

KW - Proportionate flowshop

KW - Scheduling

KW - Total load

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

U2 - 10.1016/j.ipl.2017.12.004

DO - 10.1016/j.ipl.2017.12.004

M3 - Article

AN - SCOPUS:85038826832

SN - 0020-0190

VL - 132

SP - 39

EP - 43

JO - Information Processing Letters

JF - Information Processing Letters

ER -

Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this