دوره 3، شماره 4 - ( 7-1392 )                   جلد 3 شماره 4 صفحات 527-542 | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Danka S. ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH . International Journal of Optimization in Civil Engineering. 2013; 3 (4) :527-542
URL: http://ijoce.iust.ac.ir/article-1-149-fa.html
ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH . دانشگاه علم و صنعت ایران. 1392; 3 (4) :527-542

URL: http://ijoce.iust.ac.ir/article-1-149-fa.html


چکیده:   (2254 مشاهده)
This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cost-oriented point of view. In the presented approach, it is assumed that each activity-duration and each cash flow value is an uncertain-but-bounded parameter, which is characterized by its optimistic and pessimistic estimations. The evaluation of a given robust schedule is based on the investigation of variability of the makespan as a primary and the net present value (NPV) as secondary criterion on the set of randomly generated scenarios given by a sampling-on-sampling-like process. Theoretically, the robust schedule-searching algorithm is formulated as a mixed integer linear programming problem, which is combined with a cost-oriented sampling-based approximation phase. In order to illustrate the essence of the proposed approach we present detailed computational results for a larger and very challenging project instance. A problem specific fast and efficient harmony search algorithm for large uncertain problems will be presented in a forthcoming paper.
متن کامل [PDF 173 kb]   (1140 دریافت)    
نوع مطالعه: پژوهشي | موضوع مقاله: Optimal design
دریافت: ۱۳۹۲/۷/۲۰ | پذیرش: ۱۳۹۲/۸/۲۸ | انتشار: ۱۳۹۲/۸/۲۸

کلیه حقوق این وب سایت متعلق به دانشگاه علم و صنعت ایران می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2015 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb