Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

Enrique Gerstl; Gur Mosheiov

doi:10.1007/s11590-024-02138-5

Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

Enrique Gerstl^*, Gur Mosheiov

^*Corresponding author for this work

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

Abstract

We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.

Original language	English
Journal	Optimization Letters
DOIs	https://doi.org/10.1007/s11590-024-02138-5
State	Accepted/In press - 2024

Bibliographical note

Publisher Copyright:
© The Author(s) 2024.

Keywords

Generalized due-dates
Minimum number of tardy jobs
Position-dependent processing times
Scheduling
Single machine

Access to Document

10.1007/s11590-024-02138-5

Cite this

@article{e419a7238d19489aa5190b80c43de803,

title = "Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times",

abstract = "We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.",

keywords = "Generalized due-dates, Minimum number of tardy jobs, Position-dependent processing times, Scheduling, Single machine",

author = "Enrique Gerstl and Gur Mosheiov",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2024.",

year = "2024",

doi = "10.1007/s11590-024-02138-5",

language = "אנגלית",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer Verlag",

}

TY - JOUR

T1 - Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

AU - Gerstl, Enrique

AU - Mosheiov, Gur

N1 - Publisher Copyright: © The Author(s) 2024.

PY - 2024

Y1 - 2024

N2 - We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.

AB - We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.

KW - Generalized due-dates

KW - Minimum number of tardy jobs

KW - Position-dependent processing times

KW - Scheduling

KW - Single machine

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

U2 - 10.1007/s11590-024-02138-5

DO - 10.1007/s11590-024-02138-5

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

AN - SCOPUS:85204109207

SN - 1862-4472

JO - Optimization Letters

JF - Optimization Letters

ER -

Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this