Title: A fast greedy heuristic for scheduling modular projects
Authors: Huysmans, Martijn ×
Coolen, Kris
Talla Nobibon, F
Leus, Roel #
Issue Date: 2015
Publisher: Kluwer Academic Publishers
Series Title: Journal of Heuristics vol:21 issue:1 pages:47-72
Abstract: 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.
ISSN: 1381-1231
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Research and Business Statistics (ORSTAT), Leuven
LICOS - Centre for Institutions and Economic Performance, Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
MP1greedy_accepted.pdfA fast greedy heuristic for scheduling modular projects Published 412KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science