A decomposition-based heuristic procedure for the medical student scheduling problem

DOI10.1016/j.ejor.2020.05.042zbMath1487.90262OpenAlexW3024034677MaRDI QIDQ2028840

Broos Maenhout, Babak Akbarzadeh

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.05.042

zbMATH Keywords

educationproblem decompositionheuristic optimisationmedical student scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)

Related Items (3)

An exact branch-and-price approach for the medical student scheduling problem ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system

Cites Work

• Unnamed Item
• Unnamed Item
• Complexity results for the basic residency scheduling problem
• A robust framework for task-related resident scheduling
• Building cyclic master surgery schedules with leveled resulting bed occupancy
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• The art and theory of dynamic programming
• Scheduling medical residents' training at university hospitals
• Scheduling trainees at a hospital department using a branch-and-price approach
• On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem

This page was built for publication: A decomposition-based heuristic procedure for the medical student scheduling problem