Dépouillements

Scheduling ambulance crews for maximum coverage / Erdogan, G. in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 543–550 Titre : Scheduling ambulance crews for maximum coverage Type de document : texte imprimé Auteurs : Erdogan, G., Auteur ; A. Ingolfsson, Auteur ; G. Laporte, Auteur Année de publication : 2010 Article en page(s) : pp. 543–550 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Ambulance  location  Shift  scheduling  Tabu  search  Integer  programming Index. décimale : 001.424 Résumé : This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for this subproblem. Two integer programming models that use the output of the tabu search algorithm are constructed for the main problem. Computational experiments with real data are conducted. A comparison of the results of the models is presented. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008163a.html [article] Scheduling ambulance crews for maximum coverage [texte imprimé] / Erdogan, G., Auteur ; A. Ingolfsson, Auteur ; G. Laporte, Auteur . - 2010 . - pp. 543–550. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 543–550 Mots-clés : Ambulance  location  Shift  scheduling  Tabu  search  Integer  programming Index. décimale : 001.424 Résumé : This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is developed. The proposed tabu search algorithm is empirically shown to outperform previous approaches for this subproblem. Two integer programming models that use the output of the tabu search algorithm are constructed for the main problem. Computational experiments with real data are conducted. A comparison of the results of the models is presented. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008163a.html

Fuzzy chance-constrained programming model for a multi-echelon reverse logistics network for household appliances / L. K. Chu in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 551–560 Titre : Fuzzy chance-constrained programming model for a multi-echelon reverse logistics network for household appliances Type de document : texte imprimé Auteurs : L. K. Chu, Auteur ; Y. Shi, Auteur ; Lin, S, Auteur Année de publication : 2010 Article en page(s) : pp. 551–560 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Reverse  logistics  network  Fuzzy-chance  constrained  programming  Hybrid  genetic  algorithm Index. décimale : 001.424 Résumé : Efficient planning and design of an appropriate reverse logistics network is crucial to the economical collection and disposal of scrapped household appliances and electrical products. Such systems are commonly modelled as mixed-integer programs, whose solutions will determine the location of individual facilities that optimize material flow. One of the major drawbacks of current models is that they do not adequately address the important issue of uncertainty in demand and supply. Another deficiency in current models is that they are restricted to a two-echelon system. This study addresses these deficiencies by embodying such uncertainties in the model using the technique of fuzzy-chance constrained programming, and by extending the model to a three-echelon system. A heuristic in the form of a hybrid genetic algorithm is then employed to generate low-cost solutions. The overall objective is to find economical solutions to the general problem of determining the volume of appliances to be moved between the three echelons of customer base to collection sites, collection sites to disposal centres and disposal centre to landfill centre/remanufacturing centre; and to the problems of positioning the disposal centres and the landfill centre/remanufacturing centres within the problem domain. A case example in China is presented and the quality and robustness of the solutions are explored through sensitivity analysis. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008162a.html [article] Fuzzy chance-constrained programming model for a multi-echelon reverse logistics network for household appliances [texte imprimé] / L. K. Chu, Auteur ; Y. Shi, Auteur ; Lin, S, Auteur . - 2010 . - pp. 551–560. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 551–560 Mots-clés : Reverse  logistics  network  Fuzzy-chance  constrained  programming  Hybrid  genetic  algorithm Index. décimale : 001.424 Résumé : Efficient planning and design of an appropriate reverse logistics network is crucial to the economical collection and disposal of scrapped household appliances and electrical products. Such systems are commonly modelled as mixed-integer programs, whose solutions will determine the location of individual facilities that optimize material flow. One of the major drawbacks of current models is that they do not adequately address the important issue of uncertainty in demand and supply. Another deficiency in current models is that they are restricted to a two-echelon system. This study addresses these deficiencies by embodying such uncertainties in the model using the technique of fuzzy-chance constrained programming, and by extending the model to a three-echelon system. A heuristic in the form of a hybrid genetic algorithm is then employed to generate low-cost solutions. The overall objective is to find economical solutions to the general problem of determining the volume of appliances to be moved between the three echelons of customer base to collection sites, collection sites to disposal centres and disposal centre to landfill centre/remanufacturing centre; and to the problems of positioning the disposal centres and the landfill centre/remanufacturing centres within the problem domain. A case example in China is presented and the quality and robustness of the solutions are explored through sensitivity analysis. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008162a.html

