Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
Year of publication: |
January 2016
|
---|---|
Authors: | Gao, Yuan ; Yuan, Jinjiang |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 1, p. 92-95
|
Subject: | Single machine scheduling | Total weighted tardiness | Generalized due dates | Unary NP-hard | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Operations Research | Operations research | Algorithmus | Algorithm |
-
Single machine scheduling problem with unexpected failures under flexible maintenance
Yang, Mengyue, (2025)
-
Krim, Hanane, (2019)
-
Kellerer, Hans, (2019)
- More ...
-
Chen, Rubing, (2023)
-
A note on Pareto minimizing total completion time and maximum cost
Gao, Yuan, (2015)
-
Chen, Rubing, (2019)
- More ...