An improved branch-cut-and-price algorithm for parallel machine scheduling problems
| Year of publication: |
2020
|
|---|---|
| Authors: | Oliveira, Daniel Ribeiro de ; Pessoa, Artur |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 32.2020, 1, p. 90-100
|
| Subject: | parallel machine scheduling | integer programming | column generation | branch-cut-and-price | time-indexed formulations | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Produktionssteuerung | Production control | Branch-and-Bound | Branch and Bound |
-
Çanakoğlu, Ethem, (2021)
-
Liu, Guo-Sheng, (2019)
-
On the exact solution of a large class of parallel machine scheduling problems
Bulhões, Teobaldo, (2020)
- More ...
-
Fundamental economic variables : a study from the leontief methodology
Montibeler, Everlam Elias, (2018)
-
Britto, Jorge Nogueira de Paiva, (2017)
-
The price-elastic knapsack problem
Fukasawa, Ricardo, (2024)
- More ...