Credit rating prediction using ant colony optimization / D. Martens in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 561–573 Titre : Credit rating prediction using ant colony optimization Type de document : texte imprimé Auteurs : D. Martens, Auteur ; Van Gestel, T., Auteur ; De Backer, M., Auteur Année de publication : 2010 Article en page(s) : pp. 561–573 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Ant  colony  optimization  Classification  Credit  scoring  Bankruptcy  prediction  Basel  II Index. décimale : 001.424 Résumé : The introduction of the Basel II Capital Accord has encouraged financial institutions to build internal rating systems assessing the credit risk of their various credit portfolios. One of the key outputs of an internal rating system is the probability of default (PD), which reflects the likelihood that a counterparty will default on his/her financial obligation. Since the PD modelling problem basically boils down to a discrimination problem (defaulter or not), one may rely on the myriad of classification techniques that have been suggested in the literature. However, since the credit risk models will be subject to supervisory review and evaluation, they must be easy to understand and transparent. Hence, techniques such as neural networks or support vector machines are less suitable due to their black box nature. Building upon previous research, we will use AntMiner+ to build internal rating systems for credit risk. AntMiner+ allows to infer a propositional rule set from a given data set, hereby using the principles from Ant Colony Optimization. Experiments will be conducted using various types of credit data sets (retail, small- and medium-sized enterprises and banks). It will be shown that the extracted rule sets are both powerful in terms of discriminatory power and comprehensibility. Furthermore, a framework will be presented describing how AntMiner+ fits into a global Basel II credit risk management system. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008164a.html [article] Credit rating prediction using ant colony optimization [texte imprimé] / D. Martens, Auteur ; Van Gestel, T., Auteur ; De Backer, M., Auteur . - 2010 . - pp. 561–573. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 561–573 Mots-clés : Ant  colony  optimization  Classification  Credit  scoring  Bankruptcy  prediction  Basel  II Index. décimale : 001.424 Résumé : The introduction of the Basel II Capital Accord has encouraged financial institutions to build internal rating systems assessing the credit risk of their various credit portfolios. One of the key outputs of an internal rating system is the probability of default (PD), which reflects the likelihood that a counterparty will default on his/her financial obligation. Since the PD modelling problem basically boils down to a discrimination problem (defaulter or not), one may rely on the myriad of classification techniques that have been suggested in the literature. However, since the credit risk models will be subject to supervisory review and evaluation, they must be easy to understand and transparent. Hence, techniques such as neural networks or support vector machines are less suitable due to their black box nature. Building upon previous research, we will use AntMiner+ to build internal rating systems for credit risk. AntMiner+ allows to infer a propositional rule set from a given data set, hereby using the principles from Ant Colony Optimization. Experiments will be conducted using various types of credit data sets (retail, small- and medium-sized enterprises and banks). It will be shown that the extracted rule sets are both powerful in terms of discriminatory power and comprehensibility. Furthermore, a framework will be presented describing how AntMiner+ fits into a global Basel II credit risk management system. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008164a.html

Enhancing the inclusion of non-discretionary inputs in DEA / J. M. Cordero-Ferrera in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 574–584 Titre : Enhancing the inclusion of non-discretionary inputs in DEA Type de document : texte imprimé Auteurs : J. M. Cordero-Ferrera, Auteur ; F. Pedraja-Chaparro, Auteur ; D. Santín-González, Auteur Année de publication : 2010 Article en page(s) : pp. 574–584 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Data  envelopment  analysis  Bootstrap  Education Index. décimale : 001.424 Résumé : The aim of this paper is to provide an alternative approach for estimating efficiency when a set of decision-making units uses non-discretionary inputs in the productive process. To test the influence of these variables, our proposal uses a multi-stage approach based on Tobit regressions. In order to avoid potential bias, a bootstrap procedure is used to estimate these regressions. This methodology allows enhancing other models previously proposed to introduce non-controllable inputs in data envelopment analysis (DEA) overcoming, thus, some of their main shortcomings. We illustrate our framework with an empirical application on Spanish high schools where non-controllable factors play a major role to explain educational achievements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008189a.html [article] Enhancing the inclusion of non-discretionary inputs in DEA [texte imprimé] / J. M. Cordero-Ferrera, Auteur ; F. Pedraja-Chaparro, Auteur ; D. Santín-González, Auteur . - 2010 . - pp. 574–584. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 574–584 Mots-clés : Data  envelopment  analysis  Bootstrap  Education Index. décimale : 001.424 Résumé : The aim of this paper is to provide an alternative approach for estimating efficiency when a set of decision-making units uses non-discretionary inputs in the productive process. To test the influence of these variables, our proposal uses a multi-stage approach based on Tobit regressions. In order to avoid potential bias, a bootstrap procedure is used to estimate these regressions. This methodology allows enhancing other models previously proposed to introduce non-controllable inputs in data envelopment analysis (DEA) overcoming, thus, some of their main shortcomings. We illustrate our framework with an empirical application on Spanish high schools where non-controllable factors play a major role to explain educational achievements. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008189a.html

