International Journal of Soft Computing
ISSN: OnlineISSN: Print 1816-9503
138
Views
0
Downloads
Abstract
Scheduling service employees at any campus dining center is not an easy task for a manager because most positions at a campus dining center are hourly-paid positions, leading to a high employee turnover and many uncertainties. In such a circumstance, a manager has a hard time to organize and project employees’ work schedules. The Johnson Commons (JC) dinning center at the University of Mississippi operated by Aramark also has similar difficulties in scheduling its hourly employees. After discussing with a manager and investigating the current scheduling system at the JC, it is found that the JC has one type of scheduling problem called the Multi-time Multi-Period Scheduling Problem. Therefore, the main purpose of this study is to find the optimal solution for the scheduling problem at the JC dining center. The result shows that with the optimal solution, the JC can save a total of $50,648.00 hourly employee labor expenses per year.
How to cite this article:
Sang Hyun Kim . Analysis of Real World Personnel Scheduling Problem: An Experimental Study of Lp-Based Algorithm for Multi-Time Multi-period Scheduling Problem for Hourly Employees.
DOI: https://doi.org/10.36478/ijscomp.2006.143.148
URL: https://www.makhillpublications.co/view-article/1816-9503/ijscomp.2006.143.148