Minimum Dissatisfaction Personnel Scheduling
Data Structures and Algorithms
2013-01-22 v2
Abstract
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.
Keywords
Cite
@article{arxiv.0808.1246,
title = {Minimum Dissatisfaction Personnel Scheduling},
author = {Mugurel Ionut Andreica and Romulus Andreica and Angela Andreica},
journal= {arXiv preprint arXiv:0808.1246},
year = {2013}
}
Comments
Some of the algorithmic techniques presented in this paper were later used by the first author for developing solutions to several algorithmic contest tasks (see the attached zip archive for some examples)