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.
|Konular||Yöneylem, Araştırma ve Yönetim Bilimi|
|Yayımlanma Tarihi||31 Aralık 2020|
|Başvuru Tarihi||16 Aralık 2019|
|Kabul Tarihi||24 Eylül 2020|
|Yayınlandığı Sayı||Yıl 2020, Cilt 8, Sayı 2|
Alphanumeric Journal is hosted on DergiPark, a web based online submission and peer review system powered by TUBİTAK ULAKBIM.