Huysmans, Martijn
[VerfasserIn]
;
Coolen, Kris
[Sonstige Person, Familie und Körperschaft];
Nobibon, F. Talla
[Sonstige Person, Familie und Körperschaft];
Leus, R.
[Sonstige Person, Familie und Körperschaft]
A Fast Greedy Heuristic for Scheduling Modular Projects
Erschienen in:KU Leuven Faculty of Business and Economics KBI 1227
Umfang:
1 Online-Ressource (21 p)
Sprache:
Englisch
DOI:
10.2139/ssrn.2244892
Identifikator:
Entstehung:
Anmerkungen:
Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments 2012 erstellt
Beschreibung:
This article describes a heuristic for scheduling so-called ‘modular' projects. Exact solutions to this NP-hard problem can be obtained with existing branch-and-bound and dynamic-programming algorithms, but only for small to medium-size instances. The proposed heuristic, by contrast, can be used even for large instances, or when instances are particularly difficult because of their characteristics, such as a low network density. The proposed heuristic draws from existing results in the literature on sequential testing, which will be briefly reviewed. The performance of the heuristic is assessed over a dataset of 360 instances