Volume 28, Issue 4 (IJIEPR 2017)                   IJIEPR 2017, 28(4): 429-439 | Back to browse issues page

XML Print

Associate Prof. Qazvin Islamic Azad University , p.azimi@yahoo.com
Abstract:   (458 Views)

In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current research. In this approach, the mathematical model of the main problem is relaxed and solved then the optimum solutions were used in the corresponding simulation model to produce several random feasible solutions for the main problem. Finally, the most promising solutions were selected as the initial population of a genetic Algorithm (GA). To test the efficiency of the problem, several test problems were solved by the proposed approach and according to the results, the proposed concept has a very good performance to solve such a complex combinatoral problem. Also, the concept could be easily applied for other similar combinatorics. 

Full-Text [PDF 495 kb]   (112 Downloads)    
Type of Study: Research | Subject: Simulation & Stochastic Models
Received: 2017/02/13 | Accepted: 2017/11/15 | Published: 2017/11/15