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 | Algorithmus | Algorithm | Graphentheorie | Graph theory |
-
A Book of Open Shop Scheduling : Algorithms, Complexity and Applications
Kubiak, Wieslaw, (2022)
-
Scheduling with agreements : new results
Bendraouche, Mohamed, (2016)
-
Scheduling on uniform machines with a conflict graph : complexity and resolution
Mallek, Amin, (2024)
- More ...
-
Scheduling theory and its applications
Chrétienne, Philippe, (1995)
-
Chrétienne, Philippe, (2006)
-
Fiber-to-object assignment heuristics
Sourd, Francis, (1999)
- More ...