A Different Approach To Nurse Scheduling Problem: Lagrangian Relaxation

Thumbnail
Date
2020
Author
Ozturkoglu, Y.
Yalcin Tasmektepligil, M.
Metadata
Show full item record
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 become
URI
https://app.trdizin.gov.tr/makale/TkRFMk56STRPQT09/a-different-approach-to-nurse-scheduling-problem-lagrangian-relaxation
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/17725
Collections