1. A tool to test and validate algorithms for the resource-constrained project scheduling problem
- Author
-
José Coelho and Mario Vanhoucke
- Subjects
021103 operations research ,General Computer Science ,Job shop scheduling ,Computer science ,business.industry ,Project data ,0211 other engineering and technologies ,General Engineering ,02 engineering and technology ,Schedule (project management) ,Network topology ,Scheduling (computing) ,Project scheduling problem ,Incentive ,Risk analysis (business) ,Best known solutions ,0202 electrical engineering, electronic engineering, information engineering ,Resource-constrained project scheduling ,020201 artificial intelligence & image processing ,Project management ,business ,Algorithm - Abstract
In a paper written by by Vanhoucke et al. (2016), an overview of artificial and empirical project databases has been given for integrated project management and control. These databases are collections of the most well-known and widespread data instances available in literature for the construction of a baseline schedule, the analysis of schedule risk or the use for project control. The current paper serves as a follow-up study to further elaborate on the use of these data instances, and to give researchers an incentive to use these datasets for their research on the development and validation of new algorithms for project scheduling. Therefore, unlike the general focus of the previous paper on baseline scheduling, schedule risk analysis and project control, the focus on the current paper is restricted to resource-constrained project scheduling. The intention of this follow-up overview is fourfold. First and foremost, a procedure is proposed to facilitate the reporting of best known solutions for the well-known single- and multi-mode resource-constrained project scheduling problem to minimize the project makespan. Secondly, the paper reports our best known solutions we obtained so far, and reflects on the network and resource parameters that increase the project complexity. In doing so, areas to focus on for future research are detected, and an attempt to define hard problem instances is given. Thirdly, a new dataset is presented for the resource-constrained project scheduling problem that is much more diverse in both the network topology and resource scarceness and will enable the future researcher to develop algorithms to solve a wider range of project problems. Finally, the paper also adds some links to tutorials and other relevant information to stimulate researchers to download the data and update best known solutions once available. We acknowledge the financial support provided by the “Bijzonder Onderzoeksfonds” (BOF) and by the National Bank of Belgium (NBB) for the project with contract number BOF12GOA021 and by the Fundação para a Ciência e Tecnologia with contract number FRH/ BSAB/127795/2016. info:eu-repo/semantics/publishedVersion
- Published
- 2018
- Full Text
- View/download PDF