Development of utility function for life insurance buyers in the Indian market / Dutta, G. in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 585–593 Titre : Development of utility function for life insurance buyers in the Indian market Type de document : texte imprimé Auteurs : Dutta, G., Auteur ; S. Basu, Auteur ; J. John, Auteur Année de publication : 2010 Article en page(s) : pp. 585–593 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Finance  Mathematical  programming  Utility  theory Index. décimale : 001.424 Résumé : Insurance as a financial instrument has been used for a long time. The dramatic increase in competition within the insurance sector (in terms of providers coupled with awareness for the need for insurance) has concomitantly resulted in more policy options being available in the market. The insurance seller needs to know the buyer's preference for an insurance product accurately. Based on such multi-criterion decision-making, we use a logarithmic goal programming method to develop a linear utility model. The model is then used to develop a ready reckoner for policies that will aid investors in comparing them across various attributes. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200926a.html [article] Development of utility function for life insurance buyers in the Indian market [texte imprimé] / Dutta, G., Auteur ; S. Basu, Auteur ; J. John, Auteur . - 2010 . - pp. 585–593. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 585–593 Mots-clés : Finance  Mathematical  programming  Utility  theory Index. décimale : 001.424 Résumé : Insurance as a financial instrument has been used for a long time. The dramatic increase in competition within the insurance sector (in terms of providers coupled with awareness for the need for insurance) has concomitantly resulted in more policy options being available in the market. The insurance seller needs to know the buyer's preference for an insurance product accurately. Based on such multi-criterion decision-making, we use a logarithmic goal programming method to develop a linear utility model. The model is then used to develop a ready reckoner for policies that will aid investors in comparing them across various attributes. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200926a.html

A tabu search heuristic for ship routing and scheduling / J. E. Korsvik in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 594–603 Titre : A tabu search heuristic for ship routing and scheduling Type de document : texte imprimé Auteurs : J. E. Korsvik, Auteur ; K. Fagerholt, Auteur ; G. Laporte, Auteur Année de publication : 2010 Article en page(s) : pp. 594–603 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Ship  routing  and  scheduling  Tramp  shipping  Tabu  search Index. décimale : 001.424 Résumé : The purpose of this paper is to solve a planning problem faced by many shipping companies dealing with the transport of bulk products. These shipping companies are committed to carrying some contract cargoes and will try to derive additional revenue from optional spot cargoes. An efficient tabu search algorithm has been developed to ensure quick decision support for the planners. The solutions generated by the tabu search heuristic are compared with those produced by a previously published multi-start local search heuristic. Computational results show that the tabu search heuristic yields optimal or near-optimal solutions to real-life instances within reasonable time. For large and tigthly constrained cases, the tabu search heuristic provides much better solutions than the multi-start local search heuristic. A version of the tabu search heuristic will be integrated as an improved solver in a prototype decision support system used by several shipping companies. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008192a.html [article] A tabu search heuristic for ship routing and scheduling [texte imprimé] / J. E. Korsvik, Auteur ; K. Fagerholt, Auteur ; G. Laporte, Auteur . - 2010 . - pp. 594–603. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 594–603 Mots-clés : Ship  routing  and  scheduling  Tramp  shipping  Tabu  search Index. décimale : 001.424 Résumé : The purpose of this paper is to solve a planning problem faced by many shipping companies dealing with the transport of bulk products. These shipping companies are committed to carrying some contract cargoes and will try to derive additional revenue from optional spot cargoes. An efficient tabu search algorithm has been developed to ensure quick decision support for the planners. The solutions generated by the tabu search heuristic are compared with those produced by a previously published multi-start local search heuristic. Computational results show that the tabu search heuristic yields optimal or near-optimal solutions to real-life instances within reasonable time. For large and tigthly constrained cases, the tabu search heuristic provides much better solutions than the multi-start local search heuristic. A version of the tabu search heuristic will be integrated as an improved solver in a prototype decision support system used by several shipping companies. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008192a.html

