Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures
Year of publication: |
2020
|
---|---|
Authors: | Chrétienne, Philippe |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 23.2020, 1, p. 135-143
|
Subject: | Scheduling | Complexity | Algorithms | State graph | Scheduling-Verfahren | Scheduling problem | Graphentheorie | Graph theory | Algorithmus | Algorithm |
-
Thevenin, Simon, (2017)
-
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
Bianchessi, Nicola, (2021)
-
Soller, Henning, (2016)
- More ...
-
On scheduling with the non-idling constraint
Chrétienne, Philippe, (2014)
-
Integrated batch sizing and scheduling on a single machine
Chrétienne, Philippe, (2011)
-
Anchored reactive and proactive solutions to the CPM-scheduling problem
Bendotti, Pascale, (2017)
- More ...