کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4634768 1340699 2007 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms
چکیده انگلیسی

In this paper, we develop a metaheuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require a single constrained renewable resource. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements; as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. To tackle this problem, we use a genetic algorithm in which a new method based on the resource utilization ratio is developed for generation of crossover points and also a local search method is incorporated with the algorithm. Comparative computational results reveal that this procedure outperforms the best available results in the literature.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 191, Issue 2, 15 August 2007, Pages 451–456
نویسندگان
, ,