Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Authors:
- 24 July 2019
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 22 (5) , 595-601
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (NSFC (11671368), NSFC (11771406))
This publication has 6 references indexed in Scilit:
- Unary NP-hardness of minimizing the number of tardy jobs with deadlinesJournal of Scheduling, 2016
- Single machine scheduling with release times, deadlines and tardiness objectivesEuropean Journal of Operational Research, 2001
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness1977
- One-Machine Sequencing to Minimize Certain Functions of Job TardinessOperations Research, 1969