Various extensions in resource-constrained project scheduling with alternative subgraphs
- Author
- Tom Servranckx (UGent) , José Fernandes da Silva Coelho (UGent) and Mario Vanhoucke (UGent)
- Organization
- Project
- Abstract
- In this research, we present several extensions for the resource-constrained project scheduling problem with alternative subgraphs (RCPSP-AS). First of all, we investigate more complex variants of the alternative project structure. More precisely, we consider nested alterative subgraphs, linked alternative branches, multiple selection, caused and closed choices, and split choices. Secondly, we introduce non-renewable resources in the RCPSP-AS in order to implicitly avoid certain combinations of alternatives given a limited availability of this resource over the complete project horizon. We formulate both the basic RCPSP-AS and its extensions as an ILP model and solve it using Gurobi. The computational experiments are conducted on a large set of artificial project instances as well as three case studies. The results show the impact of the different extensions on the project makespan and the computational complexity. We observe that combinations of the proposed extensions might imply complex alternative project structures, resulting in an increasing computational complexity or even infeasible solutions. The analysis of the three case studies shows that it is hard to find feasible solutions with a small time limit or optimal solutions with a larger time limit for projects with a realistic size in terms of the number of activities or alternatives.
- Keywords
- Industrial and Manufacturing Engineering, Management Science and Operations Research, Strategy and Management, Project scheduling, resource constraints, alternative subgraphs, integer formulation, case studies, RENTING PROBLEM, GENETIC ALGORITHM, TIME, OPTIMIZATION, RESTRICTIONS, HEURISTICS, MINIMUM, MODELS
Downloads
-
(...).pdf
- full text (Published version)
- |
- UGent only
- |
- |
- 1.09 MB
-
8742431.pdf
- full text (Accepted manuscript)
- |
- open access
- |
- |
- 625.85 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8742431
- MLA
- Servranckx, Tom, et al. “Various Extensions in Resource-Constrained Project Scheduling with Alternative Subgraphs.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol. 60, no. 11, 2022, pp. 3501–20, doi:10.1080/00207543.2021.1924411.
- APA
- Servranckx, T., Fernandes da Silva Coelho, J., & Vanhoucke, M. (2022). Various extensions in resource-constrained project scheduling with alternative subgraphs. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 60(11), 3501–3520. https://doi.org/10.1080/00207543.2021.1924411
- Chicago author-date
- Servranckx, Tom, José Fernandes da Silva Coelho, and Mario Vanhoucke. 2022. “Various Extensions in Resource-Constrained Project Scheduling with Alternative Subgraphs.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 60 (11): 3501–20. https://doi.org/10.1080/00207543.2021.1924411.
- Chicago author-date (all authors)
- Servranckx, Tom, José Fernandes da Silva Coelho, and Mario Vanhoucke. 2022. “Various Extensions in Resource-Constrained Project Scheduling with Alternative Subgraphs.” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 60 (11): 3501–3520. doi:10.1080/00207543.2021.1924411.
- Vancouver
- 1.Servranckx T, Fernandes da Silva Coelho J, Vanhoucke M. Various extensions in resource-constrained project scheduling with alternative subgraphs. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. 2022;60(11):3501–20.
- IEEE
- [1]T. Servranckx, J. Fernandes da Silva Coelho, and M. Vanhoucke, “Various extensions in resource-constrained project scheduling with alternative subgraphs,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol. 60, no. 11, pp. 3501–3520, 2022.
@article{8742431,
abstract = {{In this research, we present several extensions for the resource-constrained project scheduling problem with alternative subgraphs (RCPSP-AS). First of all, we investigate more complex variants of the alternative project structure. More precisely, we consider nested alterative subgraphs, linked alternative branches, multiple selection, caused and closed choices, and split choices. Secondly, we introduce non-renewable resources in the RCPSP-AS in order to implicitly avoid certain combinations of alternatives given a limited availability of this resource over the complete project horizon. We formulate both the basic RCPSP-AS and its extensions as an ILP model and solve it using Gurobi. The computational experiments are conducted on a large set of artificial project instances as well as three case studies. The results show the impact of the different extensions on the project makespan and the computational complexity. We observe that combinations of the proposed extensions might imply complex alternative project structures, resulting in an increasing computational complexity or even infeasible solutions. The analysis of the three case studies shows that it is hard to find feasible solutions with a small time limit or optimal solutions with a larger time limit for projects with a realistic size in terms of the number of activities or alternatives.}},
author = {{Servranckx, Tom and Fernandes da Silva Coelho, José and Vanhoucke, Mario}},
issn = {{0020-7543}},
journal = {{INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}},
keywords = {{Industrial and Manufacturing Engineering,Management Science and Operations Research,Strategy and Management,Project scheduling,resource constraints,alternative subgraphs,integer formulation,case studies,RENTING PROBLEM,GENETIC ALGORITHM,TIME,OPTIMIZATION,RESTRICTIONS,HEURISTICS,MINIMUM,MODELS}},
language = {{eng}},
number = {{11}},
pages = {{3501--3520}},
title = {{Various extensions in resource-constrained project scheduling with alternative subgraphs}},
url = {{http://doi.org/10.1080/00207543.2021.1924411}},
volume = {{60}},
year = {{2022}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: