Two due date assignment problems in scheduling a single machine

Dvir Shabtay, George Steiner

Research output: Contribution to journalArticlepeer-review

50 Scopus citations


We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for some important special cases.

Original languageEnglish
Pages (from-to)683-691
Number of pages9
JournalOperations Research Letters
Issue number6
StatePublished - 1 Nov 2006
Externally publishedYes


  • Due date assignment
  • Single-machine scheduling

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics


Dive into the research topics of 'Two due date assignment problems in scheduling a single machine'. Together they form a unique fingerprint.

Cite this