A note on the complexity of two supply chain scheduling problems
Year of publication: |
2021
|
---|---|
Authors: | Zhang, Yuan ; Yuan, Jinjiang |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 24.2021, 4, p. 447-454
|
Subject: | Scheduling | Supply chains | Computational complexity | Unary NP-hardness | Lieferkette | Supply chain | Scheduling-Verfahren | Scheduling problem |
-
Scheduling two agent task chains with a central selection mechanism
Agnetis, Alessandro, (2015)
-
Shared processor scheduling of multiprocessor jobs
Dereniowski, Dariusz, (2020)
-
Frazzon, Enzo Morosini, (2018)
- More ...
-
Zhang, Yuan, (2020)
-
Pareto-scheduling of two competing agents with their own equal processing times
Chen, Rubing, (2022)
-
Single‐machine scheduling with deadlines to minimize the total weighted late work
Chen, Rubing, (2019)
- More ...