A compromise solution approach for finding common weights in DEA / M. Zohrehbandian in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 604–610 Titre : A compromise solution approach for finding common weights in DEA : an improvement to Kao and Hung's approach Type de document : texte imprimé Auteurs : M. Zohrehbandian, Auteur ; Ahmad Makui, Auteur ; A. Alinezhad, Auteur Année de publication : 2010 Article en page(s) : pp. 604–610 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : MOLP  Compromise  solution  DEA  Efficiency  Ranking  Weight  restrictions Index. décimale : 001.424 Résumé : Data envelopment analysis (DEA) is the leading technique for measuring the relative efficiency of decision-making units (DMUs) on the basis of multiple inputs and multiple outputs. In this technique, the weights for inputs and outputs are estimated in the best advantage for each unit so as to maximize its relative efficiency. But, this flexibility in selecting the weights deters the comparison among DMUs on a common base. For dealing with this difficulty, Kao and Hung (2005) proposed a compromise solution approach for generating common weights under the DEA framework. The proposed multiple criteria decision-making (MCDM) model was derived from the original non-linear DEA model. This paper presents an improvement to Kao and Hung's approach by means of introducing an MCDM model which is derived from a new linear DEA model. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20094a.html [article] A compromise solution approach for finding common weights in DEA : an improvement to Kao and Hung's approach [texte imprimé] / M. Zohrehbandian, Auteur ; Ahmad Makui, Auteur ; A. Alinezhad, Auteur . - 2010 . - pp. 604–610. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 604–610 Mots-clés : MOLP  Compromise  solution  DEA  Efficiency  Ranking  Weight  restrictions Index. décimale : 001.424 Résumé : Data envelopment analysis (DEA) is the leading technique for measuring the relative efficiency of decision-making units (DMUs) on the basis of multiple inputs and multiple outputs. In this technique, the weights for inputs and outputs are estimated in the best advantage for each unit so as to maximize its relative efficiency. But, this flexibility in selecting the weights deters the comparison among DMUs on a common base. For dealing with this difficulty, Kao and Hung (2005) proposed a compromise solution approach for generating common weights under the DEA framework. The proposed multiple criteria decision-making (MCDM) model was derived from the original non-linear DEA model. This paper presents an improvement to Kao and Hung's approach by means of introducing an MCDM model which is derived from a new linear DEA model. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20094a.html

A modified tabu search algorithm for cost-based job shop problem / Z. C. Zhu in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 611–619 Titre : A modified tabu search algorithm for cost-based job shop problem Type de document : texte imprimé Auteurs : Z. C. Zhu, Auteur ; K. M. Ng, Auteur ; H. L. Ong, Auteur Année de publication : 2010 Article en page(s) : pp. 611–619 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Job  shop  problem  Cost-based  problem  Tabu  search  Neighbourhood  structure  Memory  structure  Filter  structure Index. décimale : 001.424 Résumé : In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished orders, inventory holding cost of finished orders and backorder cost of unfulfilled orders. A modified tabu search (MTS) method is developed to improve the schedule quality by searching the neighbourhood of a feasible schedule iteratively. The MTS method is comprised of three components that help to ensure a more effective searching procedure: neighbourhood structure, memory structure and filter structure. Computational results show that the MTS method significantly improves the initial schedule generated by an arbitrarily selected dispatching rule. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20099a.html [article] A modified tabu search algorithm for cost-based job shop problem [texte imprimé] / Z. C. Zhu, Auteur ; K. M. Ng, Auteur ; H. L. Ong, Auteur . - 2010 . - pp. 611–619. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 611–619 Mots-clés : Job  shop  problem  Cost-based  problem  Tabu  search  Neighbourhood  structure  Memory  structure  Filter  structure Index. décimale : 001.424 Résumé : In this paper, a cost-based job shop problem (JIT-JSP) is proposed to model the multi-order processing procedure in a just-in-time (JIT) environment. The objective of JIT-JSP is to minimize three costs: work-in-process holding cost of half-finished orders, inventory holding cost of finished orders and backorder cost of unfulfilled orders. A modified tabu search (MTS) method is developed to improve the schedule quality by searching the neighbourhood of a feasible schedule iteratively. The MTS method is comprised of three components that help to ensure a more effective searching procedure: neighbourhood structure, memory structure and filter structure. Computational results show that the MTS method significantly improves the initial schedule generated by an arbitrarily selected dispatching rule. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20099a.html

