Title of article
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments Original Research Article
Author/Authors
Dvir Shabtay، نويسنده , , George Steiner، نويسنده , , Liron Yedidsion، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
14
From page
1090
To page
1103
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 stu
Keywords
Due date assignment , Complexity , Maximum tardiness , Bicriteria scheduling
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887427
Link To Document