A new path-based cutting plane approach for the discrete time-cost tradeoff problem
Year of publication: |
2010
|
---|---|
Authors: | Hadjiconstantinou, Eleni ; Klerides, Evelina |
Published in: |
Computational Management Science : CMS. - Berlin : Springer, ISSN 1619-697X, ZDB-ID 2136735-8. - Vol. 7.2010, 3, p. 313-336
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Terminplanung | Time scheduling | Mathematische Optimierung | Mathematical programming | Projektmanagement | Project management | Kostenmanagement | Cost management | Netzplantechnik | Project network techniques |
-
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can, (2000)
-
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can, (2000)
-
Prioritätsregelbasierte Ressourcenplanung für Projekte mit komplexer Ablaufstruktur
Holzer, Achim, (2000)
- More ...
-
A new path-based cutting plane approach for the discrete time-cost tradeoff problem
Hadjiconstantinou, Eleni, (2010)
-
Modelling and solution approaches to the multi-load AGV dispatching problem in container terminals
Klerides, Evelina, (2011)
-
Modelling and solution approaches to the multi-load AGV dispatching problem in container terminals
Klerides, Evelina, (2011)
- More ...