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

Eduardo Conde

European Journal of Operational Research, 2009, vol. 197, issue 1, 235-242

Abstract: The execution of a given project, with a number of interrelated tasks due to precedence constraints, represents a challenge when one must to control the available resources and the compromised due dates. In this paper, we analyse this problem under uncertain individual task completing times, specifically, we will assume that a given range, for the admissible values of each individual completing time, is available. Taking into account that the precedence relations between tasks must be preserved, each realization of the admissible execution times for the set of tasks will define a new scenario determining the ending time for the project and the subset of critical tasks. The minmax regret criterion will be used in order to obtain a robust approximation to the critical set of tasks determining the overall execution time for the project.

Keywords: Robust; optimization; Project; management (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00479-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:197:y:2009:i:1:p:235-242

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().