Article ID Journal Published Year Pages File Type
1143273 Operations Research Letters 2006 9 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Two due date assignment problems in scheduling a single machine
Authors
, ,