A Greedy heuristic for solving scheduling problems with bounded rejection cost

Matan Atsmony, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


We study single machine scheduling problems with the option of job rejection. The scheduling measures considered are: makespan, total completion time, total tardiness and number of tardy jobs. Following many real-life settings, the total permitted rejection cost is assumed to be bounded. All the problems are known to be NP-hard. The paper focuses on the introduction of an efficient greedy-type heuristic, and performing an extensive numerical study. For makespan minimization, the heuristic is proved to be asymptotically optimal under very general conditions. For each of the problems, a pseudo-polynomial dynamic programming algorithm is introduced, and consequently, the results obtained by the greedy heuristic are compared to the optimum. We show that the greedy heuristic leads to very small optimality gaps in all our tests, and that the dynamic programming algorithms can solve medium and large size instances in reasonable times.

Original languageAmerican English
Article number105827
JournalComputers and Operations Research
StatePublished - Aug 2022

Bibliographical note

Publisher Copyright:
© 2022


  • Dynamic programming
  • Heuristic
  • Job-rejection
  • Scheduling
  • Single machine


Dive into the research topics of 'A Greedy heuristic for solving scheduling problems with bounded rejection cost'. Together they form a unique fingerprint.

Cite this