A note on the complexity of single-machine scheduling with a common due date,earliness-tardiness,and batch delivery costs |
| |
| Affiliation: | 1. Department of Mathematics, College of Science, China Three Gorges University, Yichang 443002, China;2. Hubei Province Key Laboratory of System Science in Metallurgical Process, Wuhan University of Science and Technology, Wuhan 430081, China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
