Optimizing for a Resource-constrained Multi-project Scheduling Problem with Planned Resource Unavailability

Based on a real producing scenario, we established a resource-constrained multi-project scheduling problem with planned resource unavailability model (RCMPSP-PRU) to minimize the makespan. Different from the traditional resourceconstrained multi-project scheduling model, RCMPSP-PRU introduces some new concepts such as site, movable resource and unmovable resource, and accompanied with planned resource unavailability. In order to solve RCMPSP-PRU, we firstly proposed a heuristic algorithm called ISHPR based on serial generation scheme and priority rules, then two improved algorithms named ISG-PS and ISG-PSTS was designed respectively, in which the genetic algorithm, particle swarm optimization and tabu search are incorporated. The GA and PSO algorithms were used to enhance the selection of better site for each job, and the TS was used to exploit better solutions when a resource unavailability occurred. The experimental results based on a real world instance show that ISG-PSTS has the best performance, which illustrates the effectiveness of this work. In addition, the method combined with various intelligent algorithms to solve scheduling problems can inspire later research. Keywords—multi-project scheduling; resource-constrained; planned resouce unavailability; genetic algorithm; particle swarm optimization; tabu search