Parallel machine scheduling under uncertainty : models and exact algorithms
Year of publication: |
2022
|
---|---|
Authors: | Song, Guopeng ; Leus, Roel |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 6, p. 3059-3079
|
Subject: | bin packing | branch and price | optimization under uncertainty | parallel machine scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Risiko | Risk | Mathematische Optimierung | Mathematical programming |
-
A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
Kowalczyk, D., (2016)
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
- More ...
-
MIP formulations for the resource loading problem
Song, Guopeng, (2018)
-
Scheduling multiple agile Earth observation satellites with multiple observations
Han, Chao, (2018)
-
Polyhedral results and branch-and-cut for the resource loading problem
Song, Guopeng, (2019)
- More ...