Solving the medical student scheduling problem using simulated annealing

DOI10.1007/S10951-024-00806-ZMaRDI QIDQ6956299zbMATH OpenFDO

Authors Eugenia Zanazzo, Sara Ceschia, Agostino Dovier, Andrea Schaerf

Publication date 18 July 2025

Published in Journal of Scheduling (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10951-024-00806-Z

zbMATH Keywords

local searchmedical student schedulingsimulated annealing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A constraint programming-based solution approach for medical resident scheduling problems
• A decomposition-based heuristic procedure for the medical student scheduling problem
• A robust framework for task-related resident scheduling
• An exact branch-and-price approach for the medical student scheduling problem
• Complexity results for the basic residency scheduling problem
• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
• Optimization by GRASP. Greedy randomized adaptive search procedures
• Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system
• Scheduling medical residents' training at university hospitals
• The price of fairness
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling

This page was built for publication: Solving the medical student scheduling problem using simulated annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956299)