Malleable scheduling beyond identical machines
Year of publication: |
2023
|
---|---|
Authors: | Fotakis, Dimitris ; Matuschke, Jannik ; Papadigenopoulos, Orestis |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 26.2023, 5, p. 425-442
|
Subject: | Approximation | Jobs | Machines | Makespan | Malleable | Moldable | Packing | Parallel | Restricted | Rounding | Scheduling | Uniform | Unrelated | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Heuristik | Heuristics |
-
An ant colonial optimisation approach for no-wait permutation flow shop scheduling
Khan, Ahitsham Shad, (2017)
-
A competitive variable neighbourhood search algorithm for the blocking flow shop problem
Ribas, Imma, (2013)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
- More ...
-
Cost-balancing tolls for atomic network congestion games
Fotakis, Dimitris, (2007)
-
The impact of social ignorance on weighted congestion games
Fotakis, Dimitris, (2009)
-
Combined land-use and water allocation planning
Fotakis, Dimitris, (2014)
- More ...