Computing latest starting times of activities in interval-valued networks with minimal time lags

Siamak Haji Yakhchali and Seyed Hassan Ghodsypour

European Journal of Operational Research, 2010, vol. 200, issue 3, pages 874-880

Abstract: This paper deals with problems of determining possible values of earliest and latest starting times of an activity in networks with minimal time lags and imprecise durations that are represented by means of interval or fuzzy numbers. Although minimal time lags are practical in different projects, former researchers have not considered these problems. After proposing propositions which reduce the search space, a novel polynomial algorithm is presented to compute intervals of possible values of latest starting times in interval-valued networks with minimal time lags. Then, the results are extended to networks with fuzzy durations.

Keywords: Project; management; and; scheduling; Fuzzy; intervals; Fuzzy; PERT/CPM (search for similar items in EconPapers)
Date: 2010

Downloads: (external link)
http://www.sciencedirect.com/science/article/B6VCT ... dba51e6f2d4d612b0e0c
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: http://EconPapers.repec.org/RePEc:eee:ejores:v:200:y:2010:i:3:p:874-880

Access Statistics for this article

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

More articles in European Journal of Operational Research from Elsevier
Series data maintained by Heidi Boesdal ().