A survey on offline scheduling with rejection

Dvir Shabtay, Nufar Gaspar, Moshe Kaspi

Research output: Contribution to journalArticlepeer-review

200 Scopus citations


In classical deterministic scheduling problems, it is assumed that all jobs have to be processed. However, in many practical cases, mostly in highly loaded make-to-order production systems, accepting all jobs may cause a delay in the completion of orders which in turn may lead to high inventory and tardiness costs. Thus, in such systems, the firm may wish to reject the processing of some jobs by either outsourcing them or rejecting them altogether. The field of scheduling with rejection provides schemes for coordinated sales and production decisions by grouping them into a single model. Since scheduling problems with rejection are very interesting both from a practical and a theoretical point of view, they have received a great deal of attention from researchers over the last decade. The purpose of this survey is to offer a unified framework for offline scheduling with rejection by presenting an up-to-date survey of the results in this field. Moreover, we highlight the close connection between scheduling with rejection and other fields of research such as scheduling with controllable processing times and scheduling with due date assignment, and include some new results which we obtained for open problems.

Original languageEnglish
Pages (from-to)3-28
Number of pages26
JournalJournal of Scheduling
Issue number1
StatePublished - 1 Jan 2013


  • Deterministic scheduling
  • Job rejection
  • Optimization and complexity
  • Order acceptance
  • Sourcing decisions

ASJC Scopus subject areas

  • Software
  • General Engineering
  • Management Science and Operations Research
  • Artificial Intelligence


Dive into the research topics of 'A survey on offline scheduling with rejection'. Together they form a unique fingerprint.

Cite this