Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments

Dvir Shabtay, George Steiner, Liron Yedidsion

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

We study bicriteria problems of minimizing maximum tardiness and total due date assignment cost in various scheduling environments. We assume that each job can be assigned a different due date without any restriction, and that each due date assignment cost is a non-decreasing function of the quoted due date. We settle the complexity of most of the problems studied by either proving that they are NP-hard or finding a polynomial time solution for them. We also include approximation and non-approximability results for several parallel-machine problems. Crown

Original languageEnglish
Pages (from-to)1090-1103
Number of pages14
JournalDiscrete Applied Mathematics
Volume158
Issue number10
DOIs
StatePublished - 28 May 2010

Keywords

  • Bicriteria scheduling
  • Complexity
  • Due date assignment
  • Maximum tardiness

Fingerprint

Dive into the research topics of 'Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments'. Together they form a unique fingerprint.

Cite this