Near-optimal solution to an employee assignment problem with seniority

Near-optimal solution to an employee assignment problem with seniority

0.00 Avg rating0 Votes
Article ID: iaor20108920
Volume: 181
Issue: 1
Start Page Number: 539
End Page Number: 557
Publication Date: Dec 2010
Journal: Annals of Operations Research
Authors:
Keywords: personnel & manpower planning
Abstract:

I consider the problem of weekly assignment of shifts to operators. The shifts are to be assigned by seniority (or by any other employee hierarchy), but every employee is guaranteed to receive at least one shift. I propose a practical solution method to this problem that guarantees a feasible solution. As an application, the solution method is applied to the data provided in the literature on weekly shift assignment of the operators of the New Brunswick Telephone company. The solution method is also applied to 100 randomly generated problems. The results show that the solution method produces close-to-optimal solutions.

Reviews

Required fields are marked *. Your email address will not be published.