A minmax regret approach to the critical path method with task interval times

DOI10.1016/j.ejor.2008.06.022zbMath1157.90439OpenAlexW2019064555MaRDI QIDQ1011286

Eduardo Conde

Publication date: 8 April 2009

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

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

zbMATH Keywords

project managementrobust optimization

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50)

Related Items (4)

Criticality analysis of activity networks under interval uncertainty ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ Computing the minimum construction cost of a building's external wall taking into account its energy efficiency ⋮ A mixed integer linear programming formulation of the maximum betweenness problem

Cites Work

• Unnamed Item
• Unnamed Item
• The computational complexity of the relative robust shortest path problem with interval data
• Restricted robust uniform matroid maximization under interval uncertainty
• Shortest paths algorithms: Theory and experimental evaluation
• Analysis of critical paths in a project network with fuzzy activity times
• Critical-Path Planning and Scheduling: Mathematical Basis
• Application of a Technique for Research and Development Program Evaluation
• Critical path analysis in the network with fuzzy activity times
• The computational complexity of the criticality problems in a network with interval activity times

This page was built for publication: A minmax regret approach to the critical path method with task interval times