Solving a time-indexed formulation by preprocessing and cutting planes
Year of publication: |
2014
|
---|---|
Authors: | Berghman, Lotte ; Spieksma, Frits C. R. ; T'kindt, Vincent |
Publisher: |
Leuven : KU Leuven, Fac. of Economics and Business |
Subject: | unrelated machine scheduling | time-indexed formulation | valid inequalities | cutting plane algorithm | variable fixing | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Produktionssteuerung | Production control |
-
Exploiting symmetry for the job sequencing and tool switching problem
Akhundov, Najmaddin, (2024)
-
A cutting plane approach for the multi-machine precedence-constrained scheduling problem
Venkateshan, Prahalad, (2020)
-
Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
Gicquel, C., (2015)
- More ...
-
Solving a Time-Indexed Formulation by Preprocessing and Cutting Planes
Berghman, Lotte, (2014)
-
Optimal Solutions for a Dock Assignment Problem with Trailer Transportation
Berghman, Lotte, (2010)
-
Computational experiments with a cutting-plane algorithm for a time-indexed formulation
Berghman, Lotte, (2012)
- More ...