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 | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Produktionsplanung | Production planning | Packproblem | Packing problem | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics |
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
-
Exact methods for order acceptance and scheduling on unrelated parallel machines
Wang, Shijin, (2019)
-
A two-stage three-machine assembly scheduling problem with a position-based learning effect
Wu, Chin-Chia, (2018)
- More ...
-
Moderne Heuristiken der Produktionsplanung : am Beispiel der Maschinenbelegung
Zäpfel, Günther, (2005)
-
Braune, Roland, (2013)
-
Zäpfel, Günther, (2006)
- More ...