Job Rotation Using the Multi-Period Assignment Problem
- UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
- Joyendu Bhadury, Professor, Information Systems and Supply Chain Management (Creator)
- Institution
- The University of North Carolina at Greensboro (UNCG )
- Web Site: http://library.uncg.edu/
Abstract: This paper addresses the current gap in the literature on quantitative tools that enable a manager to build schedules which incorporate job rotation by employees. This is done within the framework of the well-known Assignment Model recast in a multi-period setting. In addition to the usual objective of minimizing the total cost of assignment, we also consider a requirement to minimize the boredom felt by employees due to continued repetition of the same task over consecutive periods. Depending on alternative definitions of 'boredom', different bi-objective optimization models are formulated and solved using polynomial time algorithms or simple heuristics. In the case of heuristics, their implementation is discussed and computational experience is also reported.
Job Rotation Using the Multi-Period Assignment Problem
PDF (Portable Document Format)
324 KB
Created on 1/1/2006
Views: 8058
Additional Information
- Publication
- International Journal of Production Research, Vol. 44, No. 20, 4431-4444 (Oct 2006)
- Language: English
- Date: 2006
- Keywords
- Assignment model, Repetitive tasks, Job rotation, Cyclic scheduling