Integration of Multi-mode Resource-Constrained Project Scheduling under bonus-penalty policies with Material Ordering under Quantity Discount scheme for minimizing project cost

In this paper a mixed binary integer mathematical programming model is developed for integration of Multimode Resource-Constraint Project Scheduling Problem (MRCPSP) under bonus–penalty policies and Quantity Discount Problem in Material Ordering (QDPMO) with the objective of minimizing the total project cost. By proving a theorem, an important property of the optimum solution of the problem is found which reduces the search space significantly compared to previous studies. Since the RCPSP belongs to the class of problems that are NP-hard, four hybrid meta-heuristic algorithms called COA-GA, GWO-GA, PSO-GA and GA-GA is developed and tuned to solve the problem. Each of the proposed algorithms consists of outside and inside search components, which determine the best schedule, and materials procurement plan respectively. Finally a set of standard PROGEN test problems is solved by the proposed hybrid algorithms under fixed CPU time. The results show that the COA-GA algorithm outperforms others.