Presentation and Solution of Critical Chain Project Scheduling Problem (CCPSP) model with consideration of feeding buffer

• Main Authors: Akdar Alemtabriz, Ashkan Ayough, Mahdie Baniasadi
• Format: Article
• Language: fas
• Published: Allameh Tabataba'i University Press 2016-10-01
• Series: Muṭāli̒āt-i Mudīriyyat-i Ṣan̒atī
• Subjects: resource constrained project scheduling problem; critical chain method; project buffer; feeding buffer; float; Genetic Algorithm
• Online Access: http://jims.atu.ac.ir/article_5707_03d5d4f94c45f2519c29f00e82da785b.pdf

During the recent years, extensive research has been done on the field of project scheduling. There is always uncertainty in the area of project scheduling that causes a deviation in the real plan from the scheduled plan. One of the solutions to deal with this uncertainty is using the critical chain method (CCM) in project scheduling. This method which is derived from the theory of constraints (TOC) is a new method in project control which was first proposed by Goldartt in 1997.In this research we attempt to use the principals of critical chain in resource-constrained project scheduling problem. The main innovation in this research is presentation of critical chain project scheduling problem model with consideration of feeding buffer and using float as a supplement for feeding buffer. For this matter, the project scheduling under resources constraints with critical chain approach was first written and its reliability was evaluated using the Lingo software. In the next step the solution algorithm of this model was developed using the genetic algorithm and finally different sample issues were investigated. The results of this research show the efficiency of the presented genetic algorithm