M
Mario Vanhoucke
Researcher at Katholieke Universiteit Leuven
Publications - 300
Citations - 8718
Mario Vanhoucke is an academic researcher from Katholieke Universiteit Leuven. The author has contributed to research in topics: Schedule (project management) & Project management. The author has an hindex of 46, co-authored 279 publications receiving 7455 citations. Previous affiliations of Mario Vanhoucke include Northwestern Polytechnical University & Ghent University.
Papers
More filters
Project management using dynamic scheduling: baseline scheduling, risk analysis and project control
TL;DR: The purpose of this chapter is to introduce the concept of “smart scheduling”, a process that automates the very labor-intensive and therefore time-heavy and expensive process of manually scheduling events.
Journal ArticleDOI
Analysis of the Integration of the Physician Rostering Problem and the Surgery Scheduling Problem
TL;DR: A mixed integer linear programming formulation is created based on the most frequently observed objective and restrictions of the surgery scheduling and the physician rostering problem in the literature and analyzed by relaxing both surgery and physician related constraints.
Journal ArticleDOI
A comparative study of Artificial Intelligence methods for project duration forecasting
Mathieu Wauters,Mario Vanhoucke +1 more
TL;DR: A methodology that involves Monte Carlo simulation, Principal Component Analysis and cross-validation, and can be applied by academics and practitioners to predict the final duration of a project's duration is proposed.
Book ChapterDOI
A bi-population based genetic algorithm for the resource-constrained project scheduling problem
Dieter Debels,Mario Vanhoucke +1 more
TL;DR: This paper presents a new genetic algorithm (GA) that, in contrast of a conventional GA, makes use of two separate populations, which operates on both a population of left-justified schedules and apopulation of right-justification schedules in order to fully exploit the features of the iterative forward/backward scheduling technique.
Journal ArticleDOI
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
TL;DR: Three heuristic approaches are developed, i.e., a genetic algorithm, a tabu search algorithm and a hybridization of these heuristics with a truncated branch-and-bound procedure in order to accelerate the search process to near-optimal solutions.