Views
40
Downloands
15
The problem of nurse scheduling is categorized in a Np-Hard complexity as it is inherently composed of many limitations and assumptions. As the number of nurses and the number of days increase, finding the solution of the problem becomes quite difficult. Therefore, this paper propose both an integer-programming model and a Lagrangian relaxation approach for solving nurse-scheduling problem. Numerical results show that while the developed mathematical model works on small-scale problems, Lagrangian relaxation method finds better results for large scale scheduling problem with much smaller duality gap in a reasonable computational time.
Field : Sosyal, Beşeri ve İdari Bilimler
Journal Type : Uluslararası
Article Detail 
Similar Articles
Download PDF
Journal Information
Listen Paper
Cite
Print This Page
Share
Mendeley
