Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach

DOI10.1016/j.ejor.2006.05.014zbMath1121.90032OpenAlexW2080335475MaRDI QIDQ872140

Amir Azaron, Reza Tavakkoli-Moghaddam

Publication date: 27 March 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.05.014

zbMATH Keywords

queueingoptimal controlMarkov processesmultiple objective programmingproject management and scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (9)

Computing project makespan distributions: Markovian PERT networks revisited ⋮ A float-path theory and its application to the time-cost tradeoff problem ⋮ Resource allocation in multi-class dynamic PERT networks with finite capacity ⋮ Multimode time-cost-robustness trade-off project scheduling problem under uncertainty ⋮ Resource allocation in dynamic PERT networks with finite capacity ⋮ Simplifying the nonlinear continuous time-cost tradeoff problem ⋮ An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs ⋮ The risk element transmission theory research of multi-objective risk-time-cost trade-off ⋮ A MULTI-OBJECTIVE RISK-BASED FRAMEWORK FOR MISSION CAPABILITY PLANNING

Cites Work

• Unnamed Item
• Unnamed Item
• Longest path analysis in networks of queues: dynamic scheduling problems
• Controlled alternative activity networks for project management
• 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
• Distribution function of the shortest path in networks of queues
• Algorithms of optimal supply of resources to a group of projects (stochastic networks)
• Optimal resource profiles for program scheduling
• Resource allocation via dynamic programming in activity networks
• A multi-objective resource allocation problem in PERT networks
• A genetic algorithm approach for the time-cost trade-off in PERT 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
• A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions
• On-line control model for network construction projects
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• On-line Control Model for Cost-simulation Network Projects
• Optimum Time Compression in Project Scheduling
• Optimal Time-Cost Trade-Offs in GERT Networks
• Critical Path Problems with Concave Cost-Time Curves

This page was built for publication: Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach