Logo do repositório
 

A heuristic algorithm based on multi-assignment procedures for nurse scheduling

dc.contributor.authorConstantino, Ademir Aparecido
dc.contributor.authorLanda-Silva, Dario
dc.contributor.authorMelo, Everton Luiz de
dc.contributor.authorMendonça, Candido Ferreira Xavier de [UNESP]
dc.contributor.authorRizzato, Douglas Baroni
dc.contributor.authorRomão, Wesley
dc.contributor.institutionUniversidade Estadual de Maringá (UEM)
dc.contributor.institutionUniversity of Nottingham
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:28:50Z
dc.date.available2014-05-27T11:28:50Z
dc.date.issued2013-04-03
dc.description.abstractThis paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction of nurses' preferences and minimize the violation of soft constraints. This paper presents a new deterministic heuristic algorithm, called MAPA (multi-assignment problem-based algorithm), which is based on successive resolutions of the assignment problem. The algorithm has two phases: a constructive phase and an improvement phase. The constructive phase builds a full schedule by solving successive assignment problems, one for each day in the planning period. The improvement phase uses a couple of procedures that re-solve assignment problems to produce a better schedule. Given the deterministic nature of this algorithm, the same schedule is obtained each time that the algorithm is applied to the same problem instance. The performance of MAPA is benchmarked against published results for almost 250,000 instances from the NSPLib dataset. In most cases, particularly on large instances of the problem, the results produced by MAPA are better when compared to best-known solutions from the literature. The experiments reported here also show that the MAPA algorithm finds more feasible solutions compared with other algorithms in the literature, which suggest that this proposed approach is effective and robust. © 2013 Springer Science+Business Media New York.en
dc.description.affiliationDepartment of Computer Science State University of Maringá, Av. Colombo, 5790, Maringá, CEP 87020-900
dc.description.affiliationSchool of Computer Science University of Nottingham, Nottingham, NG8 1BB
dc.description.affiliationSchool of Arts, Science and Humanities State University of São Paulo, São Paulo, CEP 03828-000
dc.format.extent1-19
dc.identifierhttp://dx.doi.org/10.1007/s10479-013-1357-9
dc.identifier.citationAnnals of Operations Research, p. 1-19.
dc.identifier.doi10.1007/s10479-013-1357-9
dc.identifier.issn0254-5330
dc.identifier.issn1572-9338
dc.identifier.scopus2-s2.0-84904167882
dc.identifier.urihttp://hdl.handle.net/11449/75055
dc.identifier.wosWOS:000339330000011
dc.language.isoeng
dc.relation.ispartofAnnals of Operations Research
dc.relation.ispartofjcr1.864
dc.relation.ispartofsjr0,943
dc.relation.ispartofsjr0,943
dc.rights.accessRightsAcesso restrito
dc.sourceScopus
dc.subjectAssignment problem
dc.subjectCombinatorial optimization
dc.subjectHeuristic algorithms
dc.subjectNurse scheduling problem
dc.titleA heuristic algorithm based on multi-assignment procedures for nurse schedulingen
dc.typeArtigo
dcterms.licensehttp://www.springer.com/open+access/authors+rights
dspace.entity.typePublication

Arquivos

Coleções