A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
Year of publication: |
2015
|
---|---|
Authors: | Choi, Byung-Cheon ; Park, Myoung-Ju |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 244.2015, 3 (1.8.), p. 748-752
|
Subject: | Project scheduling | Time-cost tradeoff | Computational complexity | Completely ordered jobs | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Projektmanagement | Project management | Heuristik | Heuristics | Netzplantechnik | Project network techniques | Mathematische Optimierung | Mathematical programming |
-
Choi, Byung-cheon, (2014)
-
Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem
Akkan, Can, (2000)
-
Computing project makespan distributions : Markovian PERT networks revisited
Burgelman, Jeroen, (2019)
- More ...
-
A continuous time–cost tradeoff problem with multiple milestones and completely ordered jobs
Choi, Byung-Cheon, (2015)
-
CHOI, BYUNG-CHEON, (2014)
-
Min, Yunhong, (2023)
- More ...