دانلود کتاب A branch-and-bound algorithm for the resource-constrained project scheduling problem

Name: A branch-and-bound algorithm for the resource-constrained project scheduling problem
Availability: InStock
Author: Dorndorf U.

by Dorndorf U., Pesch Е., Phan-Huv Т.

عنوان فارسی: الگوریتم شاخه و محدود برای پروژه منابع محدود كارگاهي
سال: 2000
زبان: انگلیسی
تعداد صفحه (نسخه چاپی - نسخه الکترونیکی): 27-27
نوع فایل: PDF دانلود نرم افزار مطالعه
حجم: 0.18 مگابایت

گزارش تخلف

دانلود کتاب

افزودن خلاصه فارسی

جزییات کتاب

We describe a time-oriented branch-and-bound algorithm for the resource-constrained project scheduling problem which explores the set of active schedules by enumerating possible activity start times. The algorithm uses constraint-propagation techniques that exploit the temporal and resource constraints of the problem in order to reduce the search space. Computational experiments with large, systematically generated benchmark test sets, ranging in size from thirty to one hundred and twenty activities per problem instance, show that the algorithm scales well and is competitive with other exact solution approaches. The computational results show that the most difficult problems occur when scarce resource supply and the structure of the resource demand cause a problem to be highly disjunctive.