Un sistema per la pianificazione dei turni del personale di un'azienda mediante tecniche di ricerca locale
Autore
Marco Chiarandini - Università degli Studi di Udine - [1998-99]
Documenti
Abstract
Employee timetabling is the problem of assigning employees to activities and locations in a set of shifts, during a fixed period of time (in our case one week). The assignment we want to obtain must respect some hard constraints, the most of them take origin from Works Contracts, and satisfy at best the requests of fairness. For that goal we consider the flexibility of the employee workload and the distribution of undesired shifts (night shifts, weekend…).
To solve the problem it has been proposed a Local Search algorithm called Tabu Search and it has been implemented. It has been developed also an experimental analysis that showed as Tabu Search performances are better than the ones obtained with others Local Search techniques as Hill-Climbing and Simulated Annealing. Finally, experiments have been produced for the parameters settings and some features have been added to the algorithm in order to explore the possibility of improvements in results.
To solve the problem it has been proposed a Local Search algorithm called Tabu Search and it has been implemented. It has been developed also an experimental analysis that showed as Tabu Search performances are better than the ones obtained with others Local Search techniques as Hill-Climbing and Simulated Annealing. Finally, experiments have been produced for the parameters settings and some features have been added to the algorithm in order to explore the possibility of improvements in results.
Questa tesi è correlata alla categoria
segnala questa pagina ::.