A Different Approach to Nurse Scheduling Problem: Lagrangian Relaxation

Yücel Öztürkoğlu

Alphanumeric Journal, 2020, vol. 8, issue 2, 237-248

Abstract: The problem of nurse scheduling is categorized in an 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.

Keywords: Lagrangian Relaxation; Mathematical Model; Nurse; Scheduling (search for similar items in EconPapers)
JEL-codes: C46 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.alphanumericjournal.com/media/Issue/vo ... rangian-_1V7tJmV.pdf (application/pdf)
https://alphanumericjournal.com/article/a-differen ... agrangian-relaxation (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:anm:alpnmr:v:8:y:2020:i:2:p:237-248

DOI: 10.17093/alphanumeric.659121

Access Statistics for this article

More articles in Alphanumeric Journal from Bahadir Fatih Yildirim
Bibliographic data for series maintained by Bahadir Fatih Yildirim ().