Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
We consider the RCPSP with general temporal constraints and break-calendars. A new and powerful time planning method is proposed. Three binary linear model formulations are presented. A priority-rule method and three different versions of a scatter search procedure are developed. We provide a test set and perform an extensive computational study.
calendars binary linear model formulations scatter search resource-constrained project scheduling problem (rcpsp) minimum and maximum time lags