The rostering problem consists in finding an optimal assignment of shifts to workers in a given time horizon. When the total workload should be evenly distributed, we have a balanced rostering problem. We consider a practical application to the junk removal company in Crema, Italy. In this case, predefined daily shifts must be assigned to the drivers in a fair way. However, the drivers have limited skills, that is they are qualified to perform only a small subset of the possible shifts. Here, we propose three alternative formulations for the problem, and corresponding algorithms to solve them.
Models and algorithms for balanced rostering with limited skills / R. Aringhieri, A. Ceselli, R. Cordone. - Crema : Università degli studi di Milano, Polo Didattico e di Ricerca di Crema, 2005 Mar.
Models and algorithms for balanced rostering with limited skills
R. AringhieriPrimo
;A. CeselliSecondo
;R. CordoneUltimo
2005
Abstract
The rostering problem consists in finding an optimal assignment of shifts to workers in a given time horizon. When the total workload should be evenly distributed, we have a balanced rostering problem. We consider a practical application to the junk removal company in Crema, Italy. In this case, predefined daily shifts must be assigned to the drivers in a fair way. However, the drivers have limited skills, that is they are qualified to perform only a small subset of the possible shifts. Here, we propose three alternative formulations for the problem, and corresponding algorithms to solve them.File | Dimensione | Formato | |
---|---|---|---|
MlMcBA.pdf
accesso aperto
Tipologia:
Pre-print (manoscritto inviato all'editore)
Dimensione
547.57 kB
Formato
Adobe PDF
|
547.57 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.