Two due date assignment problems in scheduling a single machine |
| |
| Authors: | Dvir Shabtay |
| |
| Institution: | Michael G. DeGroote School of Business, Management Science and Information Systems Area, McMaster University, Hamilton, Ontario, Canada L8S 4M4 |
| |
| Abstract: | We study two single-machine scheduling problems: minimizing the sum of weighted earliness, tardiness and due date assignment penalties and minimizing the weighted number of tardy jobs and due date assignment costs. We prove that both problems are strongly NP-hard and give polynomial solutions for some important special cases. |
| |
| Keywords: | Single-machine scheduling Due date assignment |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
