Single-machine scheduling and due date assignment with rejection and position-dependent processing times

Chuanli Zhao, Yunqiang Yin, Edwin Tai Chiu Cheng, Chin Chia Wu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

17 Citations (Scopus)


This paper considers a single-machine scheduling and due date assignment problem in which the processing time of a job depends on its position in a processing sequence and jobs can be rejected by incurring penalties. The objective is to minimize the sum of the scheduling criterion of the accepted jobs and the total penalty of the rejected jobs. We first consider the problem with the common due date assignment method where the scheduling criterion is a cost function that includes the costs of earliness, tardiness, and due date assignment. We provide a polynomial-time algorithm to solve the problem. We then provide a unified model for solving the single-machine scheduling problem with rejection and position-dependent processing times. Finally, we extend the results to the setting involving various due date assignment methods.
Original languageEnglish
Pages (from-to)691-700
Number of pages10
JournalJournal of Industrial and Management Optimization
Issue number3
Publication statusPublished - 1 Jul 2014


  • Due date assignment
  • Position-dependent processing times
  • Rejection
  • Scheduling
  • Single machine

ASJC Scopus subject areas

  • Business and International Management
  • Strategy and Management
  • Control and Optimization
  • Applied Mathematics

Cite this