UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs

Servranckx, T; Vanhoucke, M; (2019) A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs. European Journal of Operational Research , 273 (3) pp. 841-860. 10.1016/j.ejor.2018.09.005. Green open access

[thumbnail of Servranckx and Vanhoucke, EJOR, 2019 - Working Paper Version.pdf]
Preview
Text
Servranckx and Vanhoucke, EJOR, 2019 - Working Paper Version.pdf - Accepted Version

Download (628kB) | Preview

Abstract

This paper investigates the resource-constrained project scheduling problem with alternative subgraphs (RCPSP-AS). In this scheduling problem, there exist alternative ways to execute subsets of activities that belong to work packages. One alternative execution mode must be selected for each work package and, subsequently, the selected activities in the project structure should be scheduled. Therefore, the RCPSP-AS consists of two subproblems: a selection and a scheduling subproblem. A key feature of this research is the categorisation of different types of alternative subgraphs in a comprehensive classification matrix based on the dependencies that exist between the alternatives in the project structure. As the existing problem-specific datasets do not support this framework, we propose a new dataset of problem instances using a well-known project network generator. Furthermore, we develop a tabu search that uses information from the proposed classification matrix to guide the search process towards high-quality solutions. We verify the overall performance of the metaheuristic and different improvement strategies using the developed dataset. Moreover, we show the impact of different problem parameters on the solution quality and we analyse the impact of distinct resource characteristics of alternatives on the selection process.

Type: Article
Title: A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs
Open access status: An open access version is available from UCL Discovery
DOI: 10.1016/j.ejor.2018.09.005
Publisher version: https://doi.org/10.1016/j.ejor.2018.09.005
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Project scheduling, Resource-constrained scheduling, Alternative subgraphs, Tabu search
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > UCL School of Management
URI: https://discovery.ucl.ac.uk/id/eprint/10122702
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item