NURSE SCHEDULING PROBLEM
AbstractIn this paper, what i have been discussed, is analyzing penalties and cost shifts based on several elements for nurse scheduling problem (NSP). NSP’s issue is to assign nurses to different tasks based on constraints. The problem is known to be NP-hard, in other words it does not have a solution or needs years to be solved. In this work we try to solve the problem by satisfying the constraints set, and we also include the nurse’s preference and try to balance the difficulty level of all the involved nurses. We also analyze the complexity of the problem as a function of parameters such as number of nurses, number of shifts, and optimality of the function. According to the importance in practice, many scientists have developed NSP problems in a satisfactory time limit.
Download data is not yet available.
How to Cite
Duka, E. (2015). NURSE SCHEDULING PROBLEM. European Scientific Journal, ESJ, 11(10). Retrieved from http://eujournal.org/index.php/esj/article/view/6481