loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ademir Aparecido Constantino 1 ; Everton Tozzo 1 ; Rodrigo Lankaites Pinheiro 2 ; Dario Landa-Silva 2 and Wesley Romão 1

Affiliations: 1 State University of Maringá, Brazil ; 2 University of Nottingham, United Kingdom

Keyword(s): Nurse Scheduling Problem, Bottleneck Assignment Problem, Variable Neighbourhood Search, Combinatorial Optimisation.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence and Decision Support Systems ; Enterprise Information Systems ; Operational Research ; Problem Solving ; Scheduling and Planning

Abstract: The nurse scheduling problem (NSP) is a combinatorial optimisation problem widely tackled in the literature. Recently, a new variant of this problem was proposed, called nurse scheduling problem with balanced preference satisfaction (NSPBPS). This paper further investigates this variant of the NSP as we propose a new algorithm to solve the problem and obtain a better balance of overall preference satisfaction. Initiall, the algorithm converts the problem to a bottleneck assignment problem and solves it to generate an initial feasible solution for the NSPBPS. Posteriorly, the algorithm applies the Variable Neighbourhood Search (VNS) metaheuristic using two sets of search neighbourhoods in order to improve the initial solution. We empirically assess the performance of the algorithm using the NSPLib benchmark instances and we compare our results to other results found in the literature. The proposed VNS algorithm exhibits good performance by achieving solutions that are fairer (in terms of preference satisfaction) for the majority of the scenarios. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.221.85.33

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Aparecido Constantino, A.; Tozzo, E.; Lankaites Pinheiro, R.; Landa-Silva, D. and Romão, W. (2015). A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction. In Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 2: ICEIS; ISBN 978-989-758-096-3; ISSN 2184-4992, SciTePress, pages 462-470. DOI: 10.5220/0005364404620470

@conference{iceis15,
author={Ademir {Aparecido Constantino}. and Everton Tozzo. and Rodrigo {Lankaites Pinheiro}. and Dario Landa{-}Silva. and Wesley Romão.},
title={A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction},
booktitle={Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 2: ICEIS},
year={2015},
pages={462-470},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005364404620470},
isbn={978-989-758-096-3},
issn={2184-4992},
}

TY - CONF

JO - Proceedings of the 17th International Conference on Enterprise Information Systems - Volume 2: ICEIS
TI - A Variable Neighbourhood Search for Nurse Scheduling with Balanced Preference Satisfaction
SN - 978-989-758-096-3
IS - 2184-4992
AU - Aparecido Constantino, A.
AU - Tozzo, E.
AU - Lankaites Pinheiro, R.
AU - Landa-Silva, D.
AU - Romão, W.
PY - 2015
SP - 462
EP - 470
DO - 10.5220/0005364404620470
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic