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... |
Journal of the operational research society (JORS) |
Dépouillements
Ajouter le résultat dans votre panierRisk taking by decision makers—using card-based decision gaming to develop models of behaviour / J. Medhurst in Journal of the operational research society (JORS), Vol. 61 N° 11 (Novembre 2010)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1561–1571
Titre : Risk taking by decision makers—using card-based decision gaming to develop models of behaviour Type de document : texte imprimé Auteurs : J. Medhurst, Auteur ; I. Stanton, Auteur ; A. Berry, Auteur Année de publication : 2011 Article en page(s) : pp. 1561–1571 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Decision analysis Military Gaming Regression Index. décimale : 001.424 Résumé : This paper describes an experimental method for determining the value of different types of information to military decision makers. The experimental method used a simple scenario and a set of serials constructed from cards, each presenting a single piece of information and presented sequentially. Each of a number of pairs of players were taken through the scenario and asked to judge how they would respond to the situation. This paper extends on the method presented in previous papers to consider the case of a decision in which the response can both increase and decrease as more information is presented. This allows a more general military problem to be considered, that of risk-taking behaviour in response to the possibility of chemical, biological, radiological or nuclear events. DEWEY : 001.424 ISSN : 01605682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009130a.html [article] Risk taking by decision makers—using card-based decision gaming to develop models of behaviour [texte imprimé] / J. Medhurst, Auteur ; I. Stanton, Auteur ; A. Berry, Auteur . - 2011 . - pp. 1561–1571.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1561–1571
Mots-clés : Decision analysis Military Gaming Regression Index. décimale : 001.424 Résumé : This paper describes an experimental method for determining the value of different types of information to military decision makers. The experimental method used a simple scenario and a set of serials constructed from cards, each presenting a single piece of information and presented sequentially. Each of a number of pairs of players were taken through the scenario and asked to judge how they would respond to the situation. This paper extends on the method presented in previous papers to consider the case of a decision in which the response can both increase and decrease as more information is presented. This allows a more general military problem to be considered, that of risk-taking behaviour in response to the possibility of chemical, biological, radiological or nuclear events. DEWEY : 001.424 ISSN : 01605682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009130a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1572–1581
Titre : An evaluation of the applicability of system dynamics to patient flow modelling Type de document : texte imprimé Auteurs : S. Vanderby, Auteur ; M. W. Carter, Auteur Année de publication : 2011 Article en page(s) : pp. 1572–1581 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Health service Hospitals Simulation Strategic planning System dynamics Index. décimale : 001.424 Résumé : The objective of this research is to determine whether Systems Dynamics (SD) is a beneficial method for modelling hospital patient flow from a strategic planning perspective. While discrete event simulation has frequently been used as a tool for analysing and improving patient flow in health care settings, the desire to assess and understand patient flow and resource demand from a more strategic, and therefore aggregate, perspective led to the use of SD. To evaluate the suitability of such an approach, a model was developed in collaboration with the General Campus at The Ottawa Hospital with particular attention paid to the delays experienced by patients in the emergency department. The modelling techniques used, model validation and scenarios tested with the model are discussed, accompanied by comments regarding the appropriateness of SD for such a model. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009150a.html [article] An evaluation of the applicability of system dynamics to patient flow modelling [texte imprimé] / S. Vanderby, Auteur ; M. W. Carter, Auteur . - 2011 . - pp. 1572–1581.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1572–1581
Mots-clés : Health service Hospitals Simulation Strategic planning System dynamics Index. décimale : 001.424 Résumé : The objective of this research is to determine whether Systems Dynamics (SD) is a beneficial method for modelling hospital patient flow from a strategic planning perspective. While discrete event simulation has frequently been used as a tool for analysing and improving patient flow in health care settings, the desire to assess and understand patient flow and resource demand from a more strategic, and therefore aggregate, perspective led to the use of SD. To evaluate the suitability of such an approach, a model was developed in collaboration with the General Campus at The Ottawa Hospital with particular attention paid to the delays experienced by patients in the emergency department. The modelling techniques used, model validation and scenarios tested with the model are discussed, accompanied by comments regarding the appropriateness of SD for such a model. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009150a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1582–1595
Titre : Reducing the elastic generalized assignment problem to the standard generalized assignment problem Type de document : texte imprimé Auteurs : M. Büther, Auteur Année de publication : 2011 Article en page(s) : pp. 1582–1595 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Assignment Binary representation Qapacity planning Combinatorial optimization Mixed integer programming Index. décimale : 001.424 Résumé : The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not fixed but can be adjusted; this adjustment can be expressed by continuous variables. These variables might be unbounded or restricted by a lower or upper bound, respectively. This paper concerns techniques aiming at reducing several variants of eGAP to GAP, which enables us to employ standard approaches for the GAP. This results in a heuristic, which can be customized in order to provide solutions having an objective value arbitrarily close to the optimal. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009108a.html [article] Reducing the elastic generalized assignment problem to the standard generalized assignment problem [texte imprimé] / M. Büther, Auteur . - 2011 . - pp. 1582–1595.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1582–1595
Mots-clés : Assignment Binary representation Qapacity planning Combinatorial optimization Mixed integer programming Index. décimale : 001.424 Résumé : The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not fixed but can be adjusted; this adjustment can be expressed by continuous variables. These variables might be unbounded or restricted by a lower or upper bound, respectively. This paper concerns techniques aiming at reducing several variants of eGAP to GAP, which enables us to employ standard approaches for the GAP. This results in a heuristic, which can be customized in order to provide solutions having an objective value arbitrarily close to the optimal. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009108a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1596–1606
Titre : A graphical method for valuing switching options Type de document : texte imprimé Auteurs : B. R. Cobb, Auteur ; J. M. Charnes, Auteur Année de publication : 2011 Article en page(s) : pp. 1596–1606 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Capital budgeting Decision analysis Decision support systems Finance Networks and graphs Probability Index. décimale : 001.424 Résumé : This paper introduces a graphical method for valuing options on real asset investments that allow the investor to switch between different operating modes at a single point-in-time. The technique uses mixtures of truncated exponential functions to approximate both the probability density function for project value and the expressions for option value of each alternative. The distribution for project value is transformed into an expected cash flow function for the option under each mode of operation. After determining an optimal exercise strategy, these functions are used to determine the option value. The graphical method allows the option exercise strategy to be communicated effectively through a graphical representation of the expected cash flow functions. A comparison of this approach to the existing binomial lattice method is presented. The efficiency of the graphical method is comparable to the binomial lattice and in some cases accurate solutions can be obtained with less CPU time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009128a.html [article] A graphical method for valuing switching options [texte imprimé] / B. R. Cobb, Auteur ; J. M. Charnes, Auteur . - 2011 . - pp. 1596–1606.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1596–1606
Mots-clés : Capital budgeting Decision analysis Decision support systems Finance Networks and graphs Probability Index. décimale : 001.424 Résumé : This paper introduces a graphical method for valuing options on real asset investments that allow the investor to switch between different operating modes at a single point-in-time. The technique uses mixtures of truncated exponential functions to approximate both the probability density function for project value and the expressions for option value of each alternative. The distribution for project value is transformed into an expected cash flow function for the option under each mode of operation. After determining an optimal exercise strategy, these functions are used to determine the option value. The graphical method allows the option exercise strategy to be communicated effectively through a graphical representation of the expected cash flow functions. A comparison of this approach to the existing binomial lattice method is presented. The efficiency of the graphical method is comparable to the binomial lattice and in some cases accurate solutions can be obtained with less CPU time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009128a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1607–1618
Titre : A network model for airport common use check-in counter assignments Type de document : texte imprimé Auteurs : Ching-Hui Tang, Auteur Année de publication : 2011 Article en page(s) : pp. 1607–1618 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Networks and graphs Optimization Air transport Common use check-in counters Minimum number of counters Assignments Index. décimale : 001.424 Résumé : The purpose of flight to check-in counter assignments is to assign each flight to specific check-in counters where the airline will provide passenger check-in services. The number of common use check-in counters required for daily operations is an important issue closely related to the airport's level of service and system performance. In this study, a new network model is developed for the optimization of common use check-in counter assignments. The goal is to minimize the number of counters required for daily operations. Numerical tests are performed on data for a major Taiwan airport. The obtained results show that the model performs well. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009126a.html [article] A network model for airport common use check-in counter assignments [texte imprimé] / Ching-Hui Tang, Auteur . - 2011 . - pp. 1607–1618.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1607–1618
Mots-clés : Networks and graphs Optimization Air transport Common use check-in counters Minimum number of counters Assignments Index. décimale : 001.424 Résumé : The purpose of flight to check-in counter assignments is to assign each flight to specific check-in counters where the airline will provide passenger check-in services. The number of common use check-in counters required for daily operations is an important issue closely related to the airport's level of service and system performance. In this study, a new network model is developed for the optimization of common use check-in counter assignments. The goal is to minimize the number of counters required for daily operations. Numerical tests are performed on data for a major Taiwan airport. The obtained results show that the model performs well. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009126a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1619–1631
Titre : Integrating heuristic information into exact methods : the case of the vertex p-centre problem Type de document : texte imprimé Auteurs : Samir Salhi, Auteur ; A. Al-Khedhairi, Auteur Année de publication : 2011 Article en page(s) : pp. 1619–1631 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Vertex p-centre Location Set covering problem (SCP) Multi-level heuristic Variable neighbourhood search (VNS) Exact method Index. décimale : 001.424 Résumé : We solve the vertex p-centre problem optimally using an exact method that considers both upper and lower bounds as part of its search engine. Tight upper bounds are generated quickly via an efficient three-level heuristic, which are then used to derive potential ‘lower bounds’ accordingly. These two pieces of information when used together make our chosen exact method more efficient at obtaining optimal solutions relatively quickly. The proposed implementation produced excellent results when tested on the OR Library data set. This integrated approach can be adopted for those exact methods that consider both upper and lower bounds within their search engine and hence provide a wider spectrum of applicability in other hard combinatorial problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors200991a.html [article] Integrating heuristic information into exact methods : the case of the vertex p-centre problem [texte imprimé] / Samir Salhi, Auteur ; A. Al-Khedhairi, Auteur . - 2011 . - pp. 1619–1631.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1619–1631
Mots-clés : Vertex p-centre Location Set covering problem (SCP) Multi-level heuristic Variable neighbourhood search (VNS) Exact method Index. décimale : 001.424 Résumé : We solve the vertex p-centre problem optimally using an exact method that considers both upper and lower bounds as part of its search engine. Tight upper bounds are generated quickly via an efficient three-level heuristic, which are then used to derive potential ‘lower bounds’ accordingly. These two pieces of information when used together make our chosen exact method more efficient at obtaining optimal solutions relatively quickly. The proposed implementation produced excellent results when tested on the OR Library data set. This integrated approach can be adopted for those exact methods that consider both upper and lower bounds within their search engine and hence provide a wider spectrum of applicability in other hard combinatorial problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors200991a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1632–1644
Titre : Automated selection of the number of replications for a discrete-event simulation Type de document : texte imprimé Auteurs : K. Hoad, Auteur ; S. Robinson, Auteur ; Davies, R., Auteur Année de publication : 2011 Article en page(s) : pp. 1632–1644 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Discrete-event simulation Number of replications Confidence interval Index. décimale : 001.424 Résumé : Selecting an appropriate number of replications to run with a simulation model is important in assuring that the desired accuracy and precision of the results are attained with minimal effort. If too few are selected then accuracy and precision are lost; if too many are selected then valuable time is wasted. Given that simulation is often used by non-specialists, it seems important to provide guidance on the number of replications required with a model. In this paper an algorithm for automatically selecting the number of replications is described. Test results show the algorithm to be effective in obtaining coverage of the expected mean at a given level of precision and in reducing the bias in the estimate of the mean of the simulation output. The algorithm is consistent in selecting the expected number of replications required for a model output. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009121a.html [article] Automated selection of the number of replications for a discrete-event simulation [texte imprimé] / K. Hoad, Auteur ; S. Robinson, Auteur ; Davies, R., Auteur . - 2011 . - pp. 1632–1644.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1632–1644
Mots-clés : Discrete-event simulation Number of replications Confidence interval Index. décimale : 001.424 Résumé : Selecting an appropriate number of replications to run with a simulation model is important in assuring that the desired accuracy and precision of the results are attained with minimal effort. If too few are selected then accuracy and precision are lost; if too many are selected then valuable time is wasted. Given that simulation is often used by non-specialists, it seems important to provide guidance on the number of replications required with a model. In this paper an algorithm for automatically selecting the number of replications is described. Test results show the algorithm to be effective in obtaining coverage of the expected mean at a given level of precision and in reducing the bias in the estimate of the mean of the simulation output. The algorithm is consistent in selecting the expected number of replications required for a model output. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009121a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1645–1653
Titre : Retailer or e-tailer? Strategic pricing and economic-lot-size decisions in a competitive supply chain with drop-shipping Type de document : texte imprimé Auteurs : W. K. Chiang, Auteur ; Y. Feng, Auteur Année de publication : 2011 Article en page(s) : pp. 1645–1653 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Distribution channel Inventory Supply chain analysis Conflict analysis Game theory Index. décimale : 001.424 Résumé : Drop-shipping is an arrangement whereby an e-tailer, who does not hold inventories, processes orders and requests a manufacturer to ship products directly to the end customers. To explore the economic benefits of adopting drop-shipping distribution strategy in a competitive environment, we investigate the profitability and the efficiency of the drop-shipping channel as compared to the traditional channel. Specifically, we develop Economic Order Quantity (EOQ) games with pricing and lot-sizing decisions to examine the strategic interactions between a manufacturer and its retailer/e-tailer in the traditional/drop-shipping distribution channels. We identify conditions under which the drop-shipping channel profitably outperforms the traditional one. It is found that the economic interests of adopting drop-shipping distribution for the channel members may not always be consistent. There are cases where only the manufacture would favour drop-shipping. In this study, we also reveal that the inefficiency caused by lack of coordination in the traditional channel can be alleviated in the drop-shipping channel where the lot-sizing decision is made by the manufacturer. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009139a.html [article] Retailer or e-tailer? Strategic pricing and economic-lot-size decisions in a competitive supply chain with drop-shipping [texte imprimé] / W. K. Chiang, Auteur ; Y. Feng, Auteur . - 2011 . - pp. 1645–1653.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1645–1653
Mots-clés : Distribution channel Inventory Supply chain analysis Conflict analysis Game theory Index. décimale : 001.424 Résumé : Drop-shipping is an arrangement whereby an e-tailer, who does not hold inventories, processes orders and requests a manufacturer to ship products directly to the end customers. To explore the economic benefits of adopting drop-shipping distribution strategy in a competitive environment, we investigate the profitability and the efficiency of the drop-shipping channel as compared to the traditional channel. Specifically, we develop Economic Order Quantity (EOQ) games with pricing and lot-sizing decisions to examine the strategic interactions between a manufacturer and its retailer/e-tailer in the traditional/drop-shipping distribution channels. We identify conditions under which the drop-shipping channel profitably outperforms the traditional one. It is found that the economic interests of adopting drop-shipping distribution for the channel members may not always be consistent. There are cases where only the manufacture would favour drop-shipping. In this study, we also reveal that the inefficiency caused by lack of coordination in the traditional channel can be alleviated in the drop-shipping channel where the lot-sizing decision is made by the manufacturer. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009139a.html
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1654–1666
Titre : Multi-vendor integrated procurement-production system under shared transportation and just-in-time delivery system Type de document : texte imprimé Auteurs : Z. X. Chen, Auteur ; Sarker, B. R., Auteur Année de publication : 2011 Article en page(s) : pp. 1654–1666 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Just-in-time Procurement Inventory Purchasing Lot size Transportation Index. décimale : 001.424 Résumé : Just-in-time (JIT) procurement is one of the important elements of lean production system. Successful implementation of JIT needs vendor-manufacturer cooperation on small lot size delivery and inbound logistics cost reduction. Unlike the most recent literature focusing on single-vendor and single-buyer integrated inventory systems, this paper studies a multi-vendor integrated procurement-production inventory system that incorporates delivery and shared transportation costs. A multi-vendor optimal model is developed here for deciding the batch size of vendor's production, and delivery frequencies of different vendors to the manufacturer. Solution procedures for two special cases—uncapacitated and capacitated models are developed; especially, a new approximate method for capacitated model is devised. Numerical examples demonstrate the solution mechanism for the model. The results highlight cooperation between vendors and manufacturers on JIT procurement practices. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009115a.html [article] Multi-vendor integrated procurement-production system under shared transportation and just-in-time delivery system [texte imprimé] / Z. X. Chen, Auteur ; Sarker, B. R., Auteur . - 2011 . - pp. 1654–1666.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 11 (Novembre 2010) . - pp. 1654–1666
Mots-clés : Just-in-time Procurement Inventory Purchasing Lot size Transportation Index. décimale : 001.424 Résumé : Just-in-time (JIT) procurement is one of the important elements of lean production system. Successful implementation of JIT needs vendor-manufacturer cooperation on small lot size delivery and inbound logistics cost reduction. Unlike the most recent literature focusing on single-vendor and single-buyer integrated inventory systems, this paper studies a multi-vendor integrated procurement-production inventory system that incorporates delivery and shared transportation costs. A multi-vendor optimal model is developed here for deciding the batch size of vendor's production, and delivery frequencies of different vendors to the manufacturer. Solution procedures for two special cases—uncapacitated and capacitated models are developed; especially, a new approximate method for capacitated model is devised. Numerical examples demonstrate the solution mechanism for the model. The results highlight cooperation between vendors and manufacturers on JIT procurement practices. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n11/abs/jors2009115a.html
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
Exemplaires
| Code-barres | Cote | Support | Localisation | Section | Disponibilité |
|---|---|---|---|---|---|
| aucun exemplaire | |||||
