Improved Compact Models for the Resource-Constrained Project Scheduling Problem

  • In this article, we study compact Mixed-Integer Programming (MIP) models for the Resource-Constrained Project Scheduling Problem (RCPSP). Compared to the classical time-indexed formulation, the size of compact models is strongly polynomial in the number of jobs. In addition to two compact models from the literature, we propose a new compact model. We can show that all three compact models are equivalent by successive linear transformations. For their LP-relaxations, however, we state a full inclusion hierarchy where our new model dominates the previous models in terms of polyhedral strength. Moreover, we reveal a polyhedral relationship to the common time-indexed model. Furthermore, a general class of valid cutting planes for the compact models is introduced and finally all models are evaluated by computational experiments.
Metadaten
Author:Alexander Tesch
Document Type:In Proceedings
Parent Title (English):Operations Research Proceedings 2016
First Page:25
Last Page:30
Year of first publication:2017
Preprint:urn:nbn:de:0297-zib-62891