Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur Burke, E. K.
Documents disponibles écrits par cet auteur
Affiner la rechercheProgress control in iterated local search for nurse rostering / Burke, E. K. in Journal of the operational research society (JORS), Vol. 62 N° 2 Special issue (Fevrier 2011)
[article]
in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 360–367
Titre : Progress control in iterated local search for nurse rostering Type de document : texte imprimé Auteurs : Burke, E. K., Auteur ; Curtois, T., Auteur ; van Draat, L. F., Auteur Année de publication : 2011 Article en page(s) : pp. 360–367 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Local search Iterated local search Nurse rostering Index. décimale : 001.424 Résumé : This paper describes an approach in which a local search technique is alternated with a process which ‘jumps’ to another point in the search space. After each ‘jump’ a (time-intensive) local search is used to obtain a new local optimum. The focus of the paper is in monitoring the progress of this technique on a set of real world nurse rostering problems. We propose a model for estimating the quality of this new local optimum. We can then decide whether to end the local search based on the predicted quality. The fact that we avoid searching these bad neighbourhoods enables us to reach better solutions in the same amount of time. We evaluate the approach on five highly constrained problems in nurse rostering. These problems represent complex and challenging real world rostering situations and the approach described here has been developed during a commercial implementation project by ORTEC bv. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors201086a.html [article] Progress control in iterated local search for nurse rostering [texte imprimé] / Burke, E. K., Auteur ; Curtois, T., Auteur ; van Draat, L. F., Auteur . - 2011 . - pp. 360–367.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 62 N° 2 Special issue (Fevrier 2011) . - pp. 360–367
Mots-clés : Local search Iterated local search Nurse rostering Index. décimale : 001.424 Résumé : This paper describes an approach in which a local search technique is alternated with a process which ‘jumps’ to another point in the search space. After each ‘jump’ a (time-intensive) local search is used to obtain a new local optimum. The focus of the paper is in monitoring the progress of this technique on a set of real world nurse rostering problems. We propose a model for estimating the quality of this new local optimum. We can then decide whether to end the local search based on the predicted quality. The fact that we avoid searching these bad neighbourhoods enables us to reach better solutions in the same amount of time. We evaluate the approach on five highly constrained problems in nurse rostering. These problems represent complex and challenging real world rostering situations and the approach described here has been developed during a commercial implementation project by ORTEC bv. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n2/abs/jors201086a.html A scatter search methodology for the nurse rostering problem / Burke, E. K. in Journal of the operational research society (JORS), Vol. 61 N° 11 (Novembre 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1667–1679
Titre : A scatter search methodology for the nurse rostering problem Type de document : texte imprimé Auteurs : Burke, E. K., Auteur ; Curtois, T., Auteur ; Qu, R., Auteur Année de publication : 2011 Article en page(s) : pp. 1667–1679 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Nurse rostering Scatter search Heuristics Index. décimale : 001.424 Résumé : The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009118a.html [article] A scatter search methodology for the nurse rostering problem [texte imprimé] / Burke, E. K., Auteur ; Curtois, T., Auteur ; Qu, R., Auteur . - 2011 . - pp. 1667–1679.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1667–1679
Mots-clés : Nurse rostering Scatter search Heuristics Index. décimale : 001.424 Résumé : The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009118a.html