Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
Year of publication: |
2019
|
---|---|
Authors: | Choi, Byung-Cheon ; Min, Yunhong ; Park, Myoung-Ju |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 5, p. 433-437
|
Subject: | Scheduling | Generalized due dates | Periodic due dates | Logistics | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Gerstl, Enrique, (2020)
-
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
Atsmony, Matan, (2023)
-
Dutta, Debasish, (2022)
- More ...
-
Two-machine flow shops with an optimal permutation schedule under a storage constraint
Min, Yunhong, (2020)
-
Min, Yunhong, (2023)
-
Scheduling two projects with controllable processing times in a single-machine environment
Choi, Byung-Cheon, (2020)
- More ...