The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints
Year of publication: |
2019
|
---|---|
Authors: | Wang, Tianyu ; Bellenguez-Morineau, Odile |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 22.2019, 3, p. 263-269
|
Subject: | Parallel machine scheduling | Level-order | Precedence constraints | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Produktionssteuerung | Production control | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Liu, Guo-Sheng, (2019)
-
A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kowalczyk, D., (2016)
-
A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kowalczyk, Daniel, (2018)
- More ...
-
Wang, Tianyu, (2019)
-
Complexity of a one-to-one meeting scheduling problem with two types of actors
Le Roux, Agnès, (2015)
-
A constraint-based approach for the shift design personnel task scheduling problem with equity
Lapègue, Tanguy, (2013)
- More ...