The LPT heuristic for minimizing total load on a proportionate openshop

Enrique Gerstl; Gur Mosheiov

doi:10.1016/j.dam.2023.05.027

The LPT heuristic for minimizing total load on a proportionate openshop

Enrique Gerstl, Gur Mosheiov^*

^*Corresponding author for this work

Specialization in Operations Research

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

Abstract

We study the problem of minimizing total load on a proportionate openshop. The problem is proved to be NP-hard. A simple LPT (Longest Processing Time first)-based heuristic is proposed, and a bound on the worst-case relative error is introduced: (where m is the number of machines). The proposed bound is smaller than the classical bound on the relative error of LPT when minimizing makespan on parallel identical machines. The algorithm is tested numerically and is shown to produce very close-to-optimal schedules.

Original language	American English
Pages (from-to)	190-198
Number of pages	9
Journal	Discrete Applied Mathematics
Volume	338
DOIs	https://doi.org/10.1016/j.dam.2023.05.027
State	Published - 30 Oct 2023

Bibliographical note

Funding Information:
This paper was supported by the Israel Science Foundation (Grant No. 2505/19 ) and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project Number 452470135 .

Publisher Copyright:
© 2023

Keywords

Heuristic
Proportionate openshop
Scheduling
Total load
Worst case bound

Access to Document

10.1016/j.dam.2023.05.027

Cite this

@article{8fbde5320920497490394d7092317fa9,

title = "The LPT heuristic for minimizing total load on a proportionate openshop",

abstract = "We study the problem of minimizing total load on a proportionate openshop. The problem is proved to be NP-hard. A simple LPT (Longest Processing Time first)-based heuristic is proposed, and a bound on the worst-case relative error is introduced: (where m is the number of machines). The proposed bound is smaller than the classical bound on the relative error of LPT when minimizing makespan on parallel identical machines. The algorithm is tested numerically and is shown to produce very close-to-optimal schedules.",

keywords = "Heuristic, Proportionate openshop, Scheduling, Total load, Worst case bound",

author = "Enrique Gerstl and Gur Mosheiov",

note = "Funding Information: This paper was supported by the Israel Science Foundation (Grant No. 2505/19 ) and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project Number 452470135 . Publisher Copyright: {\textcopyright} 2023",

year = "2023",

month = oct,

day = "30",

doi = "10.1016/j.dam.2023.05.027",

language = "American English",

volume = "338",

pages = "190--198",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

}

TY - JOUR

T1 - The LPT heuristic for minimizing total load on a proportionate openshop

AU - Gerstl, Enrique

AU - Mosheiov, Gur

N1 - Funding Information: This paper was supported by the Israel Science Foundation (Grant No. 2505/19 ) and by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – Project Number 452470135 . Publisher Copyright: © 2023

PY - 2023/10/30

Y1 - 2023/10/30

N2 - We study the problem of minimizing total load on a proportionate openshop. The problem is proved to be NP-hard. A simple LPT (Longest Processing Time first)-based heuristic is proposed, and a bound on the worst-case relative error is introduced: (where m is the number of machines). The proposed bound is smaller than the classical bound on the relative error of LPT when minimizing makespan on parallel identical machines. The algorithm is tested numerically and is shown to produce very close-to-optimal schedules.

AB - We study the problem of minimizing total load on a proportionate openshop. The problem is proved to be NP-hard. A simple LPT (Longest Processing Time first)-based heuristic is proposed, and a bound on the worst-case relative error is introduced: (where m is the number of machines). The proposed bound is smaller than the classical bound on the relative error of LPT when minimizing makespan on parallel identical machines. The algorithm is tested numerically and is shown to produce very close-to-optimal schedules.

KW - Heuristic

KW - Proportionate openshop

KW - Scheduling

KW - Total load

KW - Worst case bound

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

U2 - 10.1016/j.dam.2023.05.027

DO - 10.1016/j.dam.2023.05.027

M3 - Article

AN - SCOPUS:85162179470

SN - 0166-218X

VL - 338

SP - 190

EP - 198

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

The LPT heuristic for minimizing total load on a proportionate openshop

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this