A Heuristic Approach for the Multi-Project Scheduling Problem with Resource Transition Constraints

Abstract

A resource transition constraint models sequence dependent setup costs between activities on the same resource. In this work, we propose a heuristic for the multi-project scheduling problem with resource transition constraints, which relies on constraint programming and local search methods. The objective is to minimize the project delay, earliness and throughput time, while at the same time reducing setup costs. In computational results, we demonstrate the effectiveness of an implementation based on the presented concepts using instances from practice.