170 likes | 275 Views
Lafayette Crisis Center Scheduling System. Project # 3. WISE. Introduction. LCC scheduling system. Jason Lewicki Mathematics and Computer Science, jlewicki@purdue.edu Mark Merek Economics, mmerek@purdue.edu Myungho Sim Mathematics and Computer Science, laschmid@purdue.edu
E N D
Lafayette Crisis Center Scheduling System Project # 3 WISE
Introduction LCC scheduling system • Jason Lewicki Mathematics and Computer Science, jlewicki@purdue.edu • Mark Merek Economics, mmerek@purdue.edu • MyunghoSim Mathematics and Computer Science, laschmid@purdue.edu • Jacob Venable Computer Science, jvenabl@purdue.edu WISE
Community Need LCC scheduling system • Lafayette Crisis Center’s Need • This project began in August, 2009. • Goal: To replace manual scheduling by Michael Silanskis WISE
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 4 WISE
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 5 WISE
Project Specifications LCC scheduling system 6 WISE
Operational Overview LCC scheduling system
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 10 WISE
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 11 WISE
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 12 WISE
Testing Strategy LCC scheduling system • Used data file from the project partner • Create several different permutations of schedules • Compare different cases • Tweak constraints • Re-test
Semester Goals LCC scheduling system • 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
Discussion of Future Plans LCC scheduling system • 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 WISE
Demo LCC scheduling system WISE
Questions? LCC scheduling system WISE