Minimizing maximum late work with optional job rejection on a single machine

Baruch Mor; Gur Mosheiov

doi:10.1007/s10951-026-00881-4

Minimizing maximum late work with optional job rejection on a single machine

Baruch Mor^*
, Gur Mosheiov

^*Corresponding author for this work

BA Business Department

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

Abstract

In this paper, we study the problem of minimizing the maximum late work with the popular option of job rejection on a single machine. We provide two fundamental properties regarding an optimal schedule, prove that the problem is NP-hard, and suggest pseudo-polynomial dynamic programming (DP), establishing that the problem is ordinary NP-hard. We also provide an extensive numerical study. Next, we leverage the provided DP to introduce an algorithm that maps the Pareto-optimal frontier.

Original language	English
Journal	Journal of Scheduling
DOIs	https://doi.org/10.1007/s10951-026-00881-4
State	Accepted/In press - 2026

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2026.

Keywords

Job rejection
Maximum late work
Scheduling
Single machine

Access to Document

10.1007/s10951-026-00881-4

Cite this

@article{01a22a4a34a84cb3977913ed329c235d,

title = "Minimizing maximum late work with optional job rejection on a single machine",

abstract = "In this paper, we study the problem of minimizing the maximum late work with the popular option of job rejection on a single machine. We provide two fundamental properties regarding an optimal schedule, prove that the problem is NP-hard, and suggest pseudo-polynomial dynamic programming (DP), establishing that the problem is ordinary NP-hard. We also provide an extensive numerical study. Next, we leverage the provided DP to introduce an algorithm that maps the Pareto-optimal frontier.",

keywords = "Job rejection, Maximum late work, Scheduling, Single machine",

author = "Baruch Mor and Gur Mosheiov",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2026.",

year = "2026",

doi = "10.1007/s10951-026-00881-4",

language = "אנגלית",

journal = "Journal of Scheduling",

issn = "1094-6136",

publisher = "Springer",

}

TY - JOUR

T1 - Minimizing maximum late work with optional job rejection on a single machine

AU - Mor, Baruch

AU - Mosheiov, Gur

N1 - Publisher Copyright: © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2026.

PY - 2026

Y1 - 2026

N2 - In this paper, we study the problem of minimizing the maximum late work with the popular option of job rejection on a single machine. We provide two fundamental properties regarding an optimal schedule, prove that the problem is NP-hard, and suggest pseudo-polynomial dynamic programming (DP), establishing that the problem is ordinary NP-hard. We also provide an extensive numerical study. Next, we leverage the provided DP to introduce an algorithm that maps the Pareto-optimal frontier.

AB - In this paper, we study the problem of minimizing the maximum late work with the popular option of job rejection on a single machine. We provide two fundamental properties regarding an optimal schedule, prove that the problem is NP-hard, and suggest pseudo-polynomial dynamic programming (DP), establishing that the problem is ordinary NP-hard. We also provide an extensive numerical study. Next, we leverage the provided DP to introduce an algorithm that maps the Pareto-optimal frontier.

KW - Job rejection

KW - Maximum late work

KW - Scheduling

KW - Single machine

UR - https://www.scopus.com/pages/publications/105042833164

U2 - 10.1007/s10951-026-00881-4

DO - 10.1007/s10951-026-00881-4

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

AN - SCOPUS:105042833164

SN - 1094-6136

JO - Journal of Scheduling

JF - Journal of Scheduling

ER -

Minimizing maximum late work with optional job rejection on a single machine

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this