Staff Scheduling Problem
Abstract
This paper will take a look at a classic staff scheduling problem which analyzes three Blenz Coffee shops and their employees. Ultimately the goal is to minimize cost of staff, maximize the staff’s satisfaction and minimize the scheduling gaps. The stores were chosen to be local shops that could possibly involve a large number of SFU student employees. Our model was entered into Microsoft Excel’s Solver as a linear program.
References
Blenz The Canadian Coffee Company Ltd. - Locations (2012) Retrieved from website: http://blenz.com/locations/
Blenz The Canadian Coffee Company Ltd. - About (2012) Retrieved from website: http://blenz.com/about/
Published
Section
License
The images, figures, and tables in the Simon Fraser University Operations Research Undergraduate Journal are not necessary those of the Simon Fraser Student Society, Operations Research Union, or the Department of Mathematics at Simon Fraser University or their respective Directors and Executives. The copyright of all contributions remains with their authors. By submitting to Analytics Now, authors acknowledge that submissions reflect original work, and that proper credit has been given to outside sources.
All material herein is Copyright 2012 by the respective authors. Permission to reprint or reproduce the material contained herein is prohibited without express written permission from the author and publisher with the exception of dissemination for non-profit, educational, academic, or informative purposes.
