Optimization Online


Minimum Dissatisfaction Personnel Scheduling

Mugurel Ionut Andreica(mugurelionut***at***gmail.com)
Romulus Andreica(academiacomerciala***at***yahoo.com)
Angela Andreica(academiacomerciala***at***yahoo.com)

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: personnel scheduling, minimum dissatisfaction, time-dependent linear function, greedy algorithm, dynamic programming

Category 1: Other Topics (Dynamic Programming )

Category 2: Applications -- OR and Management Sciences (Scheduling )

Category 3: Combinatorial Optimization (Other )

Citation: Proceedings of the 32nd Congress of the American Romanian Academy of Arts and Sciences (ARA Congress), pp. 459-463, Boston, USA, 2008

Download: [PDF]

Entry Submitted: 08/07/2008
Entry Accepted: 08/07/2008
Entry Last Modified: 08/07/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society