Premium
Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison
Author(s) -
Almeida Bernardo F.,
Correia Isabel,
SaldanhadaGama Francisco
Publication year - 2019
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12568
Subject(s) - solver , mathematical optimization , integer programming , computer science , job shop scheduling , scheduling (production processes) , set (abstract data type) , linear programming , resource constraints , integer (computer science) , mathematics , distributed computing , schedule , programming language , operating system
In this paper, we study and compare several integer and mixed‐integer linear programming formulations for the multi‐skill resource‐constrained project scheduling problem. This is a problem characterized by a set of activities to be executed that in addition to the usual precedence constraints require several resources for each skill needed for their execution. A set of multi‐skill resources is assumed. The objective is to minimize the project's makespan. We revisit two existing models for the problem and propose two new ones. Additionally, we perform a theoretical comparison between the lower bounds provided by the linear programming relaxations of the models. Furthermore, a numerical experiment is performed on a set of instances from the literature to evaluate the suitability of an off‐the‐shelf solver to compute optimal solutions and lower bounds to the studied problem, using the aforementioned models.