EURO 2025 Leeds
Abstract Submission

1545. Integer programming for multi-mode resource-constrained project scheduling

Invited abstract in session MA-12: Mathematical Programming in Project Scheduling , stream Scheduling and Project Management.

Monday, 8:30-10:00
Room: Clarendon SR 1.02

Authors (first author is the speaker)

1. Nicklas Klein
Department of Business Administration, University of Bern

Abstract

Projects typically consist of activities that require time and scarce resources for execution. In many projects, there are trade-offs between the resource requirements and activity durations that can be represented via multiple execution modes of the activities. The multi-mode resource-constrained project scheduling problem (MRCPSP) comprises determining the start times and execution modes of all project activities in order to minimize the project completion time while respecting precedence relations and availabilities of renewable and nonrenewable resources. We analyze several mixed-integer linear programming (MILP) models for the MRCPSP, which are based on models for the single-mode resource-constrained project scheduling problem (RCPSP). We first analyze the LP relaxations of the models and identify a trade-off between the objective function value of the relaxation and the CPU time required to solve it. We then compare the computational performance of the models on benchmark instances. Our results indicate that a novel continuous-time model outperforms the state-of-the-art models on relatively large problem instances, while it is competitive on smaller problem instances.

Keywords

Status: accepted

Back to the list of papers