Reducing the feasible solution space of resource-constrained project instances
- Author
- Mario Vanhoucke (UGent) and José Fernandes da Silva Coelho (UGent)
- Organization
- Abstract
- This paper present an instance transformation procedure to modify known instances of the resource -constrained project scheduling problem to make them easier to solve by heuristic and/or exact solution algorithms. The procedure makes use of a set of transformation rules that aim at reducing the feasible search space without excluding at least one possible optimal solution. The procedure will be applied to a set of 11,183 instances and it will be shown by a set of experiments that these transformations lead to 110 improved lower bounds, 16 new and better schedules (found by three meta -heuristic procedures and a set of branch -and -bound procedures) and even 64 new optimal solutions which were never not found before.
- Keywords
- Management Science and Operations Research, Modeling and Simulation, General Computer Science, Resource constraints, Project networks, Instance complexity, Resource-constrained project scheduling
Downloads
-
(...).pdf
- full text (Published version)
- |
- UGent only
- |
- |
- 1.69 MB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-01HPPDYEQ13MY45KDRGAASJM28
- MLA
- Vanhoucke, Mario, and José Fernandes da Silva Coelho. “Reducing the Feasible Solution Space of Resource-Constrained Project Instances.” COMPUTERS & OPERATIONS RESEARCH, vol. 165, 2024, doi:10.1016/j.cor.2024.106567.
- APA
- Vanhoucke, M., & Fernandes da Silva Coelho, J. (2024). Reducing the feasible solution space of resource-constrained project instances. COMPUTERS & OPERATIONS RESEARCH, 165. https://doi.org/10.1016/j.cor.2024.106567
- Chicago author-date
- Vanhoucke, Mario, and José Fernandes da Silva Coelho. 2024. “Reducing the Feasible Solution Space of Resource-Constrained Project Instances.” COMPUTERS & OPERATIONS RESEARCH 165. https://doi.org/10.1016/j.cor.2024.106567.
- Chicago author-date (all authors)
- Vanhoucke, Mario, and José Fernandes da Silva Coelho. 2024. “Reducing the Feasible Solution Space of Resource-Constrained Project Instances.” COMPUTERS & OPERATIONS RESEARCH 165. doi:10.1016/j.cor.2024.106567.
- Vancouver
- 1.Vanhoucke M, Fernandes da Silva Coelho J. Reducing the feasible solution space of resource-constrained project instances. COMPUTERS & OPERATIONS RESEARCH. 2024;165.
- IEEE
- [1]M. Vanhoucke and J. Fernandes da Silva Coelho, “Reducing the feasible solution space of resource-constrained project instances,” COMPUTERS & OPERATIONS RESEARCH, vol. 165, 2024.
@article{01HPPDYEQ13MY45KDRGAASJM28,
abstract = {{This paper present an instance transformation procedure to modify known instances of the resource -constrained project scheduling problem to make them easier to solve by heuristic and/or exact solution algorithms. The procedure makes use of a set of transformation rules that aim at reducing the feasible search space without excluding at least one possible optimal solution. The procedure will be applied to a set of 11,183 instances and it will be shown by a set of experiments that these transformations lead to 110 improved lower bounds, 16 new and better schedules (found by three meta -heuristic procedures and a set of branch -and -bound procedures) and even 64 new optimal solutions which were never not found before.}},
articleno = {{106567}},
author = {{Vanhoucke, Mario and Fernandes da Silva Coelho, José}},
issn = {{0305-0548}},
journal = {{COMPUTERS & OPERATIONS RESEARCH}},
keywords = {{Management Science and Operations Research,Modeling and Simulation,General Computer Science,Resource constraints,Project networks,Instance complexity,Resource-constrained project scheduling}},
language = {{eng}},
pages = {{19}},
title = {{Reducing the feasible solution space of resource-constrained project instances}},
url = {{http://doi.org/10.1016/j.cor.2024.106567}},
volume = {{165}},
year = {{2024}},
}
- Altmetric
- View in Altmetric
- Web of Science
- Times cited: