Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine

Shisheng Li, Chi To Ng, Jinjiang Yuan

Research output: Journal article publicationJournal articleAcademic researchpeer-review

39 Citations (Scopus)


This paper considers the problem of scheduling deteriorating jobs and due date assignment on a single machine. The actual processing time of a job is a linear increasing function of its starting time. The problem is to determine the optimal due dates and the processing sequence simultaneously to minimize costs for earliness, due date assignment and weighted number of tardy jobs. We present polynomial-time algorithms to solve the problem in the case of two popular due date assignment methods: CON and SLK.
Original languageEnglish
Pages (from-to)747-751
Number of pages5
JournalInternational Journal of Production Economics
Issue number2
Publication statusPublished - 1 Jun 2011


  • CON/SLK due date assignment
  • Deteriorating jobs
  • Scheduling

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • General Business,Management and Accounting
  • Management Science and Operations Research
  • Economics and Econometrics


Dive into the research topics of 'Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine'. Together they form a unique fingerprint.

Cite this