Minimum Dissatisfaction Personnel Scheduling

Details Minimum Dissatisfaction Personnel Scheduling Minimum Dissatisfaction Personnel Scheduling

2008-08-08

arxiv.org/abs/0808.1246v1

Computer Science

Data Structures and Algorithms

ARA Congress, Boston : \'Etats-Unis d'Am\'erique (2008)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Minimum Dissatisfaction Personnel Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimum Dissatisfaction Personnel Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum Dissatisfaction Personnel Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29892