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 | Durchlaufzeit | Lead time | Theorie | Theory | Terminplanung | Time scheduling |
-
Bicriteria scheduling for due date assignment with total weighted tardiness
Lin, Hao, (2018)
-
Mosheiov, G., (2008)
-
Maximizing the minimum completion time on parallel machines
Haouari, Mohamed, (2008)
- More ...
-
A note on Pareto minimizing total completion time and maximum cost
Gao, Yuan, (2015)
-
Gao, Yuan, (2022)
-
Unbounded parallel-batch scheduling with drop-line tasks
Gao, Yuan, (2019)
- More ...