The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

Dvir Shabtay, George Steiner

Research output: Contribution to journalArticlepeer-review

63 Scopus citations

Abstract

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomial-time algorithm to find the optimal job sequence, due date values and resource allocation minimizing an objective function which includes earliness, tardiness, due date assignment, makespan and total resource consumption costs.

Original languageEnglish
Pages (from-to)25-40
Number of pages16
JournalAnnals of Operations Research
Volume159
Issue number1
DOIs
StatePublished - 1 Mar 2008

Keywords

  • Controllable processing times
  • Due date assignment
  • Earliness-tardiness scheduling
  • Resource allocation
  • Single-machine scheduling

Fingerprint

Dive into the research topics of 'The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times'. Together they form a unique fingerprint.

Cite this