A Different Approach To Nurse Scheduling Problem: Lagrangian Relaxation

dc.contributor.author	Ozturkoglu, Y.
dc.contributor.author	Yalcin Tasmektepligil, M.
dc.date.accessioned	2021-12-08T13:45:34Z
dc.date.available	2021-12-08T13:45:34Z
dc.date.issued	2020
dc.identifier.issn	2148-2225
dc.identifier.uri	https://app.trdizin.gov.tr/makale/TkRFMk56STRPQT09/a-different-approach-to-nurse-scheduling-problem-lagrangian-relaxation
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/17725
dc.description.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
dc.language.iso	English
dc.title	A Different Approach To Nurse Scheduling Problem: Lagrangian Relaxation
dc.relation.journal	Alphanumeric Journal
dc.identifier.doi	10.17093/alphanumeric.659121
dc.relation.volume	8
dc.relation.issue	2
dc.identifier.issue	2
dc.identifier.startpage	237
dc.identifier.endpage	245
dc.identifier.volume	8

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.