Packing-based branch-and-bound for discrete malleable task scheduling
Year of publication: |
2022
|
---|---|
Authors: | Braune, Roland |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 25.2022, 6, p. 675-704
|
Subject: | Bin packing | Branch-and-bound | Malleable tasks | Multiprocessor scheduling | Precedence constraints | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound |
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
-
Wang, Tianyu, (2019)
-
Parallel machine scheduling under uncertainty : models and exact algorithms
Song, Guopeng, (2022)
- More ...
-
Benda, Frank, (2019)
-
Braune, Roland, (2017)
-
Metaheuristic search concepts : a tutorial with applications to production and logistics
Zäpfel, Günther, (2010)
- More ...