A minmax regret approach to the critical path method with task interval times
type: Item
instance of: scholarly article
title: A minmax regret approach to the critical path method with task interval times
zbMATH Open document ID: 1157.90439
author: E. Conde
published in: European Journal of Operational Research
publication date: 2009-04-08T00:00:00Z
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 5541450
zbMATH Keywords: robust optimization
zbMATH Keywords: project management
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.06.022
OpenAlex ID: W2019064555
cites work: Critical path analysis in the network with fuzzy activity times
cites work: The computational complexity of the criticality problems in a network with interval activity times
cites work: Q3760254
cites work: Analysis of critical paths in a project network with fuzzy activity times
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: Q5538306
cites work: Critical-Path Planning and Scheduling: Mathematical Basis
cites work: Application of a Technique for Research and Development Program Evaluation
cites work: Restricted robust uniform matroid maximization under interval uncertainty
cites work: The computational complexity of the relative robust shortest path problem with interval data
DOI: 10.1016/J.EJOR.2008.06.022
description: scientific article; zbMATH DE number 5541450