Show simple item record

dc.contributor.authorServranckx, Tom
dc.contributor.authorVanhoucke, Mario
dc.contributor.authorVanhouwaert, Giel
dc.date.accessioned2020-08-28T06:13:35Z
dc.date.available2020-08-28T06:13:35Z
dc.date.issued2020en_US
dc.identifier.issn0360-8352
dc.identifier.issn1879-0550
dc.identifier.doi10.1016/j.cie.2020.106706
dc.identifier.urihttp://hdl.handle.net/20.500.12127/6531
dc.description.abstractIn this research, we investigate an extension of the resource-constrained project scheduling problem (RCPSP) with alternatives in the project structure, the so-called RCPSP with alternative subgraphs (RCPSP-AS). The RCPSP-AS consists of a selection subproblem to decide amongst the alternatives in the project structure and a scheduling subproblem to schedule the selected activities in the resulting project structure. In case of a high number of alternatives, however, the selection subproblem might become very complex. In this research, we therefore present a two-step procedure to reduce the complexity of the selection subproblem of the RCPSP-AS. First, we construct a set of high-quality schedules and, subsequently, we analyse the selected alternatives in this set of schedules. Based on two thresholds, defined as the schedule diversity and choice frequency thresholds, we aim at reducing the number of alternatives in the problem. In doing so, the selection subproblem becomes easier to solve thanks to the lower number of alternatives to choose from, and consequently, the solution procedure to solve the RCPSP-AS should now focus on the scheduling subproblem. However, the computational experiments show that both thresholds should be set with care since the low complexity of the selection subproblem might result in some side effects. More precisely, we investigate the impact of both thresholds on the quality of the final schedule as they impact the stop criterion and the size of the neighbourhood in a solution procedure. We have developed our approach based on empirical case studies and validated the results on a large set of artificial projects.en_US
dc.language.isoenen_US
dc.publisherPergamon - Elsevieren_US
dc.subjectProject Schedulingen_US
dc.subjectAlternative Project Structuresen_US
dc.subjectNetwork Analysisen_US
dc.subjectManaging Resourcesen_US
dc.subjectEmpirical Studyen_US
dc.titleAnalysing the impact of alternative network structures on resource-constrained schedules: Artificial and empirical experimentsen_US
dc.identifier.journalComputers and Industrial Engineeringen_US
dc.source.volume148en_US
dc.source.issueOctoberen_US
dc.source.beginpage1en_US
dc.source.endpage15en_US
dc.contributor.departmentFaculty of Economics and Business Administration, Ghent University, Tweekerkenstraat 2, 9000 Ghent, Belgiumen_US
dc.contributor.departmentUCL School of Management, University College London, 1 Canada Square, London E14 5AA, United Kingdomen_US
vlerick.knowledgedomainOperations & Supply Chain Managementen_US
vlerick.typearticleJournal article with impact factoren_US
vlerick.vlerickdepartmentTOMen_US
dc.identifier.vperid58614en_US


Files in this item

Thumbnail
Name:
Publisher version

This item appears in the following Collection(s)

Show simple item record