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 | Scheduling-Verfahren | Scheduling problem | Evolutionärer Algorithmus | Evolutionary algorithm | Heuristik | Heuristics |
-
Pixelation of time matrices for solving permutation flowshop scheduling problem
Farahmand Rad, Shahriar, (2024)
-
Flowshop scheduling with a general exponential learning effect
Wang, Ji-bo, (2014)
-
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
Fernandez-Viages, Victor, (2014)
- More ...
-
Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems
Grange, Camille, (2025)
-
Contributions of inclusion-exclusion to exact or approximate solution of scheduling problems
Ploton, Olivier, (2023)
-
Shang, Lei, (2019)
- More ...