1 Lafayette Crisis Center Scheduling System Project # 3 WISE

2 Introduction  Jason Lewicki Mathematics and Computer Science,  Mark Merek Economics,  Myungho Sim Mathematics and Computer Science,  Jacob Venable Computer Science, LCC scheduling system WISE

3 Community Need  Lafayette Crisis Center’s Need This project began in August, Goal: To replace manual scheduling by Michael Silanskis LCC scheduling system WISE

4 Goals of the project  We hope to use the scheduling software to: Create accurate and reliable results that will satisfy volunteers Easily identify shifts that do not have volunteers Easily rearrange schedule if conflict arises  Aspects of the community need that the project will not address Finding volunteers to fill all of the time slots LCC scheduling system WISE

5 Success Criteria  Overall objective More efficient scheduling system that will save time and effort The schedule will accurately fit volunteers’ preferences Customizable schedule after program has ended Allow administrator to have control over final schedule LCC scheduling system WISE

6 Project Specifications Requirement:Specification: Workers have preferences for which shifts of the week they work (eg. Monday night vs. Tuesday morning) An input method allows entry of shift preferences. Some workers can not work on particular days, and should not be scheduled for them. An input method allows entry of shifts for which certain workers will not be assigned. Allow administrator the ability to assign shifts to specific volunteers An input method allows entry shifts for which certain workers are assigned Allow administrator the ability to modify the schedule after it has been created The method of displaying the calendar allows modification of the schedule Allow ability to schedule multiple volunteers per shift The scheduling algorithm will assign multiple people per shift to ensure that volunteers are assigned around their requested number of shifts LCC scheduling system WISE

Operational Overview 7 LCC scheduling system

8

9

10 Algorithms  Previous Algorithms Recursive Replacement Algorithm Prioritized Linear Algorithm  New Algorithm Customized algorithm based on the “Nurse Scheduling Problem”  Solves the problem of determining a work schedule that is both reasonable (fair) and efficient LCC scheduling system WISE

11 Customized NSP  Handles multiple shifts (5)  Constraints can be implemented hard constraints: constraint fails then the entire schedule is invalid. (Max shifts) soft constraints: is desirable that these constraints are met but not meeting them doesn't make the schedule invalid. (prioritized shifts and empty shifts)  Recursively assigns workers Attempts to get every worker to their preferred number of shifts per month LCC scheduling system WISE

12 Constraints  Makes assignments based on specific priorities First, assign one shift to each worker Then, try to fill remaining shifts  Give priority for additional shifts to workers that still need to complete training  Then assign additional shifts based on the number each worker has requested  Any additional shifts or time slots are then assigned to the workers that prefer them most LCC scheduling system WISE

Testing Strategy  Used data file from the project partner Create several different permutations of schedules Compare different cases Tweak constraints Re-test 13 LCC scheduling system

Semester Goals  During This Semester Comment source code and organize documentation to ease future development. Modified Algorithm to meet more detailed specifications Tested algorithms and user interface Modify GUI Deliver the project 14 LCC scheduling system

15 Discussion of Future Plans  Follow up with project partner  Make usability improvements based on project partner feedback  Talk with project partner about the possibility of moving to a web based version LCC scheduling system WISE

16 Demo WISE LCC scheduling system

17 Questions? WISE LCC scheduling system