An insertion mutation operator for solving project scheduling problem
Publish place: 12th Iranian Conference on Intelligent Systems
Publish Year: 1392
نوع سند: مقاله کنفرانسی
زبان: English
View: 775
متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICS12_200
تاریخ نمایه سازی: 11 مرداد 1393
Abstract:
Project scheduling problem is to determine the schedule of allocating resources to activities so as to balance the total cost and completion time of the project. The problem hasbeen studied considering certain and uncertain activity duration times. In project scheduling with certain activity duration times,the duration of activities are previously obvious while in the project scheduling with uncertain activity duration times, the duration of each activity is considered to be uncertain.For each kind of project scheduling problem, various optimization methods such as genetic algorithm have been used.In this paper, an insertion mutation is proposed for solving the project scheduling problem with uncertain activity duration times which ensures earlier convergence to the optimal solution if being added to the mutation operator of genetic algorithm.
Authors
Zeinab Nazeri
Computer Science department, Electrical and Computer Engineering department University of Tabriz Tabriz, Iran
Leyli Mohammad Khanli
Computer Science department, Electrical and Computer Engineering department University of Tabriz Tabriz, Iran