کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
477133 | 1446135 | 2010 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computing latest starting times of activities in interval-valued networks with minimal time lags
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Computing latest starting times of activities in interval-valued networks with minimal time lags Computing latest starting times of activities in interval-valued networks with minimal time lags](/preview/png/477133.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 200, Issue 3, 1 February 2010, Pages 874–880
Journal: European Journal of Operational Research - Volume 200, Issue 3, 1 February 2010, Pages 874–880
نویسندگان
Siamak Haji Yakhchali, Seyed Hassan Ghodsypour,