| Article ID: | iaor20072875 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 6 |
| Start Page Number: | 683 |
| End Page Number: | 691 |
| Publication Date: | Nov 2006 |
| Journal: | Operations Research Letters |
| Authors: | Steiner George, Shabtay Dvir |
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.