Optimal procedures for the discrete time/cost trade-off problem in project networks-Reference-Cited by-同舟云学术

Optimal procedures for the discrete time/cost trade-off problem in project networks

Published:1996-01 Issue:1 Volume:88 Page:50-68
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Demeulemeester Erik L.,Herroelen Willy S.,Elmaghraby Salah E.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. Optimal reduction of two-terminal directed acyclic graphs;Bein;SIAM Journal on Computing,1992

2. A fast algorithm for the decomposition of graphs and posets;Buer;Mathematics of Operations Research,1983

3. On the complete reduction of directed acyclic graphs;Colby,1984

4. Complexity of the discrete time-cost tradeoff problem for project networks;De,1992

5. The discrete time/cost trade-off problem revisited;De,1993

Cited by 103 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Augmented Time–Cost Trade-Off Optimization Using Particle Swarm Optimization;Journal of Construction Engineering and Management;2024-05

2. Multi-objective planning for time-cost trade-offs in multi-project parallel environment;Engineering, Construction and Architectural Management;2024-03-26

3. An exact decomposition technique for the deadline-constrained discrete time/cost trade-off problem with discounted cash flows;Computers & Operations Research;2024-03

4. Customer segmentation, pricing, and lead time decisions: A stochastic-user-equilibrium perspective;International Journal of Production Economics;2023-10

5. On the summary measures for the resource-constrained project scheduling problem;Annals of Operations Research;2023-07-03