default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBroos Maenhout
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j37]Pavlína Koutecká
, Premysl Sucha, Jan Hula, Broos Maenhout:
A machine learning approach to rank pricing problems in branch-and-price. Eur. J. Oper. Res. 320(2): 328-342 (2025)- 2024
- [j36]Tessa Borgonjon, Broos Maenhout:
The impact of dynamic learning and training on the personnel staffing decision. Comput. Ind. Eng. 187: 109784 (2024) - [j35]Babak Akbarzadeh, Broos Maenhout:
A two-layer heuristic for patient sequencing in the operating room theatre considering multiple resource phases. Comput. Oper. Res. 170: 106768 (2024) - [j34]Tessa Borgonjon, Broos Maenhout:
A genetic algorithm for the personnel task rescheduling problem with time preemption. Expert Syst. Appl. 238(Part B): 121868 (2024) - [j33]Broos Maenhout, Mario Vanhoucke:
Dynamic personnel rescheduling: insights and recovery strategies. J. Sched. 27(1): 1-27 (2024) - 2023
- [j32]Tine Meersman, Broos Maenhout, Koen Van Herck:
A nested Benders decomposition-based algorithm to solve the three-stage stochastic optimisation problem modeling population-based breast cancer screening. Eur. J. Oper. Res. 310(3): 1273-1293 (2023) - [j31]Pieter De Moerloose, Broos Maenhout:
A two-stage local search heuristic for solving the steelmaking continuous casting scheduling problem with dual shared-resource and blocking constraints. Oper. Res. 23(1): 2 (2023) - 2022
- [j30]Tine Meersman, Broos Maenhout:
Multi-objective optimisation for constructing cyclic appointment schedules for elective and urgent patients. Ann. Oper. Res. 312(2): 909-948 (2022) - [j29]Tessa Borgonjon, Broos Maenhout:
A heuristic procedure for personnel task rescheduling with time-resource-quality trade-offs. Comput. Ind. Eng. 170: 108254 (2022) - [j28]Tessa Borgonjon, Broos Maenhout:
A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem. Comput. Oper. Res. 138: 105624 (2022) - [j27]Pavel Milicka, Premysl Sucha, Mario Vanhoucke, Broos Maenhout:
The bilevel optimisation of a multi-agent project scheduling and staffing problem. Eur. J. Oper. Res. 296(1): 72-86 (2022) - [j26]Tessa Borgonjon, Broos Maenhout:
An exact approach for the personnel task rescheduling problem with task retiming. Eur. J. Oper. Res. 296(2): 465-484 (2022) - [j25]Babak Akbarzadeh, Johan Wouters, Carl Sys, Broos Maenhout:
The Scheduling of Medical Students at Ghent University. INFORMS J. Appl. Anal. 52(4): 303-323 (2022) - [j24]Loïc Deklerck, Babak Akbarzadeh, Broos Maenhout:
Constructing and evaluating a master surgery schedule using a service-level approach. Oper. Res. 22(4): 3663-3711 (2022) - 2021
- [j23]Mick Van Den Eeckhout, Mario Vanhoucke, Broos Maenhout:
A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing. Comput. Oper. Res. 128: 105163 (2021) - [j22]Babak Akbarzadeh, Broos Maenhout:
An exact branch-and-price approach for the medical student scheduling problem. Comput. Oper. Res. 129: 105209 (2021) - [j21]Babak Akbarzadeh, Broos Maenhout:
A decomposition-based heuristic procedure for the Medical Student Scheduling problem. Eur. J. Oper. Res. 288(1): 63-79 (2021) - 2020
- [j20]Mick Van Den Eeckhout, Broos Maenhout, Mario Vanhoucke:
Mode generation rules to define activity flexibility for the integrated project staffing problem with discrete time/resource trade-offs. Ann. Oper. Res. 292(1): 133-160 (2020) - [j19]Mick Van Den Eeckhout, Mario Vanhoucke, Broos Maenhout:
A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems. Eur. J. Oper. Res. 280(3): 845-859 (2020) - [j18]Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi, Broos Maenhout:
A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering. J. Sched. 23(2): 265-288 (2020)
2010 – 2019
- 2019
- [j17]Mick Van Den Eeckhout, Broos Maenhout, Mario Vanhoucke:
A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints. Comput. Oper. Res. 101: 144-161 (2019) - [j16]Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi, Broos Maenhout:
The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling. Eur. J. Oper. Res. 278(2): 596-614 (2019) - 2018
- [j15]Broos Maenhout, Mario Vanhoucke:
A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem. Eur. J. Oper. Res. 269(3): 806-823 (2018) - [j14]Jonas Ingels, Broos Maenhout:
The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster. J. Sched. 21(2): 143-165 (2018) - 2017
- [j13]Broos Maenhout, Mario Vanhoucke:
A resource type analysis of the integrated project scheduling and personnel staffing problem. Ann. Oper. Res. 252(2): 407-433 (2017) - [j12]Louis-Philippe Kerkhove, Mario Vanhoucke, Broos Maenhout:
On the resource renting problem with overtime. Comput. Ind. Eng. 111: 303-319 (2017) - [j11]Jonas Ingels, Broos Maenhout:
Employee substitutability as a tool to improve the robustness in personnel scheduling. OR Spectr. 39(3): 623-658 (2017) - [c3]Jonas Ingels, Broos Maenhout:
A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling. EvoCOP 2017: 44-59 - 2016
- [j10]Broos Maenhout, Mario Vanhoucke:
An exact algorithm for an integrated project staffing problem with a homogeneous workforce. J. Sched. 19(2): 107-133 (2016) - 2015
- [j9]Jonas Ingels, Broos Maenhout:
The impact of reserve duties on the robustness of a personnel shift roster: An empirical investigation. Comput. Oper. Res. 61: 153-169 (2015) - 2013
- [c2]Broos Maenhout, Mario Vanhoucke:
An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem. EvoCOP 2013: 97-108 - 2011
- [j8]Broos Maenhout, Mario Vanhoucke:
An evolutionary approach for the nurse rerostering problem. Comput. Oper. Res. 38(10): 1400-1411 (2011) - 2010
- [j7]Broos Maenhout, Mario Vanhoucke:
A hybrid scatter search heuristic for personalized crew rostering in the airline industry. Eur. J. Oper. Res. 206(1): 155-167 (2010) - [j6]Broos Maenhout, Mario Vanhoucke:
Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. J. Sched. 13(1): 77-93 (2010)
2000 – 2009
- 2009
- [j5]Mario Vanhoucke, Broos Maenhout:
On the characterization and generation of nurse scheduling problem instances. Eur. J. Oper. Res. 196(2): 457-467 (2009) - [j4]Broos Maenhout, Mario Vanhoucke:
The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach. J. Oper. Res. Soc. 60(12): 1683-1698 (2009) - 2008
- [j3]Broos Maenhout, Mario Vanhoucke:
Comparison and hybridization of crossover operators for the nurse scheduling problem. Ann. Oper. Res. 159(1): 333-353 (2008) - [j2]Mario Vanhoucke, José Coelho, Dieter Debels, Broos Maenhout, Luís Valadares Tavares:
An evaluation of the adequacy of project network generators with systematically sampled networks. Eur. J. Oper. Res. 187(2): 511-524 (2008) - 2007
- [j1]Broos Maenhout, Mario Vanhoucke:
An electromagnetic meta-heuristic for the nurse scheduling problem. J. Heuristics 13(4): 359-385 (2007) - 2006
- [c1]Broos Maenhout, Mario Vanhoucke:
New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm. EvoCOP 2006: 159-170
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
