Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

We study a single machine scheduling problem, where the goal is to maximize the weighted number of jobs completed exactly at their due-dates. The option of job-rejection is considered, i.e., the scheduler may perform only a subset of the jobs. An upper bound on the total permitted rejection cost is assumed. The problem is proved to be NP-hard, and a pseudo-polynomial dynamic programming algorithm is introduced. Our numerical tests indicate that the proposed algorithm performs well: medium size instances (of up to 100 jobs) are solved in less than 1 s.

Original languageAmerican English
Pages (from-to)2707-2719
Number of pages13
JournalOperational Research
Volume22
Issue number3
DOIs
StatePublished - Jul 2022

Bibliographical note

Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature.

Keywords

  • Dynamic programming
  • Job-rejection
  • Max-on-time
  • Scheduling
  • Single machine

Fingerprint

Dive into the research topics of 'Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection'. Together they form a unique fingerprint.

Cite this