کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4637487 | 1340741 | 2006 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An application of randomized minimum cut to the project time/cost tradeoff problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this paper, we introduce a solution procedure for solving the project time/cost tradeoff problem, such that a project’s duration is reduced for a specified amount of time at minimum cost. In our solution procedure, we find the minimum cut in the acyclic graph representing the critical paths of the project, using the fast algorithm of randomized minimum cut. The minimum cut so obtained, is then utilized to identify the project activities that are to be reduced, in order to achieve a certain reduction in the project’s total duration. The applicability of the proposed solution procedure is demonstrated by some test problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 173, Issue 2, 15 February 2006, Pages 1200–1207
Journal: Applied Mathematics and Computation - Volume 173, Issue 2, 15 February 2006, Pages 1200–1207
نویسندگان
Hamed R. Tareghian, Hassan Taheri,