Solving resource-constrained multi-project environment under different activity assumptions

The Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) has been an essential topic of study for the past two decades. This paper presents the generalized RCMPSP(ABD) problem, where category A refers to project activities that can be implemented using fixed resources over fixed durations, category B refers to project activities that can be performed using resources as category A but the non-preemptions are relaxed, and category D refers to project activities that can be executed using flexible resources over flexible durations and may or may not be interrupted. The activity types A, B, or D related to resource utilization and interruptability are known for each activity. After blending the activity types, A, B, and D into the generalized problem, solution heuristics for the RCMPSP(ABD) are presented. Experimental testing shows that substantial reductions in the makespan of the entire project are possible, while also freeing up resources to be used on other projects. A mixed integer-linear program (MILP) formulation is also presented to define this combined problem. This problem has widespread application in practice, for example, in One-of-a-Kind Production (OKP) and construction environments. © 2020 Elsevier B.V.