Beam search heuristics for quadratic earliness and tardiness scheduling / J. M. S. Valente in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 620–631 Titre : Beam search heuristics for quadratic earliness and tardiness scheduling Type de document : texte imprimé Auteurs : J. M. S. Valente, Auteur Année de publication : 2010 Article en page(s) : pp. 620–631 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Heuristics  Beam  search  Single  machine  Quadratic  earliness  Quadratic  tardiness Index. décimale : 001.424 Résumé : In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of different rules on the performance of the beam search procedures. The computational results show that using better dispatching heuristics improves the effectiveness of the beam search algorithms. The performance of the several heuristics is similar for instances with low variability. For high variability instances, however, the detailed, filtered and recovering beam search (RBS) procedures clearly outperform the best existing heuristic. The detailed beam search algorithm performs quite well, and is recommended for small- to medium-sized instances. For larger instances, however, this procedure requires excessive computation times, and the RBS algorithm then becomes the heuristic of choice. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008191a.html [article] Beam search heuristics for quadratic earliness and tardiness scheduling [texte imprimé] / J. M. S. Valente, Auteur . - 2010 . - pp. 620–631. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 620–631 Mots-clés : Scheduling  Heuristics  Beam  search  Single  machine  Quadratic  earliness  Quadratic  tardiness Index. décimale : 001.424 Résumé : In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of different rules on the performance of the beam search procedures. The computational results show that using better dispatching heuristics improves the effectiveness of the beam search algorithms. The performance of the several heuristics is similar for instances with low variability. For high variability instances, however, the detailed, filtered and recovering beam search (RBS) procedures clearly outperform the best existing heuristic. The detailed beam search algorithm performs quite well, and is recommended for small- to medium-sized instances. For larger instances, however, this procedure requires excessive computation times, and the RBS algorithm then becomes the heuristic of choice. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008191a.html

A portfolio model for performance assessment: the Financial Times MBA ranking / Jessop, A. in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 632–639 Titre : A portfolio model for performance assessment: the Financial Times MBA ranking Type de document : texte imprimé Auteurs : Jessop, A., Auteur Année de publication : 2010 Article en page(s) : pp. 632–639 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Multicriteria  Quadratic  programming  Performance  MBA Index. décimale : 001.424 Résumé : The ranking of MBA programmes by newspapers and magazines is common and usually controversial. This paper discusses the use of the most popular method of making these rankings via a multicriteria model which uses the weighted sum of a number of performance measures to give an overall score on which selection or ranking may be based. The weights are a quantitative model of the preferences of those making the evaluation. Many methods are available to obtain weights from preference statements so that for any set of preferences a number of different weight sets can be found depending on the method used. Cognitive limits lead to inconsistency in preference judgements so that weights may be subject both to uncertainty and to bias. It is proposed that choosing weights to minimize discrimination between alternatives (not weights) guards against unjustified discrimination between alternatives. Applying the method to data collected by the Financial Times shows the effect of varying the level of discrimination between weights and also the effect of using a reduced data set made necessary by the partial publication of information. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008193a.html [article] A portfolio model for performance assessment: the Financial Times MBA ranking [texte imprimé] / Jessop, A., Auteur . - 2010 . - pp. 632–639. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 632–639 Mots-clés : Multicriteria  Quadratic  programming  Performance  MBA Index. décimale : 001.424 Résumé : The ranking of MBA programmes by newspapers and magazines is common and usually controversial. This paper discusses the use of the most popular method of making these rankings via a multicriteria model which uses the weighted sum of a number of performance measures to give an overall score on which selection or ranking may be based. The weights are a quantitative model of the preferences of those making the evaluation. Many methods are available to obtain weights from preference statements so that for any set of preferences a number of different weight sets can be found depending on the method used. Cognitive limits lead to inconsistency in preference judgements so that weights may be subject both to uncertainty and to bias. It is proposed that choosing weights to minimize discrimination between alternatives (not weights) guards against unjustified discrimination between alternatives. Applying the method to data collected by the Financial Times shows the effect of varying the level of discrimination between weights and also the effect of using a reduced data set made necessary by the partial publication of information. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008193a.html

Parallel machine scheduling with common due windows / R.-H. Huang in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 640–646 Titre : Parallel machine scheduling with common due windows Type de document : texte imprimé Auteurs : R.-H. Huang, Auteur ; C-L. Yang, Auteur ; H-T. Huang, Auteur Année de publication : 2010 Article en page(s) : pp. 640–646 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Operation  scheduling  Parallel  machine  Due  windows  On-time Index. décimale : 001.424 Résumé : With the prevalence of on-time scheduling, timely product submission has become a crucial contributor to customer satisfaction. Studies examining on-time scheduling primarily seek to determine the minimum weighted sum of earliness and tardiness penalties. This study assumes that all machines are identical. Furthermore, this study assumes that jobs are independent and share a common due date window when investigating scheduling problems involving parallel machines with a minimum total number of early and tardy jobs (or maximum number of on-time jobs). This study presents related theorems and a novel simplified algorithm based on the problem. Additionally, rule characteristics are examined, and simulated data are used to verify the effectiveness and timeliness of the proposed algorithm. The theoretical proof and data test results all indicate that the proposed approach obtains the best solution within the shortest time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008184a.html [article] Parallel machine scheduling with common due windows [texte imprimé] / R.-H. Huang, Auteur ; C-L. Yang, Auteur ; H-T. Huang, Auteur . - 2010 . - pp. 640–646. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 640–646 Mots-clés : Operation  scheduling  Parallel  machine  Due  windows  On-time Index. décimale : 001.424 Résumé : With the prevalence of on-time scheduling, timely product submission has become a crucial contributor to customer satisfaction. Studies examining on-time scheduling primarily seek to determine the minimum weighted sum of earliness and tardiness penalties. This study assumes that all machines are identical. Furthermore, this study assumes that jobs are independent and share a common due date window when investigating scheduling problems involving parallel machines with a minimum total number of early and tardy jobs (or maximum number of on-time jobs). This study presents related theorems and a novel simplified algorithm based on the problem. Additionally, rule characteristics are examined, and simulated data are used to verify the effectiveness and timeliness of the proposed algorithm. The theoretical proof and data test results all indicate that the proposed approach obtains the best solution within the shortest time. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors2008184a.html

