|
|||||
|
|
Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments |
|
| Authors: | Dvir Shabtay Liron Yedidsion |
| Institution: | a Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel b Operations Management Area, Michael G. DeGroote School of Business, McMaster University, Hamilton, Ontario, Canada c Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel |
| 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. |
| Keywords: | Bicriteria scheduling Due date assignment Maximum tardiness Complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |