Resource leveling : complexity of a unit execution time two-processor scheduling variant and related problems
| Year of publication: |
2024
|
|---|---|
| Authors: | Bendotti, Pascale ; Brunod Indrigo, Luca ; Chrétienne, Philippe ; Escoffier, Bruno |
| Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 27.2024, 6, p. 587-606
|
| Subject: | Artificial Intelligence | Complexity | Matchings | Resource leveling | Scheduling | Scheduling-Verfahren | Scheduling problem | Künstliche Intelligenz | Artificial intelligence | Theorie | Theory |
-
Shin, Woo-Jin, (2025)
-
Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times
Heger, Jens, (2016)
-
An exact solution with an improved running time for the routing flow shop problem with two machines
Chernykh, Ilya, (2024)
- More ...
-
Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem
Bendotti, Pascale, (2021)
-
The anchor-robust project scheduling problem
Bendotti, Pascale, (2023)
-
Anchored reactive and proactive solutions to the CPM-scheduling problem
Bendotti, Pascale, (2017)
- More ...