Optimal due date assignment in multi-machine scheduling environments

Dvir Shabtay, George Steiner

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

We study two due date assignment problems in various multi-machine scheduling environments. We assume that each job can be assigned an arbitrary non-negative due date, but longer due dates have higher cost. The first problem is to minimize a cost function, which includes earliness, tardiness and due date assignment costs. In the second problem, we minimize an objective function which includes the number of tardy jobs and due date assignment costs. We settle the complexity of many of these problems by either showing that they are NP -hard or by providing a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems.

Original languageEnglish
Pages (from-to)217-228
Number of pages12
JournalJournal of Scheduling
Volume11
Issue number3
DOIs
StatePublished - 1 Jan 2008
Externally publishedYes

Keywords

  • Approximation
  • Complexity
  • Due date assignment
  • Multi-machine scheduling

Fingerprint

Dive into the research topics of 'Optimal due date assignment in multi-machine scheduling environments'. Together they form a unique fingerprint.

Cite this