A decomposition-based heuristic procedure for the Medical Student Scheduling problem.
Babak AkbarzadehBroos MaenhoutPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- scheduling problem
- tabu search
- job shop scheduling problem
- search procedure
- list scheduling
- single machine
- multi depot
- unrelated parallel machines
- flowshop
- randomly generated test problems
- quay crane
- simulated annealing
- permutation flowshop
- learning styles
- medical data
- dynamic programming
- strongly np hard
- precedence constraints
- medical students
- medical domain
- np hard
- search algorithm
- student learning
- intelligent tutoring systems
- processing times
- medical diagnosis
- special case
- high school students
- learning environment
- metaheuristic
- medical experts
- setup times
- optimal solution
- mixed integer program
- decomposition algorithm
- tutoring system
- feasible solution
- sequence dependent setup times
- decomposition method
- branch and bound procedure
- parallel machines
- learning process
- combinatorial optimization