Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Year of publication: |
2019
|
---|---|
Authors: | Chen, Rubing ; Yuan, Jinjiang |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 5, p. 595-601
|
Subject: | Single-machine scheduling | Deadlines | Tardiness | Unary NP-hard | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Produktionssteuerung | Production control | Branch-and-Bound | Branch and Bound |
-
Lu, Haimin, (2024)
-
Modeling and solving for bi-objective cutting parallel machine scheduling problem
Meng, Ronghua, (2020)
-
Fu, Liang-Liang, (2018)
- More ...
-
Singleāmachine scheduling with deadlines to minimize the total weighted late work
Chen, Rubing, (2019)
-
Chen, Rubing, (2023)
-
Chen, Rubing, (2019)
- More ...