Processing-plus-wait due dates in single-machine scheduling

H. G. Kahlbacher, Edwin Tai Chiu Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

6 Citations (Scopus)


We study the problem of scheduling n jobs on a single machine. Each job is assigned a processing-plus-wait due date, which is an affine-linear function of its processing time. The objective is to minimize the symmetric earliness and tardiness costs. We analyze a combined decision model which includes computing both the optimal job sequence and optimal due date parameters. For the quadratic objective function, we propose a heuristic solution based on a bicriterion approach. Additionally, we provide computational results to compare this model with two simpler models. For the maximum objective function, we show that it is efficiently solved by the shortest processing time sequence.
Original languageEnglish
Pages (from-to)163-186
Number of pages24
JournalJournal of Optimization Theory and Applications
Issue number1
Publication statusPublished - 1 Apr 1995


  • due dates
  • earliness
  • Single-machine scheduling
  • tardiness

ASJC Scopus subject areas

  • Control and Optimization
  • Applied Mathematics
  • Management Science and Operations Research


Dive into the research topics of 'Processing-plus-wait due dates in single-machine scheduling'. Together they form a unique fingerprint.

Cite this