2021
DOI: 10.1016/j.cor.2021.105209
|View full text |Cite
|
Sign up to set email alerts
|

An exact branch-and-price approach for the medical student scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 27 publications
0
7
0
Order By: Relevance
“…Method Uncertain/elective [56] Programming in a stochastic manner Uncertainty [46] Programs that use integers - [57] Linear stochastic program Uncertainty [58] Exact solution algorithm based on branch and price [59] Algorithm of branching and bounding - [60] Local search and heuristics Elective [61] Dynamic stochastic programming Elective [62] Light robustness approach and mixed-integer linear formulation Elective [63] Model of integer linear programming Elective [64] Model of stochastic dynamic programming Elective [65] Bi-criteria heuristics discrete-event simulation model heuristics GA Elective [66] Binary programming, local search, integer programming Elective/emergency [67] Discrete-event model Uncertain [68] Discrete event dynamic system Elective…”
Section: Referencesmentioning
confidence: 99%
“…Method Uncertain/elective [56] Programming in a stochastic manner Uncertainty [46] Programs that use integers - [57] Linear stochastic program Uncertainty [58] Exact solution algorithm based on branch and price [59] Algorithm of branching and bounding - [60] Local search and heuristics Elective [61] Dynamic stochastic programming Elective [62] Light robustness approach and mixed-integer linear formulation Elective [63] Model of integer linear programming Elective [64] Model of stochastic dynamic programming Elective [65] Bi-criteria heuristics discrete-event simulation model heuristics GA Elective [66] Binary programming, local search, integer programming Elective/emergency [67] Discrete-event model Uncertain [68] Discrete event dynamic system Elective…”
Section: Referencesmentioning
confidence: 99%
“…The latter tries to find for a single internship a better student allocation via swapping. Apart from greedy heuristics, there are a few studies that tried to reformulate the original problem into a set-partitioning problem using Dantzig-Wolfe decomposition and used both a heuristic and an exact branch-and-price procedure to solve instances of a significantly smaller size (e.g., Akbarzadeh and Maenhout 2021b).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Before implementation of the scheduling module, a mixed-integer programming model was built to obtain a thorough understanding of the problem and prototype algorithms were developed, i.e., a mathematical programming approach using the commercial optimisation package CPLEX, an exact state-of-the-art methodology (Akbarzadeh and Maenhout 2021b), and an advanced heuristic (Akbarzadeh and Maenhout 2021a). In this section, we review challenges faced during implementation, relative to composition of a well-performing methodology, representation of roster quality and analysis of schedule and minimal data input requirements.…”
Section: Challengesmentioning
confidence: 99%
See 1 more Smart Citation
“…In their model, they also took into account nurses' skills and patient preferences. Akbarzadeh and Manhut [34] examined the scheduling problem for medical students, in which students are assigned to multiple disciplines and hospitals in order to receive an adequate education. The proposed model aims to maximize students' preferences for the disciplines and hospitals they wish to study while also ensuring academic equality among students.…”
Section: Literature Reviewmentioning
confidence: 99%