 |
|
|
|
| HAL : hal-00310147, version 1 |
| arXiv : 0808.1246 |
| Fiche détaillée |  Récupérer au format |
|
|
| ARA Congress, Boston : United States (2008) |
|
|
|
|
| Minimum Dissatisfaction Personnel Scheduling |
|
|
| Mugurel Ionut Andreica 1Romulus Andreica 2 |
|
|
| (22/07/2008) |
|
|
|
| In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a sequence of activities. We are interested in schedules which minimize the overall dissatisfaction, where each employee's dissatisfaction is modeled as a time-dependent linear function. For the two situations considered we provide a detailed mathematical analysis, as well as efficient algorithms for determining optimal schedules. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Parallel and Distributed Systems Laboratory [Bucarest] |
|
|
|
University Politehnica of Bucarest |
|
|
| 2 : | Management and Finances Center |
|
|
|
Commercial Academy Satu Mare |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Algorithme et structure de données Informatique/Recherche opérationnelle |
|
|
| personnel scheduling – minimum dissatisfaction – time-dependent linear function – greedy algorithm – dynamic programming |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00310147, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00310147 | |
| oai:hal.archives-ouvertes.fr:hal-00310147 | |
| Contributeur : Mugurel Ionut Andreica | |
| Soumis le : Jeudi 7 Août 2008, 23:01:56 | |
| Dernière modification le : Vendredi 8 Août 2008, 19:15:41 | |