Do market share and efficiency matter for each other? / J-L. Hu in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 647–657 Titre : Do market share and efficiency matter for each other? : an application of the zero-sum gains data envelopment analysis Type de document : texte imprimé Auteurs : J-L. Hu, Auteur ; C-Y. Fang, Auteur Année de publication : 2010 Article en page(s) : pp. 647–657 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Zero-sum  gains  data  envelopment  analysis  (ZSG-DEA)  Panel  data  Two-stage  least  squares  procedure  (2SLS) Index. décimale : 001.424 Résumé : Current studies that use traditional data envelopment analysis (DEA) neglect the 100% market share restriction. This study adopts zero-sum gains data envelopment analysis to measure the efficiency scores of securities firms (SFs) and indicates that the traditional DEA model underestimates the efficiency scores of inefficient SFs. This research analyses 266 integrated securities firms in Taiwan from 2001 to 2005 and employs three inputs (fixed assets, financial capital, and general expenses) and a single output (market share). The foreign-affiliated ownership of SFs positively affects the efficiency scores. The two-stage least squares procedure confirms that the market share and efficiency score simultaneously reinforce each other. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200911a.html [article] Do market share and efficiency matter for each other? : an application of the zero-sum gains data envelopment analysis [texte imprimé] / J-L. Hu, Auteur ; C-Y. Fang, Auteur . - 2010 . - pp. 647–657. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 647–657 Mots-clés : Zero-sum  gains  data  envelopment  analysis  (ZSG-DEA)  Panel  data  Two-stage  least  squares  procedure  (2SLS) Index. décimale : 001.424 Résumé : Current studies that use traditional data envelopment analysis (DEA) neglect the 100% market share restriction. This study adopts zero-sum gains data envelopment analysis to measure the efficiency scores of securities firms (SFs) and indicates that the traditional DEA model underestimates the efficiency scores of inefficient SFs. This research analyses 266 integrated securities firms in Taiwan from 2001 to 2005 and employs three inputs (fixed assets, financial capital, and general expenses) and a single output (market share). The foreign-affiliated ownership of SFs positively affects the efficiency scores. The two-stage least squares procedure confirms that the market share and efficiency score simultaneously reinforce each other. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200911a.html

Optimization of container process at seaport terminals / A. Wong in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 658–665 Titre : Optimization of container process at seaport terminals Type de document : texte imprimé Auteurs : A. Wong, Auteur ; E. Kozan, Auteur Année de publication : 2010 Article en page(s) : pp. 658–665 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Sea  transport  Logistics  Heuristics Index. décimale : 001.424 Résumé : Seaport container terminals are an important part of the logistics systems in international trades. This paper investigates the relationship between quay cranes, yard machines and container storage locations in a multi-berth and multi-ship environment. The aims are to develop a model for improving the operation efficiency of the seaports and to develop an analytical tool for yard operation planning. Due to the fact that the container transfer times are sequence-dependent and with the large number of variables involved, the proposed model cannot be solved in a reasonable time interval for realistically sized problems. For this reason, List Scheduling and Tabu Search algorithms have been developed to solve this formidable and NP-hard scheduling problem. Numerical implementations have been analysed and promising results have been achieved. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200918a.html [article] Optimization of container process at seaport terminals [texte imprimé] / A. Wong, Auteur ; E. Kozan, Auteur . - 2010 . - pp. 658–665. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 658–665 Mots-clés : Scheduling  Sea  transport  Logistics  Heuristics Index. décimale : 001.424 Résumé : Seaport container terminals are an important part of the logistics systems in international trades. This paper investigates the relationship between quay cranes, yard machines and container storage locations in a multi-berth and multi-ship environment. The aims are to develop a model for improving the operation efficiency of the seaports and to develop an analytical tool for yard operation planning. Due to the fact that the container transfer times are sequence-dependent and with the large number of variables involved, the proposed model cannot be solved in a reasonable time interval for realistically sized problems. For this reason, List Scheduling and Tabu Search algorithms have been developed to solve this formidable and NP-hard scheduling problem. Numerical implementations have been analysed and promising results have been achieved. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200918a.html

