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) / Wilson, John . Vol. 61 N° 1 (Issue spécial)Journal of the operational research society (JORS)Mention de date : Janvier 2010 Paru le : 07/09/2011 |
Dépouillements
Ajouter le résultat dans votre panierThe challenge of publications / K. Brian Haley in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 4–10
Titre : The challenge of publications Type de document : texte imprimé Auteurs : K. Brian Haley, Auteur Année de publication : 2011 Article en page(s) : pp. 4–10 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Operation research history Publishing Performance measurement Index. décimale : 001.424 Résumé : This review of 60 years of publishing by the Operational Research Society concentrates on the Journal, the problems faced by the editors and the evolution of its contents. This paper describes the growth in size of the Society external influences and the financial contribution to the Society generated by the Journal. Some funds were used to expand the range and scope of the publications, which currently consist of six different titles and are available in hard copy of electronic format. The future challenge of maintaining the financial income to support the continuing change in the subject is highlighted. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009125a.html [article] The challenge of publications [texte imprimé] / K. Brian Haley, Auteur . - 2011 . - pp. 4–10.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 4–10
Mots-clés : Operation research history Publishing Performance measurement Index. décimale : 001.424 Résumé : This review of 60 years of publishing by the Operational Research Society concentrates on the Journal, the problems faced by the editors and the evolution of its contents. This paper describes the growth in size of the Society external influences and the financial contribution to the Society generated by the Journal. Some funds were used to expand the range and scope of the publications, which currently consist of six different titles and are available in hard copy of electronic format. The future challenge of maintaining the financial income to support the continuing change in the subject is highlighted. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009125a.html OR—a personal perspective / R. S. Stainton in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 11–13
Titre : OR—a personal perspective Type de document : texte imprimé Auteurs : R. S. Stainton, Auteur Année de publication : 2011 Article en page(s) : pp. 11–13 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Operation research practice Problem solving Systems Index. décimale : 001.424 Résumé : The occasion of the 60th anniversary of the Journal of the Operational Research Society provides the opportunity for reflection and reminiscing about Operational Research (OR). In this note a personal reflection on the nature of OR is offered. Some ideas are suggested to account for the success and failure of OR and some challenges are noted for its forward progress. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009144a.html [article] OR—a personal perspective [texte imprimé] / R. S. Stainton, Auteur . - 2011 . - pp. 11–13.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 11–13
Mots-clés : Operation research practice Problem solving Systems Index. décimale : 001.424 Résumé : The occasion of the 60th anniversary of the Journal of the Operational Research Society provides the opportunity for reflection and reminiscing about Operational Research (OR). In this note a personal reflection on the nature of OR is offered. Some ideas are suggested to account for the success and failure of OR and some challenges are noted for its forward progress. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009144a.html Why modelling and model use matter / M. Pidd in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 14–24
Titre : Why modelling and model use matter Type de document : texte imprimé Auteurs : M. Pidd, Auteur Année de publication : 2011 Article en page(s) : pp. 14–24 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Practice of operations research Methodology Decision support systems Index. décimale : 001.424 Résumé : When OR/MS analysts develop a model, how are they intending this model to be used? There are many different ways in which OR/MS models may be classified and one important categorisation is the intended use of the model. Some models are intended for routine use on a frequent basis, with little or no human intervention. Others form part of human decision process and provide support to that process. Considering model validation, data requirements, added value and possible pitfalls leads to a theory of model use based on four categories: decision automation, routine decision support, investigation and improvement, and generating insights for debate. A pilot investigation in an OR/MS group demonstrates that this categorisation could provide the basis for empirical research into a theory of model use in operational research. A theory of model use would be of value to academics, who could prioritise their work, and to practitioners, who could place their own work in a broader landscape. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009141a.html [article] Why modelling and model use matter [texte imprimé] / M. Pidd, Auteur . - 2011 . - pp. 14–24.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 14–24
Mots-clés : Practice of operations research Methodology Decision support systems Index. décimale : 001.424 Résumé : When OR/MS analysts develop a model, how are they intending this model to be used? There are many different ways in which OR/MS models may be classified and one important categorisation is the intended use of the model. Some models are intended for routine use on a frequent basis, with little or no human intervention. Others form part of human decision process and provide support to that process. Considering model validation, data requirements, added value and possible pitfalls leads to a theory of model use based on four categories: decision automation, routine decision support, investigation and improvement, and generating insights for debate. A pilot investigation in an OR/MS group demonstrates that this categorisation could provide the basis for empirical research into a theory of model use in operational research. A theory of model use would be of value to academics, who could prioritise their work, and to practitioners, who could place their own work in a broader landscape. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009141a.html Data envelopment analysis, operational research and uncertainty / Dyson, R. G. in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 25–34
Titre : Data envelopment analysis, operational research and uncertainty Type de document : texte imprimé Auteurs : Dyson, R. G., Auteur ; Shale, E. A., Auteur Année de publication : 2011 Article en page(s) : pp. 25–34 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Data envelopment analysis Uncertainty Monte Carlo simulation Index. décimale : 001.424 Résumé : This paper discusses a number of applications of data envelopment analysis and the nature of uncertainty in those applications. It then reviews the key approaches to handling uncertainty in data envelopment analysis (DEA) (imprecise DEA, bootstrapping, Monte Carlo simulation and chance constrained DEA) and considers their suitability for modelling the applications. The paper concludes with suggestions about the challenges facing an operational research analyst in applying DEA in real-world situations. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009145a.html [article] Data envelopment analysis, operational research and uncertainty [texte imprimé] / Dyson, R. G., Auteur ; Shale, E. A., Auteur . - 2011 . - pp. 25–34.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 25–34
Mots-clés : Data envelopment analysis Uncertainty Monte Carlo simulation Index. décimale : 001.424 Résumé : This paper discusses a number of applications of data envelopment analysis and the nature of uncertainty in those applications. It then reviews the key approaches to handling uncertainty in data envelopment analysis (DEA) (imprecise DEA, bootstrapping, Monte Carlo simulation and chance constrained DEA) and considers their suitability for modelling the applications. The paper concludes with suggestions about the challenges facing an operational research analyst in applying DEA in real-world situations. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009145a.html A concise guide to the Traveling Salesman Problem / G. Laporte in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 35–40
Titre : A concise guide to the Traveling Salesman Problem Type de document : texte imprimé Auteurs : G. Laporte, Auteur Année de publication : 2011 Article en page(s) : pp. 35–40 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Traveling salesman problem Exact algorithms Heuristics Software Index. décimale : 001.424 Résumé : The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors200976a.html [article] A concise guide to the Traveling Salesman Problem [texte imprimé] / G. Laporte, Auteur . - 2011 . - pp. 35–40.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 35–40
Mots-clés : Traveling salesman problem Exact algorithms Heuristics Software Index. décimale : 001.424 Résumé : The Traveling Salesman Problem (TSP) is one of the most famous problems in combinatorial optimization. Hundreds of papers have been written on the TSP and several exact and heuristic algorithms are available for it. Their concise guide outlines the most important and best algorithms for the symmetric and asymmetric versions of the TSP. In several cases, references to publicly available software are provided. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors200976a.html Consumer finance / L. C. Thomas in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 41–52
Titre : Consumer finance : challenges for operational research Type de document : texte imprimé Auteurs : L. C. Thomas, Auteur Année de publication : 2011 Article en page(s) : pp. 41–52 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Consumer finance Credit scoring Risk-based pricing Classification techniques Customer lifetime value Index. décimale : 001.424 Résumé : Consumer finance has become one of the most important areas of banking, both because of the amount of money being lent and the impact of such credit on global economy and the realisation that the credit crunch of 2008 was partly due to incorrect modelling of the risks in such lending. This paper reviews the development of credit scoring—the way of assessing risk in consumer finance—and what is meant by a credit score. It then outlines 10 challenges for Operational Research to support modelling in consumer finance. Some of these involve developing more robust risk assessment systems, whereas others are to expand the use of such modelling to deal with the current objectives of lenders and the new decisions they have to make in consumer finance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009104a.html [article] Consumer finance : challenges for operational research [texte imprimé] / L. C. Thomas, Auteur . - 2011 . - pp. 41–52.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 41–52
Mots-clés : Consumer finance Credit scoring Risk-based pricing Classification techniques Customer lifetime value Index. décimale : 001.424 Résumé : Consumer finance has become one of the most important areas of banking, both because of the amount of money being lent and the impact of such credit on global economy and the realisation that the credit crunch of 2008 was partly due to incorrect modelling of the risks in such lending. This paper reviews the development of credit scoring—the way of assessing risk in consumer finance—and what is meant by a credit score. It then outlines 10 challenges for Operational Research to support modelling in consumer finance. Some of these involve developing more robust risk assessment systems, whereas others are to expand the use of such modelling to deal with the current objectives of lenders and the new decisions they have to make in consumer finance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009104a.html The challenge of optimizing expensive black boxes / M. Laguna in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 53–67
Titre : The challenge of optimizing expensive black boxes : a scatter search/rough set theory approach Type de document : texte imprimé Auteurs : M. Laguna, Auteur ; J. Molina, Auteur ; F. Pérez, Auteur Année de publication : 2011 Article en page(s) : pp. 53–67 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Black-box optimization Simulation optimization Scatter search Rough sets Index. décimale : 001.424 Résumé : There is renewed interest in the development of effective and efficient methods for optimizing models of which the optimizer has no structural knowledge. This is what in the literature is referred to as optimization of black boxes. In particular, we address the challenge of optimizing expensive black boxes, that is, those that require a significant computational effort to be evaluated. We describe the use of rough set theory within a scatter search framework, with the goal of identifying high-quality solutions with a limited number of objective function evaluations. The rough set strategies that we developed take advantage of the information provided by the best and diverse solutions found during the search, in order to define areas of the solution space that are promising for search intensification. We test our procedure on a set of 92 nonlinear multimodal functions of varied complexity and size and compare the results with a state-of-the-art procedure based on particle swarm optimization. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009124a.html [article] The challenge of optimizing expensive black boxes : a scatter search/rough set theory approach [texte imprimé] / M. Laguna, Auteur ; J. Molina, Auteur ; F. Pérez, Auteur . - 2011 . - pp. 53–67.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 53–67
Mots-clés : Black-box optimization Simulation optimization Scatter search Rough sets Index. décimale : 001.424 Résumé : There is renewed interest in the development of effective and efficient methods for optimizing models of which the optimizer has no structural knowledge. This is what in the literature is referred to as optimization of black boxes. In particular, we address the challenge of optimizing expensive black boxes, that is, those that require a significant computational effort to be evaluated. We describe the use of rough set theory within a scatter search framework, with the goal of identifying high-quality solutions with a limited number of objective function evaluations. The rough set strategies that we developed take advantage of the information provided by the best and diverse solutions found during the search, in order to define areas of the solution space that are promising for search intensification. We test our procedure on a set of 92 nonlinear multimodal functions of varied complexity and size and compare the results with a state-of-the-art procedure based on particle swarm optimization. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009124a.html The 'invisible science' / M. W. Kirby in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 68–81
Titre : The 'invisible science' : operational research for the British Armed Forces after 1945 Type de document : texte imprimé Auteurs : M. W. Kirby, Auteur ; M. T. Godwin, Auteur Année de publication : 2011 Article en page(s) : pp. 68–81 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : History of OR Military OR Cold war Nuclear war Index. décimale : 001.424 Résumé : This paper presents an original account of the contribution of operational research (OR) to the formulation of tactics and strategy on behalf of the British Armed Forces in the four decades after 1945. The main focus is on the Cold War in the European theatre, where OR analysts devoted considerable time and effort to the modelling of warfare on behalf of the British Army of the Rhine. In the absence of combat data for nuclear weapons, OR analysts devised a sequence of war games which evolved in conformity with the development of NATO strategy in relation to the Warsaw Pact. Again in the context of the Cold War, the paper analyses the role of OR in relation to the early V bomber force and the introduction of 'global war studies' on behalf of the Royal Navy. The paper also comments on the organisational structure of British military OR following on the creation of a centralised OR facility within the Ministry of Defence in 1965. In conclusion, the paper notes the sea-change in military OR following the end of the Cold War in 1990 and the onset of a period of sustained 'asymmetric' military operations in the former Yugoslavia, the Middle East and Afghanistan. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009156a.html [article] The 'invisible science' : operational research for the British Armed Forces after 1945 [texte imprimé] / M. W. Kirby, Auteur ; M. T. Godwin, Auteur . - 2011 . - pp. 68–81.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 68–81
Mots-clés : History of OR Military OR Cold war Nuclear war Index. décimale : 001.424 Résumé : This paper presents an original account of the contribution of operational research (OR) to the formulation of tactics and strategy on behalf of the British Armed Forces in the four decades after 1945. The main focus is on the Cold War in the European theatre, where OR analysts devoted considerable time and effort to the modelling of warfare on behalf of the British Army of the Rhine. In the absence of combat data for nuclear weapons, OR analysts devised a sequence of war games which evolved in conformity with the development of NATO strategy in relation to the Warsaw Pact. Again in the context of the Cold War, the paper analyses the role of OR in relation to the early V bomber force and the introduction of 'global war studies' on behalf of the Royal Navy. The paper also comments on the organisational structure of British military OR following on the creation of a centralised OR facility within the Ministry of Defence in 1965. In conclusion, the paper notes the sea-change in military OR following the end of the Cold War in 1990 and the onset of a period of sustained 'asymmetric' military operations in the former Yugoslavia, the Middle East and Afghanistan. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009156a.html A profile of OR research and practice published in the Journal of the operational research society / Katsaliaki, K. in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 82–94
Titre : A profile of OR research and practice published in the Journal of the operational research society Type de document : texte imprimé Auteurs : Katsaliaki, K., Auteur ; Mustafee, N., Auteur ; Y. K. Dwivedi, Auteur Année de publication : 2011 Article en page(s) : pp. 82–94 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : OR research Practice of OR Research profile Productive authors Research paradigm Index. décimale : 001.424 Résumé : In this paper we reflect on the last 10 years of the Journal of the Operational Research Society (JORS). We use metadata and citation analysis to profile OR research and practice published in this prestigious journal. The analysis of the published material includes examining variables such as the most productive authors, the papers having the highest number of citations, the universities and organisations associated with the most publications and their geographic diversity, OR techniques and their application areas, the number of authors per paper, the background of the authors, etc. Moreover, this work includes variables from a previously published study of JORS that profiled research from 1981 to 1999. Therefore, the analysis allows a comparison to be conducted between some of the findings of the two studies. This research has implications for researchers, journal editors and research institutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009137a.html [article] A profile of OR research and practice published in the Journal of the operational research society [texte imprimé] / Katsaliaki, K., Auteur ; Mustafee, N., Auteur ; Y. K. Dwivedi, Auteur . - 2011 . - pp. 82–94.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 82–94
Mots-clés : OR research Practice of OR Research profile Productive authors Research paradigm Index. décimale : 001.424 Résumé : In this paper we reflect on the last 10 years of the Journal of the Operational Research Society (JORS). We use metadata and citation analysis to profile OR research and practice published in this prestigious journal. The analysis of the published material includes examining variables such as the most productive authors, the papers having the highest number of citations, the universities and organisations associated with the most publications and their geographic diversity, OR techniques and their application areas, the number of authors per paper, the background of the authors, etc. Moreover, this work includes variables from a previously published study of JORS that profiled research from 1981 to 1999. Therefore, the analysis allows a comparison to be conducted between some of the findings of the two studies. This research has implications for researchers, journal editors and research institutions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2009137a.html Heuristics with a new block strategy for the single and multiple containers loading problems / M-K. Kang in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 95–107
Titre : Heuristics with a new block strategy for the single and multiple containers loading problems Type de document : texte imprimé Auteurs : M-K. Kang, Auteur ; C-S. Jang, Auteur ; K-S. Yoon, Auteur Année de publication : 2011 Article en page(s) : pp. 95–107 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Container loading problem Packing Heuristics Index. décimale : 001.424 Résumé : A heuristic algorithm using new block strategy for the heterogeneous single and multiple containers loading problem (CLP) is proposed in this paper. In order to solve the single CLP, this algorithm fills unused spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three child-spaces starting with an empty container. An initial container pattern is first built applying this approach recursively until all boxes are stowed or no unused spaces are left. And then, alternative container patterns are generated after replacing the load-blocks of the pattern-determining spaces in the initial container pattern with the alternative-blocks previously stored. Finally, an improvement procedure compares these alternatives with the initial container pattern to identify an improved container pattern. An algorithm for the multiple CLP uses the single CLP algorithm to generate an initial solution and uses improvement procedures to improve the initial solution. Numerical experiments with 715 test cases for the single CLP and 47 test cases for the multiple the CLP revealed the excellent performance of this algorithm. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008120a.html [article] Heuristics with a new block strategy for the single and multiple containers loading problems [texte imprimé] / M-K. Kang, Auteur ; C-S. Jang, Auteur ; K-S. Yoon, Auteur . - 2011 . - pp. 95–107.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 95–107
Mots-clés : Container loading problem Packing Heuristics Index. décimale : 001.424 Résumé : A heuristic algorithm using new block strategy for the heterogeneous single and multiple containers loading problem (CLP) is proposed in this paper. In order to solve the single CLP, this algorithm fills unused spaces with the homogeneous load-blocks of identically oriented boxes and splits residual space into three child-spaces starting with an empty container. An initial container pattern is first built applying this approach recursively until all boxes are stowed or no unused spaces are left. And then, alternative container patterns are generated after replacing the load-blocks of the pattern-determining spaces in the initial container pattern with the alternative-blocks previously stored. Finally, an improvement procedure compares these alternatives with the initial container pattern to identify an improved container pattern. An algorithm for the multiple CLP uses the single CLP algorithm to generate an initial solution and uses improvement procedures to improve the initial solution. Numerical experiments with 715 test cases for the single CLP and 47 test cases for the multiple the CLP revealed the excellent performance of this algorithm. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008120a.html An approach for solving the lot-sizing problem of a market-driven foundry / V. S. Tonaki in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 108–114
Titre : An approach for solving the lot-sizing problem of a market-driven foundry Type de document : texte imprimé Auteurs : V. S. Tonaki, Auteur ; F. M. B. Toledo, Auteur Année de publication : 2011 Article en page(s) : pp. 108–114 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Foundry Lot-sizing Heuristic Index. décimale : 001.424 Résumé : Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008151a.html [article] An approach for solving the lot-sizing problem of a market-driven foundry [texte imprimé] / V. S. Tonaki, Auteur ; F. M. B. Toledo, Auteur . - 2011 . - pp. 108–114.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 108–114
Mots-clés : Foundry Lot-sizing Heuristic Index. décimale : 001.424 Résumé : Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008151a.html Scheduling policies in the M/G/1 make-to-stock queue / N. Sanajian in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 115–123
Titre : Scheduling policies in the M/G/1 make-to-stock queue Type de document : texte imprimé Auteurs : N. Sanajian, Auteur ; H. Abouee-Mehrizi, Auteur ; B. Balcioglu, Auteur Année de publication : 2011 Article en page(s) : pp. 115–123 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Make-to-stock M/G/1 queue Little's distributional law Static and dynamic production scheduling Inventory control Index. décimale : 001.424 Résumé : In this paper, we analyse a production/inventory system modelled as an M/G/1 make-to-stock queue producing different products requiring different and general production times. We study different scheduling policies including the static first-come-first-served, preemptive and non-preemptive priority disciplines. For each static policy, we exploit the distributional Little's law to obtain the steady-state distribution of the number of customers in the system and then find the optimal inventory control policy and the cost. We additionally provide the conditions under which it is optimal to produce a product according to a make-to-order policy. We further extend the application area of a well-known dynamic scheduling heuristic, Myopic(T), for systems with non-exponential service times by permitting preemption. We compare the performance of the preemptive-Myopic(T) heuristic alongside that of the static preemptive-bmu rule against the optimal solution. The numerical study we have conducted demonstrates that the preemptive-Myopic(T) policy is superior between the two and yields costs very close to the optimal. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008139a.html [article] Scheduling policies in the M/G/1 make-to-stock queue [texte imprimé] / N. Sanajian, Auteur ; H. Abouee-Mehrizi, Auteur ; B. Balcioglu, Auteur . - 2011 . - pp. 115–123.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 115–123
Mots-clés : Make-to-stock M/G/1 queue Little's distributional law Static and dynamic production scheduling Inventory control Index. décimale : 001.424 Résumé : In this paper, we analyse a production/inventory system modelled as an M/G/1 make-to-stock queue producing different products requiring different and general production times. We study different scheduling policies including the static first-come-first-served, preemptive and non-preemptive priority disciplines. For each static policy, we exploit the distributional Little's law to obtain the steady-state distribution of the number of customers in the system and then find the optimal inventory control policy and the cost. We additionally provide the conditions under which it is optimal to produce a product according to a make-to-order policy. We further extend the application area of a well-known dynamic scheduling heuristic, Myopic(T), for systems with non-exponential service times by permitting preemption. We compare the performance of the preemptive-Myopic(T) heuristic alongside that of the static preemptive-bmu rule against the optimal solution. The numerical study we have conducted demonstrates that the preemptive-Myopic(T) policy is superior between the two and yields costs very close to the optimal. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008139a.html Defence and attack of systems with variable attacker system structure detection probability / G. Levitin in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 124–133
Titre : Defence and attack of systems with variable attacker system structure detection probability Type de document : texte imprimé Auteurs : G. Levitin, Auteur ; K. Hausken, Auteur Année de publication : 2011 Article en page(s) : pp. 124–133 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Attack Defence System demand Elements False targets Redundancy Index. décimale : 001.424 Résumé : A system consists of identical elements. The cumulative performance of these elements should meet a demand. The defender applies three types of defensive actions to reduce a damage associated with system performance reduction caused by an external attack: deploying separated redundant genuine system elements, deploying false elements, and protecting genuine elements. If the attacker cannot distinguish between genuine and false elements, he chooses a number of elements to attack and then selects the elements at random, distributing his resources equally across these elements. By obtaining intelligence data, the attacker can get full information about the system structure and identify false and unprotected genuine elements. The defender estimates the probability that the attacker can identify all system elements. This paper analyses the influence of this probability in a non-cooperative two-period minmax game between the defender and the attacker. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008158a.html [article] Defence and attack of systems with variable attacker system structure detection probability [texte imprimé] / G. Levitin, Auteur ; K. Hausken, Auteur . - 2011 . - pp. 124–133.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 124–133
Mots-clés : Attack Defence System demand Elements False targets Redundancy Index. décimale : 001.424 Résumé : A system consists of identical elements. The cumulative performance of these elements should meet a demand. The defender applies three types of defensive actions to reduce a damage associated with system performance reduction caused by an external attack: deploying separated redundant genuine system elements, deploying false elements, and protecting genuine elements. If the attacker cannot distinguish between genuine and false elements, he chooses a number of elements to attack and then selects the elements at random, distributing his resources equally across these elements. By obtaining intelligence data, the attacker can get full information about the system structure and identify false and unprotected genuine elements. The defender estimates the probability that the attacker can identify all system elements. This paper analyses the influence of this probability in a non-cooperative two-period minmax game between the defender and the attacker. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008158a.html In the determination of weight sets to compute cross-efficiency ratios in DEA / K. F. Lam in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 134–143
Titre : In the determination of weight sets to compute cross-efficiency ratios in DEA Type de document : texte imprimé Auteurs : K. F. Lam, Auteur Année de publication : 2011 Article en page(s) : pp. 134–143 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Data envelopment analysis Discriminant analysis Linear programming Mixed-integer linear programming Performance measurement Résumé : Data envelopment analysis (DEA) measures the production performance of decision-making units (DMUs) which consume multiple inputs and produce multiple outputs. Although DEA has become a very popular method of performance measure, it still suffers from some shortcomings. For instance, one of its drawbacks is that multiple solutions exist in the linear programming solutions of efficient DMUs. The obtained weight set is just one of the many optimal weight sets that are available. Then why use this weight set instead of the others especially when this weight set is used for cross-evaluation? Another weakness of DEA is that extremely diverse or unusual values of some input or output weights might be obtained for DMUs under assessment. Zero input and output weights are not uncommon in DEA. The main objective of this paper is to develop a new methodology which applies discriminant analysis, super-efficiency DEA model and mixed-integer linear programming to choose suitable weight sets to be used in computing cross-evaluation. An advantage of this new method is that each obtained weight set can reflect the relative strengths of the efficient DMU under consideration. Moreover, the method also attempts to preserve the original classificatory result of DEA, and in addition this method produces much less zero weights than DEA in our computational results. DEWEY : 001.424 ISSN : 0160 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008138a.html [article] In the determination of weight sets to compute cross-efficiency ratios in DEA [texte imprimé] / K. F. Lam, Auteur . - 2011 . - pp. 134–143.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 134–143
Mots-clés : Data envelopment analysis Discriminant analysis Linear programming Mixed-integer linear programming Performance measurement Résumé : Data envelopment analysis (DEA) measures the production performance of decision-making units (DMUs) which consume multiple inputs and produce multiple outputs. Although DEA has become a very popular method of performance measure, it still suffers from some shortcomings. For instance, one of its drawbacks is that multiple solutions exist in the linear programming solutions of efficient DMUs. The obtained weight set is just one of the many optimal weight sets that are available. Then why use this weight set instead of the others especially when this weight set is used for cross-evaluation? Another weakness of DEA is that extremely diverse or unusual values of some input or output weights might be obtained for DMUs under assessment. Zero input and output weights are not uncommon in DEA. The main objective of this paper is to develop a new methodology which applies discriminant analysis, super-efficiency DEA model and mixed-integer linear programming to choose suitable weight sets to be used in computing cross-evaluation. An advantage of this new method is that each obtained weight set can reflect the relative strengths of the efficient DMU under consideration. Moreover, the method also attempts to preserve the original classificatory result of DEA, and in addition this method produces much less zero weights than DEA in our computational results. DEWEY : 001.424 ISSN : 0160 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008138a.html A dispatching algorithm for parallel machines with rework processes / Y. H. Kang in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 144–155
Titre : A dispatching algorithm for parallel machines with rework processes Type de document : texte imprimé Auteurs : Y. H. Kang, Auteur ; S. S. Kim, Auteur ; J. H. Shin, Auteur Année de publication : 2011 Article en page(s) : pp. 144–155 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Rework probability Parallel machines Dispatching algorithm Sequence-dependent setup times Index. décimale : 001.424 Résumé : This paper presents a parallel machine scheduling problem with rework probabilities, due-dates and sequence-dependent setup times. It is assumed that rework probability for each job on a machine can be given through historical data acquisition. Since the problem is NP-hard in the strong sense, a heuristic algorithm is presented, which finds good solutions. The dispatching algorithm named MRPD (minimum rework probability with due-dates) is proposed in this paper focusing on the rework processes. The performance of MRPD is measured by the six diagnostic indicators: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of reworks and the number of tardy jobs. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008148a.html [article] A dispatching algorithm for parallel machines with rework processes [texte imprimé] / Y. H. Kang, Auteur ; S. S. Kim, Auteur ; J. H. Shin, Auteur . - 2011 . - pp. 144–155.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 144–155
Mots-clés : Rework probability Parallel machines Dispatching algorithm Sequence-dependent setup times Index. décimale : 001.424 Résumé : This paper presents a parallel machine scheduling problem with rework probabilities, due-dates and sequence-dependent setup times. It is assumed that rework probability for each job on a machine can be given through historical data acquisition. Since the problem is NP-hard in the strong sense, a heuristic algorithm is presented, which finds good solutions. The dispatching algorithm named MRPD (minimum rework probability with due-dates) is proposed in this paper focusing on the rework processes. The performance of MRPD is measured by the six diagnostic indicators: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of reworks and the number of tardy jobs. A large number of test problems are randomly generated to evaluate the performance of the proposed algorithm. Computational results show that the proposed algorithm is significantly superior to existing dispatching algorithms for the test problems. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008148a.html A normal approximation model for safety stock optimization in a two-echelon distribution system / B. Desmet in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 156–163
Titre : A normal approximation model for safety stock optimization in a two-echelon distribution system Type de document : texte imprimé Auteurs : B. Desmet, Auteur ; E-H. Aghezzaf, Auteur ; H. Vanmaele, Auteur Année de publication : 2011 Article en page(s) : pp. 156–163 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Safety stocks Two-echelon distribution Decision support systems Index. décimale : 001.424 Résumé : This paper presents an approximation model for the retailer replenishment lead-times in a two-echelon distribution system, and discusses its implementation for safety stock optimization in a one-warehouse and N-identical retailers system. The model assumes normality of demand and nominal lead times. It takes into account not only the averages of these parameters but also their variances. This approximation model is first tested on a two-echelon, one-warehouse and N-identical retailers system using discrete event simulation. It is then applied to optimize the safety stock in a two-echelon distribution system of a European market leader in the production and distribution of air conditioning equipment. Results of this implementation are analysed and discussed in detail. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008150a.html [article] A normal approximation model for safety stock optimization in a two-echelon distribution system [texte imprimé] / B. Desmet, Auteur ; E-H. Aghezzaf, Auteur ; H. Vanmaele, Auteur . - 2011 . - pp. 156–163.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 156–163
Mots-clés : Safety stocks Two-echelon distribution Decision support systems Index. décimale : 001.424 Résumé : This paper presents an approximation model for the retailer replenishment lead-times in a two-echelon distribution system, and discusses its implementation for safety stock optimization in a one-warehouse and N-identical retailers system. The model assumes normality of demand and nominal lead times. It takes into account not only the averages of these parameters but also their variances. This approximation model is first tested on a two-echelon, one-warehouse and N-identical retailers system using discrete event simulation. It is then applied to optimize the safety stock in a two-echelon distribution system of a European market leader in the production and distribution of air conditioning equipment. Results of this implementation are analysed and discussed in detail. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008150a.html Bayesian forecasting with the Holt–Winters model / J. D. Bermúdez in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 164–171
Titre : Bayesian forecasting with the Holt–Winters model Type de document : texte imprimé Auteurs : J. D. Bermúdez, Auteur ; J. V. Segura, Auteur ; E. Vercher, Auteur Année de publication : 2011 Article en page(s) : pp. 164–171 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Forecasting Time series Prediction intervals Simulation M3-competition Index. décimale : 001.424 Résumé : Exponential smoothing methods are widely used as forecasting techniques in inventory systems and business planning, where reliable prediction intervals are also required for a large number of series. This paper describes a Bayesian forecasting approach based on the Holt–Winters model, which allows obtaining accurate prediction intervals. We show how to build them incorporating the uncertainty due to the smoothing unknowns using a linear heteroscedastic model. That linear formulation simplifies obtaining the posterior distribution on the unknowns; a random sample from such posterior, which is not analytical, is provided using an acceptance sampling procedure and a Monte Carlo approach gives the predictive distributions. On the basis of this scheme, point-wise forecasts and prediction intervals are obtained. The accuracy of the proposed Bayesian forecasting approach for building prediction intervals is tested using the 3003 time series from the M3-competition. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008152a.html [article] Bayesian forecasting with the Holt–Winters model [texte imprimé] / J. D. Bermúdez, Auteur ; J. V. Segura, Auteur ; E. Vercher, Auteur . - 2011 . - pp. 164–171.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 164–171
Mots-clés : Forecasting Time series Prediction intervals Simulation M3-competition Index. décimale : 001.424 Résumé : Exponential smoothing methods are widely used as forecasting techniques in inventory systems and business planning, where reliable prediction intervals are also required for a large number of series. This paper describes a Bayesian forecasting approach based on the Holt–Winters model, which allows obtaining accurate prediction intervals. We show how to build them incorporating the uncertainty due to the smoothing unknowns using a linear heteroscedastic model. That linear formulation simplifies obtaining the posterior distribution on the unknowns; a random sample from such posterior, which is not analytical, is provided using an acceptance sampling procedure and a Monte Carlo approach gives the predictive distributions. On the basis of this scheme, point-wise forecasts and prediction intervals are obtained. The accuracy of the proposed Bayesian forecasting approach for building prediction intervals is tested using the 3003 time series from the M3-competition. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008152a.html Single-machine scheduling with a sum-of-actual-processing-time-based learning effect / Wang, J.-B. in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 172–177
Titre : Single-machine scheduling with a sum-of-actual-processing-time-based learning effect Type de document : texte imprimé Auteurs : Wang, J.-B., Auteur Année de publication : 2011 Article en page(s) : pp. 172–177 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling Single machine Learning effect Index. décimale : 001.424 Résumé : In this paper we consider the single-machine scheduling problems with a sum-of-actual-processing-time-based learning effect. By the sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is defined by a function of the sum of the actual processing time of the already processed jobs. We show that even with the introduction of the sum-of-actual-processing-time-based learning effect to job processing times, the makespan minimization problem, the total completion time minimization problem, the total completion time square minimization problem, and some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem remain polynomially solvable, respectively. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008146a.html [article] Single-machine scheduling with a sum-of-actual-processing-time-based learning effect [texte imprimé] / Wang, J.-B., Auteur . - 2011 . - pp. 172–177.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 172–177
Mots-clés : Scheduling Single machine Learning effect Index. décimale : 001.424 Résumé : In this paper we consider the single-machine scheduling problems with a sum-of-actual-processing-time-based learning effect. By the sum-of-actual-processing-time-based learning effect, we mean that the processing time of a job is defined by a function of the sum of the actual processing time of the already processed jobs. We show that even with the introduction of the sum-of-actual-processing-time-based learning effect to job processing times, the makespan minimization problem, the total completion time minimization problem, the total completion time square minimization problem, and some special cases of the total weighted completion time minimization problem and the maximum lateness minimization problem remain polynomially solvable, respectively. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008146a.html
Exemplaires
Code-barres | Cote | Support | Localisation | Section | Disponibilité |
---|---|---|---|---|---|
aucun exemplaire |