Riassunto analitico
The scheduling problem in an emergency department environment is an unexplored research field, in this area there are a lot of mathematical problems but in this paper we will focus on the patients scheduling to doctors. The premise behind this research is to implement and compare different approaches to the problem in order to find the best solution. In this work we will analyse a mathematical model and a series of heuristics and at the end we will compare which approach is the best in terms of objective function and running time. The Heuristic methods are a static case, where all the information are known in advance, a dynamic case based on a queue policy and a dynamic phone call based on the dynamic case with a further policy based on a phone call useful to know some information in advance. All the heuristics present a variable neighbourhood search useful to find an optimal solution; this VNS has six different movements based on a series of swaps. In the comparison section all the results are compared in terms of objective function and running time. From the analysis it emerges that the static case is the best in terms of objective function, the dynamic phone call is similar to the static case but it has a better running time. The dynamic case is the worst in terms of objective function.
|
