Broos Maenhout

Orcid: 0000-0001-6685-3469

According to our database1, Broos Maenhout authored at least 40 papers between 2006 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A machine learning approach to rank pricing problems in branch-and-price.
Eur. J. Oper. Res., 2025

2024
A genetic algorithm for the personnel task rescheduling problem with time preemption.
Expert Syst. Appl., March, 2024

Dynamic personnel rescheduling: insights and recovery strategies.
J. Sched., February, 2024

The impact of dynamic learning and training on the personnel staffing decision.
Comput. Ind. Eng., January, 2024

A two-layer heuristic for patient sequencing in the operating room theatre considering multiple resource phases.
Comput. Oper. Res., 2024

2023
A nested Benders decomposition-based algorithm to solve the three-stage stochastic optimisation problem modeling population-based breast cancer screening.
Eur. J. Oper. Res., November, 2023

A two-stage local search heuristic for solving the steelmaking continuous casting scheduling problem with dual shared-resource and blocking constraints.
Oper. Res., March, 2023

2022
Constructing and evaluating a master surgery schedule using a service-level approach.
Oper. Res., 2022

The Scheduling of Medical Students at Ghent University.
INFORMS J. Appl. Anal., 2022

The bilevel optimisation of a multi-agent project scheduling and staffing problem.
Eur. J. Oper. Res., 2022

An exact approach for the personnel task rescheduling problem with task retiming.
Eur. J. Oper. Res., 2022

A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem.
Comput. Oper. Res., 2022

A heuristic procedure for personnel task rescheduling with time-resource-quality trade-offs.
Comput. Ind. Eng., 2022

Multi-objective optimisation for constructing cyclic appointment schedules for elective and urgent patients.
Ann. Oper. Res., 2022

2021
A decomposition-based heuristic procedure for the Medical Student Scheduling problem.
Eur. J. Oper. Res., 2021

A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing.
Comput. Oper. Res., 2021

An exact branch-and-price approach for the medical student scheduling problem.
Comput. Oper. Res., 2021

2020
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering.
J. Sched., 2020

A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems.
Eur. J. Oper. Res., 2020

Mode generation rules to define activity flexibility for the integrated project staffing problem with discrete time/resource trade-offs.
Ann. Oper. Res., 2020

2019
The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling.
Eur. J. Oper. Res., 2019

A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints.
Comput. Oper. Res., 2019

2018
The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster.
J. Sched., 2018

A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem.
Eur. J. Oper. Res., 2018

2017
Employee substitutability as a tool to improve the robustness in personnel scheduling.
OR Spectr., 2017

On the resource renting problem with overtime.
Comput. Ind. Eng., 2017

A resource type analysis of the integrated project scheduling and personnel staffing problem.
Ann. Oper. Res., 2017

A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2017

2016
An exact algorithm for an integrated project staffing problem with a homogeneous workforce.
J. Sched., 2016

2015
The impact of reserve duties on the robustness of a personnel shift roster: An empirical investigation.
Comput. Oper. Res., 2015

2013
An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

2011
An evolutionary approach for the nurse rerostering problem.
Comput. Oper. Res., 2011

2010
Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem.
J. Sched., 2010

A hybrid scatter search heuristic for personalized crew rostering in the airline industry.
Eur. J. Oper. Res., 2010

2009
The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach.
J. Oper. Res. Soc., 2009

On the characterization and generation of nurse scheduling problem instances.
Eur. J. Oper. Res., 2009

2008
An evaluation of the adequacy of project network generators with systematically sampled networks.
Eur. J. Oper. Res., 2008

Comparison and hybridization of crossover operators for the nurse scheduling problem.
Ann. Oper. Res., 2008

2007
An electromagnetic meta-heuristic for the nurse scheduling problem.
J. Heuristics, 2007

2006
New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006


  Loading...