Abstract
The objective of nursing scheduling problem (NSP) is finding a shift schedule for nurses. According to the nurse’s preference, the working constraints in the hospital and many possible combinations, the NSP become a complex problem and difficult to solve. The goal of NSP is to find a shift schedule in an efficiently way is very important when the problem become more complex. In this paper, we propose that the NSP can be converted into the boolean satisfiability problem (SAT). A shift schedule can be obtained by integer linear programming (ILP) method where satisfy the nurse’s preference and the working constraints. We show that an example is solved by SAT approach efficiently.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aickelin U, Dowsland KA (2004) An indirect genetic algorithm for a nurse-scheduling problem. Comput Oper Res 31(5):761–778
Aickelin U, Li J (2007) An estimation of distribution algorithm for nurse scheduling. Ann Oper Res 155(1):289–309
Aloul F, Ramani A, Markov I, Sakallah K (2002) Generic ILP versus specialized 0-1 ILP: an update. In: IEEE/ACM international conference on computer aided design (ICCAD 2002), pp 450–457
Aloul FA, Ramani A, Sakallah KA, Markov IL (2007) Solution and optimization of systems of pseudo-boolean constraints. IEEE Trans Comput 56(10):1415–1424
Azaiez M, Sharif SA (2005) A 0-1 goal programming model for nurse scheduling. Comput Oper Res 32(3):491–507
Belin J (2007) Exact and heuristic methodologies for scheduling in hospitals: problems, formulations and algorithms. 4OR 5(2):157–160
Brucker P, Qu R, Burke E (2011) Personnel scheduling: models and complexity. Eur J Oper Res 210(3):467–473
Chai D, Kuehlmann A (2005) A fast pseudo-boolean constraint solver. IEEE Trans Comput Aided Des Integr Circuits Syst 24(3):305–317
Kundu S, Acharyya S (2008) A sat approach for solving the nurse scheduling problem. In: TENCON 2008—2008 IEEE region 10 conference, pp 1–6
Li J, Kwan RS (2003) A fuzzy genetic algorithm for driver scheduling. Eur J Oper Res 147(2):334–344 (Elsevier Science B.V.)
Ozkarahan I (1989) A flexible nurse scheduling support system. Comput Methods Programs Biomed 30(23):145–153
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Wu, TS., Ho, CL., Chen, CL. (2015). A SAT Approach to Nursing Scheduling Problem. In: Park, J., Pan, Y., Kim, C., Yang, Y. (eds) Future Information Technology - II. Lecture Notes in Electrical Engineering, vol 329. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-9558-6_5
Download citation
DOI: https://doi.org/10.1007/978-94-017-9558-6_5
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-017-9557-9
Online ISBN: 978-94-017-9558-6
eBook Packages: EngineeringEngineering (R0)