Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work
Year of publication: |
2023
|
---|---|
Authors: | Chen, Rubing ; Gao, Yuan ; Geng, Zhichao ; Yuan, Jinjiang |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 61.2023, 22, p. 7630-7648
|
Subject: | algorithms | assignable/generalized due dates | NP-hard | Scheduling | total weighted late work | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Produktionssteuerung | Production control |
-
Two-machine open-shop scheduling with rejection to minimize the makespan
Zhang, Liqi, (2016)
-
Two-machine flow shop and open shop scheduling problems with a single maintenance window
Mosheiov, Gur, (2018)
-
Oron, Daniel, (2017)
- More ...
-
Pareto-scheduling of two competing agents with their own equal processing times
Chen, Rubing, (2022)
-
Chen, Rubing, (2019)
-
Wan, Long, (2015)
- More ...