Technology credit scoring model considering both SME characteristics and economic conditions / Moon, T. H. in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 666–675 Titre : Technology credit scoring model considering both SME characteristics and economic conditions : the Korean case Type de document : texte imprimé Auteurs : Moon, T. H., Auteur ; Sohn, S. Y., Auteur Année de publication : 2010 Article en page(s) : pp. 666–675 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Technology  evaluation  model  Environmental  condition  Small  and  medium  enterprise  Logistic  regression  model  Factor  analysis  Stress  test Index. décimale : 001.424 Résumé : In order to support small and medium enterprises (SME) with a high degree of growth potential in technology, various kinds of technology credit guarantees are issued to companies that obtain high scores by a technology scorecard in Korea. However, their default rates are reported to be very high. The main goal of this study is to propose a new technology evaluation model that accommodates not only technology-related attributes but also environmental conditions such as firm-specific characteristics and economic situations in the manner of more objective. We then show the superior prediction ability of the proposed model to the existing one. This model also enables to apply to a stress test by considering some worst environmental situations and is expected to be used for the effective management of the various technology funds for SMEs. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20097a.html [article] Technology credit scoring model considering both SME characteristics and economic conditions : the Korean case [texte imprimé] / Moon, T. H., Auteur ; Sohn, S. Y., Auteur . - 2010 . - pp. 666–675. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 666–675 Mots-clés : Technology  evaluation  model  Environmental  condition  Small  and  medium  enterprise  Logistic  regression  model  Factor  analysis  Stress  test Index. décimale : 001.424 Résumé : In order to support small and medium enterprises (SME) with a high degree of growth potential in technology, various kinds of technology credit guarantees are issued to companies that obtain high scores by a technology scorecard in Korea. However, their default rates are reported to be very high. The main goal of this study is to propose a new technology evaluation model that accommodates not only technology-related attributes but also environmental conditions such as firm-specific characteristics and economic situations in the manner of more objective. We then show the superior prediction ability of the proposed model to the existing one. This model also enables to apply to a stress test by considering some worst environmental situations and is expected to be used for the effective management of the various technology funds for SMEs. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors20097a.html

Linear programming based approaches for the discrete time/cost trade-off problem in project networks / A. B. Hafizoglu in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 676–685 Titre : Linear programming based approaches for the discrete time/cost trade-off problem in project networks Type de document : texte imprimé Auteurs : A. B. Hafizoglu, Auteur ; Azizoglu, M., Auteur Année de publication : 2010 Article en page(s) : pp. 676–685 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Project  management  Time/cost  trade-off  Linear  programming  Branch  and  bound Index. décimale : 001.424 Résumé : In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the project duration. To solve the Deadline Problem, we propose optimization and approximation algorithms that are based on the optimal Linear Programming Relaxation solutions. Our computational results from large-sized problem instances reveal the satisfactory behaviour of our algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200920a.html [article] Linear programming based approaches for the discrete time/cost trade-off problem in project networks [texte imprimé] / A. B. Hafizoglu, Auteur ; Azizoglu, M., Auteur . - 2010 . - pp. 676–685. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 676–685 Mots-clés : Project  management  Time/cost  trade-off  Linear  programming  Branch  and  bound Index. décimale : 001.424 Résumé : In project management, the activity durations can often be reduced by dedicating additional resources. The Time/Cost Trade-off Problem considers the compromise between the total cost and the project duration. The discrete version of the problem assumes a number of time/cost pairs, called modes, and selects a mode for each activity. In this paper, we consider the Discrete Time/Cost Trade-off Problem. We study the Deadline Problem, that is, the problem of minimizing total cost subject to a deadline on the project duration. To solve the Deadline Problem, we propose optimization and approximation algorithms that are based on the optimal Linear Programming Relaxation solutions. Our computational results from large-sized problem instances reveal the satisfactory behaviour of our algorithms. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200920a.html

