Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm

Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP.