Constructing modified variable neighborhood search approaches to solve a nurse scheduling problem
Year of publication: |
2024
|
---|---|
Authors: | Chen, Ping-Shun ; Huang, Wen-Tso ; Chen, Gary Yu-Hsin ; Dang, Jr-Fong ; Yeh, Erh-Chun |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 62.2024, 19, p. 7186-7204
|
Subject: | greedy-neighborhood-swapping mechanism | local search | Medical staff scheduling | neighbourhood structure | variable neighborhood search | Scheduling-Verfahren | Scheduling problem | Nachbarschaft | Neighbourhood | Heuristik | Heuristics | Pflegeberufe | Nursing profession | Personaleinsatzplanung | Crew scheduling | Wohnstandort | Residential location | Theorie | Theory |
-
A time predefined variable depth search for nurse rostering
Burke, Edmund K., (2013)
-
MaxMinMin p-dispersion problem : a variable neighborhood search approach
Saboonchi, Behnaz, (2014)
-
Variable neighborhood search : basics and variants
Hansen, Pierre, (2017)
- More ...
-
New variable-length data compression scheme for solution representation of meta-heuristics
Chen, Gary Yu-Hsin, (2021)
-
An enhanced model for SDBR in a random reentrant flow shop environment
Chang, Yung-chia, (2014)
-
Dang, Jr-Fong, (2013)
- More ...