A genetic algorithm approach for the time-cost trade-off in PERT networks
Publication:2572768
DOI10.1016/j.amc.2004.10.021zbMath1082.65543MaRDI QIDQ2572768
Masatoshi Sakawa, Amir Azaron, Cahit Perkgoz
Publication date: 4 November 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.10.021
numerical examples; Genetic algorithm; Optimal control; PERT networks; Multiple objective programming; Project management and scheduling; Design of experiments
65K05: Numerical mathematical programming methods
90C29: Multi-objective and goal programming
65K10: Numerical optimization and variational techniques
90B50: Management decision making, including multiple objectives
90B35: Deterministic scheduling theory in operations research
49J15: Existence theories for optimal control problems involving ordinary differential equations
Related Items
Cites Work
- Unnamed Item
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Optimal procedures for the discrete time/cost trade-off problem in project networks
- Optimal resource profiles for program scheduling
- Optimal control of service rates and arrivals in Jackson networks
- Resource allocation via dynamic programming in activity networks
- A Network Flow Computation for Project Cost Curves
- Critical-Path Planning and Scheduling: Mathematical Basis
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPM
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Optimum Time Compression in Project Scheduling
- Critical Path Problems with Concave Cost-Time Curves