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

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.