Comparison of policies in dynamic routing problems / E. Angelelli in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 686–695 Titre : Comparison of policies in dynamic routing problems Type de document : texte imprimé Auteurs : E. Angelelli, Auteur ; N. Bianchessi, Auteur ; R. Mansini, Auteur Année de publication : 2010 Article en page(s) : pp. 686–695 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Dynamic  multi-period  routing  problems  Postponable  requests  Management  policies Index. décimale : 001.424 Résumé : We consider a company that has to satisfy customers' pick-up requests arriving over time every day. The overall objective of the company is to serve as many requests as possible at a minimum operational cost. When organizing its business the company has to fix some features of the service that may affect both service quality and operational costs. Some of these features concern the time a request is taken into account to plan its service, the associated deadline and the way requests are managed when the system is overloaded. In this paper we analyse several policies that can be implemented by the management of a carrier company in a multi-period context. For example, a company might reject all the requests that cannot be feasibly scheduled or accept all the requests and rely on a backup service in order to serve requests that are difficult to handle. Another interesting issue considered in this paper is the impact of collaborative service where two or more carrier companies, with their own customers, decide to share customers in order to optimize the overall costs. We set up a general framework to allow comparison of alternative service policies. Extensive computational results evaluating the number of lost requests and the distance travelled provide interesting insights. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200917a.html [article] Comparison of policies in dynamic routing problems [texte imprimé] / E. Angelelli, Auteur ; N. Bianchessi, Auteur ; R. Mansini, Auteur . - 2010 . - pp. 686–695. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 686–695 Mots-clés : Dynamic  multi-period  routing  problems  Postponable  requests  Management  policies Index. décimale : 001.424 Résumé : We consider a company that has to satisfy customers' pick-up requests arriving over time every day. The overall objective of the company is to serve as many requests as possible at a minimum operational cost. When organizing its business the company has to fix some features of the service that may affect both service quality and operational costs. Some of these features concern the time a request is taken into account to plan its service, the associated deadline and the way requests are managed when the system is overloaded. In this paper we analyse several policies that can be implemented by the management of a carrier company in a multi-period context. For example, a company might reject all the requests that cannot be feasibly scheduled or accept all the requests and rely on a backup service in order to serve requests that are difficult to handle. Another interesting issue considered in this paper is the impact of collaborative service where two or more carrier companies, with their own customers, decide to share customers in order to optimize the overall costs. We set up a general framework to allow comparison of alternative service policies. Extensive computational results evaluating the number of lost requests and the distance travelled provide interesting insights. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200917a.html

Effect of declining selling price / S. Banerjee in Journal of the operational research society (JORS), Vol. 61 N° 4 (Avril 2010) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 696–704 Titre : Effect of declining selling price : profit analysis for a single period inventory model with stochastic demand and lead time Type de document : texte imprimé Auteurs : S. Banerjee, Auteur ; N. S. Meitei, Auteur Année de publication : 2010 Article en page(s) : pp. 696–704 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Inventory  Random  lead  time  Declining  selling  price  Lost  sales  shortage Index. décimale : 001.424 Résumé : In this paper, considering the empirical trend for sales and price of fashion apparels as prototype, optimal ordering policy for a single period stochastic inventory model is investigated. The impact of the presence of random lead time and declining selling price on the profitability of the retailer is explored. Existence of unique optimal solutions for net profit functions is proved. Numerical examples are presented to illustrate the method of identifying profitable levels of inventory holding and penalty costs. Percentage profit per unit investment in inventory is obtained in order to assist managers in taking business decisions, specifically to the extent of whether or not to take up a particular business under known constraints. It is demonstrated that the optimal inventory policy in the absence of price decline and lead time differs considerably from that when lead time and price decline are simultaneously considered. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200928a.html [article] Effect of declining selling price : profit analysis for a single period inventory model with stochastic demand and lead time [texte imprimé] / S. Banerjee, Auteur ; N. S. Meitei, Auteur . - 2010 . - pp. 696–704. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 4 (Avril 2010) . - pp. 696–704 Mots-clés : Inventory  Random  lead  time  Declining  selling  price  Lost  sales  shortage Index. décimale : 001.424 Résumé : In this paper, considering the empirical trend for sales and price of fashion apparels as prototype, optimal ordering policy for a single period stochastic inventory model is investigated. The impact of the presence of random lead time and declining selling price on the profitability of the retailer is explored. Existence of unique optimal solutions for net profit functions is proved. Numerical examples are presented to illustrate the method of identifying profitable levels of inventory holding and penalty costs. Percentage profit per unit investment in inventory is obtained in order to assist managers in taking business decisions, specifically to the extent of whether or not to take up a particular business under known constraints. It is demonstrated that the optimal inventory policy in the absence of price decline and lead time differs considerably from that when lead time and price decline are simultaneously considered. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n4/abs/jors200928a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse