Print Email Facebook Twitter The Systematic Search With Assignment Problem Solving (SSWAPS) Algorithm Title The Systematic Search With Assignment Problem Solving (SSWAPS) Algorithm: a New Solution Method for the Nurse ReRostering Problem Author van den Dool, Vera (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Delft Institute of Applied Mathematics) Contributor van Essen, J.T. (mentor) Degree granting institution Delft University of Technology Programme Applied Mathematics | Optimization Date 2017-08-31 Abstract Hospitals need to be staffed around the clock to ensure satisfactory care for all patients. To this end, a set of shifts is defined which are assigned to nurses in a work schedule. The nurse rerostering problem (NRRP) occurs when due to unforeseen circumstances some shifts become unassigned: one or more nurses are no longer able to work some of the shifts assigned to them. Changes must then be made to the existing schedule to ensure that the shift occupancy demand is once again satisfied. The number of changes should be minimized to disrupt nurses’ personal plans as little as possible. In this paper, a heuristic solution method (SSWAPS) is proposed for the NRRP. The heuristic systematically searches the solution space and estimates the solution quality using the assignment problem. Subject Optimization To reference this document use: http://resolver.tudelft.nl/uuid:5b0b6016-b8d2-42d3-a9ba-6f18e9c63bca Embargo date 2017-09-30 Part of collection Student theses Document type master thesis Rights © 2017 Vera van den Dool Files PDF finalreport.pdf 559.47 KB Close viewer /islandora/object/uuid:5b0b6016-b8d2-42d3-a9ba-6f18e9c63bca/datastream/OBJ/view