Crossmark

Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines

Crossref DOI link: https://doi.org/10.1007/s10951-019-00615-9

Published Online: 2019-07-24

Published Print: 2019-10

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Chen, Rubing

Yuan, Jinjiang https://orcid.org/0000-0002-9814-615X
Funding

Funding for this research was provided by:

National Natural Science Foundation of China (NSFC (11671368), NSFC (11771406))
License Information

Text and Data Mining valid from 2019-07-24

Version of Record valid from 2019-07-24
More Information

Article History

First Online: 24 July 2019