نشریه بین المللی مهندسی صنایع و تحقیقات تولید

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.