Minimizing total completion time with linear deterioration: A new lower bound

Matan Atsmony; Gur Mosheiov

doi:10.1016/j.cie.2021.107867

Minimizing total completion time with linear deterioration: A new lower bound

Matan Atsmony, Gur Mosheiov^*

^*Corresponding author for this work

Business Administration

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

2 Scopus citations

Abstract

We study scheduling problems in which the job processing times are linearly deteriorating. Each job has a constant (job-independent) basic processing time and a job-dependent deterioration rate. The objective function is minimum total completion time. The machine settings considered are: single machine and parallel identical machines. The complexity status of these problems has been an open question for the last three decades. We introduce a new lower bound on the optimal total completion time, which is shown numerically (through a comparison to the results obtained by a simple heuristic) to be extremely accurate for both problems.

Original language	American English
Article number	107867
Journal	Computers and Industrial Engineering
Volume	163
DOIs	https://doi.org/10.1016/j.cie.2021.107867
State	Published - Jan 2022

Bibliographical note

Funding Information:
This research was funded by the Israel Science Foundation (grant No. 2505/19) and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project Number 452470135. It was also supported 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:
© 2021 Elsevier Ltd

Keywords

Heuristic
Linear deterioration
Lower bound
Scheduling
Total completion time

Access to Document

10.1016/j.cie.2021.107867

Cite this

@article{f90db2deeeb446e3bc1a1c5fa6e44b15,

title = "Minimizing total completion time with linear deterioration: A new lower bound",

abstract = "We study scheduling problems in which the job processing times are linearly deteriorating. Each job has a constant (job-independent) basic processing time and a job-dependent deterioration rate. The objective function is minimum total completion time. The machine settings considered are: single machine and parallel identical machines. The complexity status of these problems has been an open question for the last three decades. We introduce a new lower bound on the optimal total completion time, which is shown numerically (through a comparison to the results obtained by a simple heuristic) to be extremely accurate for both problems.",

keywords = "Heuristic, Linear deterioration, Lower bound, Scheduling, Total completion time",

author = "Matan Atsmony and Gur Mosheiov",

note = "Funding Information: This research was funded by the Israel Science Foundation (grant No. 2505/19) and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project Number 452470135. It was also supported 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} 2021 Elsevier Ltd",

year = "2022",

month = jan,

doi = "10.1016/j.cie.2021.107867",

language = "American English",

volume = "163",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd.",

}

TY - JOUR

T1 - Minimizing total completion time with linear deterioration

T2 - A new lower bound

AU - Atsmony, Matan

AU - Mosheiov, Gur

N1 - Funding Information: This research was funded by the Israel Science Foundation (grant No. 2505/19) and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project Number 452470135. It was also supported 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: © 2021 Elsevier Ltd

PY - 2022/1

Y1 - 2022/1

N2 - We study scheduling problems in which the job processing times are linearly deteriorating. Each job has a constant (job-independent) basic processing time and a job-dependent deterioration rate. The objective function is minimum total completion time. The machine settings considered are: single machine and parallel identical machines. The complexity status of these problems has been an open question for the last three decades. We introduce a new lower bound on the optimal total completion time, which is shown numerically (through a comparison to the results obtained by a simple heuristic) to be extremely accurate for both problems.

AB - We study scheduling problems in which the job processing times are linearly deteriorating. Each job has a constant (job-independent) basic processing time and a job-dependent deterioration rate. The objective function is minimum total completion time. The machine settings considered are: single machine and parallel identical machines. The complexity status of these problems has been an open question for the last three decades. We introduce a new lower bound on the optimal total completion time, which is shown numerically (through a comparison to the results obtained by a simple heuristic) to be extremely accurate for both problems.

KW - Heuristic

KW - Linear deterioration

KW - Lower bound

KW - Scheduling

KW - Total completion time

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

U2 - 10.1016/j.cie.2021.107867

DO - 10.1016/j.cie.2021.107867

M3 - Article

AN - SCOPUS:85121268509

SN - 0360-8352

VL - 163

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

M1 - 107867

ER -

Minimizing total completion time with linear deterioration: A new lower bound

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this