A two-step multi-objective mathematical model for nurse scheduling problem considering nurse preferences and consecutive shifts Online publication date: Fri, 24-Mar-2017
by Mohammad Mahdi Nasiri; Meysam Rahvar
International Journal of Services and Operations Management (IJSOM), Vol. 27, No. 1, 2017
Abstract: The nurse scheduling problem (NSP) has received special attention during the recent decades. The difficulty of generating tables manually alongside the shortage of nurses and prohibition of outsourcing nurses has led to hectic schedules in which assigning three consecutive shifts (i.e., 24 hour shift) to a nurse could be seen. Furthermore, nurses' preferences are usually neglected because the concentration is on meeting the nursing requirements. In this paper, we propose a multi-objective mathematical model in which we tackle the main inefficiency of the system (i.e., three consecutive shifts). We also try to maximise nurses' preferences. In addition to the presentation of a new mathematical model, we use the novel method of augmented epsilon constraint to generate several tables. To deal with the complexity of NSP, we use a two-step approach. We find the efficient solutions over the Pareto set, among which we select the best table.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook