A multi-objective resource allocation problem in dynamic PERT networks

DOI10.1016/j.amc.2006.01.027zbMath1152.90584MaRDI QIDQ945351

Reza Tavakkoli-Moghaddam, Amir Azaron

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.01.027

zbMATH Keywords

queueing; optimal control; project management; multiple objective programming

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90B50: Management decision making, including multiple objectives

90B22: Queues and service in operations research

Related Items

Bicriteria shortest path in networks of queues

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
• Distribution function of the shortest path in networks of queues
• Optimal resource profiles for program scheduling
• Optimal control of service rates and arrivals in Jackson networks
• Resource allocation via dynamic programming in activity networks
• Time-cost trade-off via optimal control theory in Markov 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
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Optimum Time Compression in Project Scheduling
• Critical Path Problems with Concave Cost-Time Curves