Single machine scheduling problems with generalised due-dates and job-rejection

Enrique Gerstl*, Gur Mosheiov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

29 Scopus citations


We study single machine scheduling problems. Generalised due dates are assumed, i.e. job due dates are specified according to the positions of the jobs in the sequence, rather than their identity. Thus, assuming that due dates are numbered in a non-decreasing order, the jth due date refers to the job assigned to the jth position. In addition, we allow the option of job rejection, i.e. not all jobs must be processed. In this case, the scheduler is penalised for each rejected job, and the total rejection cost becomes part of the objective function. Two objective functions are considered: maximum tardiness plus rejection cost, and total tardiness plus rejection cost. Both problems are proved to be NP-hard. Pseudo-polynomial dynamic programmes and efficient heuristics are introduced and tested numerically.

Original languageAmerican English
Pages (from-to)3164-3172
Number of pages9
JournalInternational Journal of Production Research
Issue number11
StatePublished - 3 Jun 2017

Bibliographical note

Publisher Copyright:
© 2016 Informa UK Limited, trading as Taylor & Francis Group.


  • dynamic programming
  • generalised due dates
  • heuristics
  • job rejection
  • scheduling
  • single machine


Dive into the research topics of 'Single machine scheduling problems with generalised due-dates and job-rejection'. Together they form a unique fingerprint.

Cite this