Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
Year of publication: |
2020
|
---|---|
Authors: | Silva, Marco ; Poss, Michael ; Maculan F., Nelson |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 283.2020, 1 (16.5.), p. 70-82
|
Subject: | Branch-and-bound | Integer programming | Robust optimization | Row-and-column generation | Scheduling problem | Scheduling-Verfahren | Theorie | Theory | Ganzzahlige Optimierung | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time | Evolutionärer Algorithmus | Evolutionary algorithm | Branch-and-Bound | Branch and Bound |
-
Kim, Jae-Gon, (2020)
-
Krishnaraj, J., (2012)
-
Detienne, Boris, (2016)
- More ...
-
On deep disjunctive cutting planes for set partitioning : a computationally oriented research
Campello, Ruy Eduardo, (1984)
-
Neamatian Monemi, Rahimeh, (2023)
-
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
Souza, Michael, (2011)
- More ...