| Article ID: | iaor1999638 |
| Country: | Netherlands |
| Volume: | 94 |
| Issue: | 1 |
| Start Page Number: | 203 |
| End Page Number: | 205 |
| Publication Date: | Oct 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Yuan Jinjiang |
We prove in this note that single-machine scheduling with a common due date to minimize earliness–tardiness and batch delivery costs is strongly NP-hard by a simple reduction from 3-Partition.