Scheduling with competing agents, total late work and job rejection

David Freud, Gur Mosheiov

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


We study a single-machine scheduling problem with two competing agents. The objective function of one agent is minimizing total late work, whereas the maximum cost of the jobs of the second agent cannot exceed a given upper bound. We introduce and test a pseudo-polynomial dynamic programming algorithm for this NP-hard problem. Our tests indicate that the algorithm can handle large-size instances (containing hundreds of jobs) fairly quickly. We then extend the setting to that of job rejection, where the scheduler may decide to process only a subset of the jobs. The dynamic programming algorithm is modified accordingly, and our numerical tests verify that medium-size instances (containing less than 100 jobs) are solved in reasonable time.

Original languageEnglish
Article number105329
JournalComputers and Operations Research
StatePublished - Sep 2021
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2021 Elsevier Ltd


This research was supported by the Israel Science Foundation (grant No. 2505/19 ). The second author was also supported by the Charles I. Rosen Chair of Management, and by The Recanati Fund of The School of Business Administration, The Hebrew University, Jerusalem, Israel.

FundersFunder number
School of Business Administration
Israel Science Foundation2505/19


    • Dynamic programming
    • Job-rejection
    • Scheduling
    • Single-machine
    • Total late work
    • Two AGENTS


    Dive into the research topics of 'Scheduling with competing agents, total late work and job rejection'. Together they form a unique fingerprint.

    Cite this