A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints

Watermeyer, Kai GND; Zimmermann, Jürgen GND

In this paper, we consider the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. For the first time, the concept of partially renewable resources is embedded in the context of projects with general temporal constraints. While partially renewable resources have already broadened the area of applications for project scheduling, the extension by general temporal constraints allows to consider even more relevant aspects of real projects. We present a branch-and-bound procedure for the problem with the objective to minimize the project duration. To improve the performance of the solution procedure, new consistency tests, lower bounds, and dominance rules are developed. Furthermore, new temporal planning procedures, based on forbidden start times of activities, are presented which can be used for any project scheduling problem with general temporal constraints independent on the considered resource type. In a performance analysis, we compare our branch-and-bound procedure with the mixed-integer linear programming solver IBM CPLEX 12.8.0 on adaptations of benchmark instances from the literature. In addition, we compare our solution procedure with the only available branch-and-bound procedure for partially renewable resources. The results of the computational experiments prove the efficiency of our branch-and-bound procedure.

Zitieren

Zitierform:

Watermeyer, Kai / Zimmermann, Jürgen: A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints. 2020.

Zugriffsstatistik

Gesamt:
Volltextzugriffe:
Metadatenansicht:
12 Monate:
Volltextzugriffe:
Metadatenansicht:

Grafik öffnen

Rechte

Nutzung und Vervielfältigung:

Export