Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion-Exclusion
Year of publication: |
2023
|
---|---|
Authors: | Ploton, Olivier ; T'kindt, Vincent |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 26.2023, 2, p. 137-145
|
Subject: | Flowshop | Inclusion-Exclusion | Scheduling | Worst-case complexity |
-
Braun, Oliver, (2002)
-
Sequencing and scheduling in flowshops with task redistribution
Burdett, Robert L., (2001)
-
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
Fernandez-Viagas, Victor, (2015)
- More ...
-
Contributions of inclusion-exclusion to exact or approximate solution of scheduling problems
Ploton, Olivier, (2023)
-
Shang, Lei, (2019)
-
Improving the preemptive bound for the single machine dynamic maximum lateness problem
Della Croce, Federico, (2010)
- More ...