Hybrid exact method for resource constrained project scheduling problem
Publish place: 7th International Industrial Engineering Conference
Publish Year: 1389
Type: Conference paper
Language: Persian
View: 1,653
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
Export:
Document National Code:
IIEC07_008
Index date: 28 May 2010
Hybrid exact method for resource constrained project scheduling problem abstract
A number of exact scheduling schemes incorporating various solution techniques such as branch and bound and dynamic programming exist for solving the well known resource constrained project scheduling problem. In this paper we report on a hybrid method which prominently depends on a branch and bound with a look-ahead mechanism as well as a genetic algorithm. Minimal delay set, core time, left shift are among the pruning rules used to prune inferior nodes of the enumeration tree. The proposed method has been verified and validated using a standard set of test problems with 30-120 requiring between 1-6 resource types each. The capability and applicability of the proposed method is demonstrated using standard problem instances
Hybrid exact method for resource constrained project scheduling problem Keywords:
Hybrid exact method for resource constrained project scheduling problem authors
Hamid Reza Yoosefzadeh
Ferdowsi University of Mashhad
Hamed Reza Tareghian
Ferdowsi University of Mashhad
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :