Using column generation to solve parallel machine scheduling problems with minmax objective functions
Year of publication: |
2012
|
---|---|
Authors: | Akker, J. M. van den ; Hougeveen, J. A. ; Kempen, J. W. van |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 15.2012, 6, p. 801-810
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang, (2020)
-
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines
Hazır, Öncü, (2021)
- More ...
-
Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
Akker, J. M. van den, (2010)
-
Identifying and exploiting commonalities for the job-shop scheduling problem
Kammer, Marnix, (2011)
-
Robust planning of airport platform buses
Diepen, G., (2013)
- More ...