[صفحه اصلی ]   [Archive]  
:: صفحه اصلي :: درباره نشريه :: آخرين شماره :: تمام شماره‌ها :: جستجو :: ثبت نام :: ارسال مقاله :: تماس با ما ::
:: جلد 4، شماره 1 - ( 3-1392 ) ::
جلد 4 شماره 1 صفحات 39-54 برگشت به فهرست نسخه ها
An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks
چکیده:   (19232 مشاهده)

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all possibly critical paths of interval-valued project networks. The proposed algorithm considers interactivity among paths which has not been yet considered in the fuzzy project scheduling literature. The extension of the proposed algorithm to the fuzzy network calculates criticality degrees of activities and paths of projects without any need to enumerate all project paths. Although algorithms for calculating criticality degrees in fuzzy networks have been previously proposed, despite the fact that they mostly consider a specific type of fuzzy numbers as activity duration times, the exiting algorithms do not discriminate possibly critical paths before calculating the criticality degrees. The computational experience on a series of well-known project samples confirms the algorithm to be remarkably more efficient than similar algorithms for fuzzy networks.

متن کامل [PDF 319 kb]   (7554 دریافت)    
نوع مطالعه: پژوهشی |
دریافت: 1393/2/4 | پذیرش: 1393/2/4 | انتشار: 1393/2/4
ارسال نظر درباره این مقاله
نام کاربری یا پست الکترونیک شما:

CAPTCHA


XML   English Abstract   Print



جلد 4، شماره 1 - ( 3-1392 ) برگشت به فهرست نسخه ها
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.11 seconds with 31 queries by YEKTAWEB 4162