Dépouillements

How to treat strict preference information in multicriteria decision analysis / K. S. Park in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1771–1783 Titre : How to treat strict preference information in multicriteria decision analysis Type de document : texte imprimé Auteurs : K. S. Park, Auteur ; I. Jeong, Auteur Année de publication : 2011 Article en page(s) : pp. 1771–1783 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Multicriteria  decision  analysis  Incomplete  information  Strict  inequality  Dominance  Potential  optimality  Market  entry  decision Index. décimale : 001.424 Résumé : This paper addresses the use of incomplete information on both multi-criteria alternative values and importance weights in evaluating decision alternatives. Incomplete information frequently takes the form of strict inequalities, such as strict orders and strict bounds. En route to prioritizing alternatives, the majority of previous studies have replaced these strict inequalities with weak inequalities, by employing a small positive number. As this replacement closes the feasible region of decision parameters, it circumvents certain troubling questions that arise when utilizing a mathematical programming approach to evaluate alternatives. However, there are no hard and fast rules for selecting the factual small value and, even if the choice is possible, the resultant prioritizations depend profoundly on that choice. The method developed herein addresses and overcomes this drawback, and allows for dominance and potential optimality among alternatives, without selecting any small value for the strict preference information. Given strict information on criterion weights alone, we form a linear program and solve it via a two-stage method. When both alternative values and weights are provided in the form of strict inequalities, we first construct a nonlinear program, transform it into a linear programming equivalent, and finally solve this linear program via the same two-stage method. One application of this methodology to a market entry decision, a salient subject in the area of international marketing, is demonstrated in detail herein. DEWEY : 01.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010155a.html [article] How to treat strict preference information in multicriteria decision analysis [texte imprimé] / K. S. Park, Auteur ; I. Jeong, Auteur . - 2011 . - pp. 1771–1783. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1771–1783 Mots-clés : Multicriteria  decision  analysis  Incomplete  information  Strict  inequality  Dominance  Potential  optimality  Market  entry  decision Index. décimale : 001.424 Résumé : This paper addresses the use of incomplete information on both multi-criteria alternative values and importance weights in evaluating decision alternatives. Incomplete information frequently takes the form of strict inequalities, such as strict orders and strict bounds. En route to prioritizing alternatives, the majority of previous studies have replaced these strict inequalities with weak inequalities, by employing a small positive number. As this replacement closes the feasible region of decision parameters, it circumvents certain troubling questions that arise when utilizing a mathematical programming approach to evaluate alternatives. However, there are no hard and fast rules for selecting the factual small value and, even if the choice is possible, the resultant prioritizations depend profoundly on that choice. The method developed herein addresses and overcomes this drawback, and allows for dominance and potential optimality among alternatives, without selecting any small value for the strict preference information. Given strict information on criterion weights alone, we form a linear program and solve it via a two-stage method. When both alternative values and weights are provided in the form of strict inequalities, we first construct a nonlinear program, transform it into a linear programming equivalent, and finally solve this linear program via the same two-stage method. One application of this methodology to a market entry decision, a salient subject in the area of international marketing, is demonstrated in detail herein. DEWEY : 01.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010155a.html

Strategic design of competing supply chain networks for inelastic demand / S. Rezapour in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1784–1795 Titre : Strategic design of competing supply chain networks for inelastic demand Type de document : texte imprimé Auteurs : S. Rezapour, Auteur ; Reza Zanjirani Farahani, Auteur ; Drezner, T., Auteur Année de publication : 2011 Article en page(s) : pp. 1784–1795 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Supply  chains  Network  design  Mixed  integer  non-linear  programming  Static  competition Index. décimale : 001.424 Résumé : A model for designing the network of a new entrant supply chain under inelastic demand and in the presence of pre-existing competing chains is proposed. These supply chains provide an identical product for a market area. The model considers the location of distribution centres and retail outlets on a discrete set of potential locations. The assumptions of the model are: (1) static competition between the new and pre-existing chains and (2) a probabilistic customer behaviour based on an attraction function depending on both the location and the quality of the retailers. This model also incorporates the impact of the facilities’ location decisions on the operational inventory and shipment decisions. The resulting model is formulated as a mixed integer non-linear programme (MINLP). To solve the MINLP it is transformed to a linear one. We illustrate the model, discuss the results of a real-world case, and investigate the effectiveness of the proposed algorithm using randomly generated examples. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010146a.html [article] Strategic design of competing supply chain networks for inelastic demand [texte imprimé] / S. Rezapour, Auteur ; Reza Zanjirani Farahani, Auteur ; Drezner, T., Auteur . - 2011 . - pp. 1784–1795. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1784–1795 Mots-clés : Supply  chains  Network  design  Mixed  integer  non-linear  programming  Static  competition Index. décimale : 001.424 Résumé : A model for designing the network of a new entrant supply chain under inelastic demand and in the presence of pre-existing competing chains is proposed. These supply chains provide an identical product for a market area. The model considers the location of distribution centres and retail outlets on a discrete set of potential locations. The assumptions of the model are: (1) static competition between the new and pre-existing chains and (2) a probabilistic customer behaviour based on an attraction function depending on both the location and the quality of the retailers. This model also incorporates the impact of the facilities’ location decisions on the operational inventory and shipment decisions. The resulting model is formulated as a mixed integer non-linear programme (MINLP). To solve the MINLP it is transformed to a linear one. We illustrate the model, discuss the results of a real-world case, and investigate the effectiveness of the proposed algorithm using randomly generated examples. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010146a.html

Finding common weights based on the DM's preference information / G. R. Jahanshahloo in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1796–1800 Titre : Finding common weights based on the DM's preference information Type de document : texte imprimé Auteurs : G. R. Jahanshahloo, Auteur ; M. Zohrehbandian, Auteur ; A. Alinezhad, Auteur Année de publication : 2011 Article en page(s) : pp. 1796–1800 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Efficiency  analysis  Data  envelopment  analysis  Common  weights  Multiple  criteria  decision  making  Value  function Index. décimale : 001.424 Résumé : Data Envelopment Analysis (DEA) is basically a linear programming-based technique used for measuring the relative performance of organizational units, referred to as Decision Making Units (DMUs). The flexibility in selecting the weights in standard DEA models deters the comparison among DMUs on a common base. Moreover, these weights are not suitable to measure the preferences of a decision maker (DM). For dealing with the first difficulty, the concept of common weights was proposed in the DEA literature. But, none of the common weights approaches address the second difficulty. This paper proposes an alternative approach that we term as ‘preference common weights’, which is both practical and intellectually consistent with the DEA philosophy. To do this, we introduce a multiple objective linear programming model in which objective functions are input/output variables subject to the constraints similar to the equations that define production possibility set of standard DEA models. Then by using the Zionts–Wallenius method, we can generate common weights as the DM's underlying value structure about objective functions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010156a.html [article] Finding common weights based on the DM's preference information [texte imprimé] / G. R. Jahanshahloo, Auteur ; M. Zohrehbandian, Auteur ; A. Alinezhad, Auteur . - 2011 . - pp. 1796–1800. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1796–1800 Mots-clés : Efficiency  analysis  Data  envelopment  analysis  Common  weights  Multiple  criteria  decision  making  Value  function Index. décimale : 001.424 Résumé : Data Envelopment Analysis (DEA) is basically a linear programming-based technique used for measuring the relative performance of organizational units, referred to as Decision Making Units (DMUs). The flexibility in selecting the weights in standard DEA models deters the comparison among DMUs on a common base. Moreover, these weights are not suitable to measure the preferences of a decision maker (DM). For dealing with the first difficulty, the concept of common weights was proposed in the DEA literature. But, none of the common weights approaches address the second difficulty. This paper proposes an alternative approach that we term as ‘preference common weights’, which is both practical and intellectually consistent with the DEA philosophy. To do this, we introduce a multiple objective linear programming model in which objective functions are input/output variables subject to the constraints similar to the equations that define production possibility set of standard DEA models. Then by using the Zionts–Wallenius method, we can generate common weights as the DM's underlying value structure about objective functions. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010156a.html

Does AHP help us make a choice? / Ishizaka, A. in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1801–1812 Titre : Does AHP help us make a choice? : an experimental evaluation Type de document : texte imprimé Auteurs : Ishizaka, A., Auteur ; Balkenborg, D., Auteur ; Kaplan, T., Auteur Année de publication : 2011 Article en page(s) : pp. 1801–1812 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Decision  analysis  Multiple  criteria  decision  aid  Analytic  hierarchy  process  (AHP)  Validation  Experimental  economics Index. décimale : 001.424 Résumé : In this paper, we use experimental economics methods to test how well Analytic Hierarchy Process (AHP) fares as a choice support system in a real decision problem. AHP provides a ranking that we statistically compare with three additional rankings given by the subjects in the experiment: one at the beginning, one after providing AHP with the necessary pair-wise comparisons and one after learning the ranking provided by AHP. While the rankings vary widely across subjects, we observe that for each individual all four rankings are similar. Hence, subjects are consistent and AHP is, for the most part, able to replicate their rankings. Furthermore, while the rankings are similar, we do find that the AHP ranking helps the decision makers reformulate their choices by taking into account suggestions made by AHP. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010158a.html [article] Does AHP help us make a choice? : an experimental evaluation [texte imprimé] / Ishizaka, A., Auteur ; Balkenborg, D., Auteur ; Kaplan, T., Auteur . - 2011 . - pp. 1801–1812. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1801–1812 Mots-clés : Decision  analysis  Multiple  criteria  decision  aid  Analytic  hierarchy  process  (AHP)  Validation  Experimental  economics Index. décimale : 001.424 Résumé : In this paper, we use experimental economics methods to test how well Analytic Hierarchy Process (AHP) fares as a choice support system in a real decision problem. AHP provides a ranking that we statistically compare with three additional rankings given by the subjects in the experiment: one at the beginning, one after providing AHP with the necessary pair-wise comparisons and one after learning the ranking provided by AHP. While the rankings vary widely across subjects, we observe that for each individual all four rankings are similar. Hence, subjects are consistent and AHP is, for the most part, able to replicate their rankings. Furthermore, while the rankings are similar, we do find that the AHP ranking helps the decision makers reformulate their choices by taking into account suggestions made by AHP. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010158a.html

Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem / Altinel, I. K. in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1813–1826 Titre : Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem Type de document : texte imprimé Auteurs : Altinel, I. K., Auteur ; N. Aras, Auteur ; Özkisacik, K. C., Auteur Année de publication : 2011 Article en page(s) : pp. 1813–1826 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Facility  location-allocation  Variable  neighbourhood  search  Probabilistic  Weber  problem  Heuristics Index. décimale : 001.424 Résumé : The Multi-source Weber Problem (MWP) is concerned with locating m facilities in the Euclidean plane, and allocating these facilities to n customers at minimum total cost. The deterministic version of the problem, which assumes that customer locations and demands are known with certainty, is a non-convex optimization problem and difficult to solve. In this work, we focus on a probabilistic extension and consider the situation where customer locations are randomly distributed according to a bivariate distribution. We first present a mathematical programming formulation for the probabilistic MWP called the PMWP. For its solution, we propose two heuristics based on variable neighbourhood search (VNS). Computational results obtained on a number of test instances show that the VNS heuristics improve the performance of a probabilistic alternate location-allocation heuristic referred to as PALA. In its original form, the applicability of the new heuristics depends on the existence of a closed-form expression for the expected distances between facilities and customers. Unfortunately, such an expression exists only for a few distance function and probability distribution combinations. We therefore use two approximation methods for the expected distances, which make the VNS heuristics applicable for any distance function and bivariate distribution of customer locations. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010159a.html [article] Variable neighbourhood search heuristics for the probabilistic multi-source Weber problem [texte imprimé] / Altinel, I. K., Auteur ; N. Aras, Auteur ; Özkisacik, K. C., Auteur . - 2011 . - pp. 1813–1826. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1813–1826 Mots-clés : Facility  location-allocation  Variable  neighbourhood  search  Probabilistic  Weber  problem  Heuristics Index. décimale : 001.424 Résumé : The Multi-source Weber Problem (MWP) is concerned with locating m facilities in the Euclidean plane, and allocating these facilities to n customers at minimum total cost. The deterministic version of the problem, which assumes that customer locations and demands are known with certainty, is a non-convex optimization problem and difficult to solve. In this work, we focus on a probabilistic extension and consider the situation where customer locations are randomly distributed according to a bivariate distribution. We first present a mathematical programming formulation for the probabilistic MWP called the PMWP. For its solution, we propose two heuristics based on variable neighbourhood search (VNS). Computational results obtained on a number of test instances show that the VNS heuristics improve the performance of a probabilistic alternate location-allocation heuristic referred to as PALA. In its original form, the applicability of the new heuristics depends on the existence of a closed-form expression for the expected distances between facilities and customers. Unfortunately, such an expression exists only for a few distance function and probability distribution combinations. We therefore use two approximation methods for the expected distances, which make the VNS heuristics applicable for any distance function and bivariate distribution of customer locations. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010159a.html

Pickup and delivery network segmentation using contiguous geographic clustering / A. I. Jarrah in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1827–1843 Titre : Pickup and delivery network segmentation using contiguous geographic clustering Type de document : texte imprimé Auteurs : A. I. Jarrah, Auteur ; J. F. Bard, Auteur Année de publication : 2011 Article en page(s) : pp. 1827–1843 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Clustering  Pickup  and  delivery  operations  Heuristic  column  generation  Aggregation Index. décimale : 001.424 Résumé : This paper addresses the problem of partitioning a local service region into nonoverlapping work areas in which pickups and deliveries are made throughout the day. For a fleet of homogeneous vehicles, a given set of customers, and expected demand for service, the objective is to find the least number of work areas or clusters that satisfy a variety of geometric and capacity constraints. Using rectangles as the basic shape, each cluster must have an aspect ratio that falls within certain bounds, as well as meet load and time requirements dictated by the capacity of a vehicle and the working hours in a day, respectively. The latter requirement presents a unique hurdle because travel times are a function of the actual routes followed by the drivers, and are not known, even in a probabilistic sense, until the clusters are formed. A novel aspect of the paper is the method proposed for dealing with this uncertainty. The problem is modelled using a compact set-covering formulation and is solved with an adaptive column generation heuristic. Because it is not possible to efficiently represent all the constraints in algebraic form, thus allowing a Dantzig-Wolfe decomposition, a constructive approach was taken. The first step involved generating a subset of attractive clusters from seed customers scattered throughout the service region and then iteratively pricing them out to obtain a relaxed solution to the set-covering model. To find integer solutions, a three-phase variable fixing scheme was designed with the aim of balancing solution quality with runtimes. The full methodology was tested on six data sets provided by an internationally known express package carrier. The results showed that vehicle reductions averaging 7.6% could be realized by adopting the configurations derived from the proposed approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010123a.html [article] Pickup and delivery network segmentation using contiguous geographic clustering [texte imprimé] / A. I. Jarrah, Auteur ; J. F. Bard, Auteur . - 2011 . - pp. 1827–1843. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1827–1843 Mots-clés : Clustering  Pickup  and  delivery  operations  Heuristic  column  generation  Aggregation Index. décimale : 001.424 Résumé : This paper addresses the problem of partitioning a local service region into nonoverlapping work areas in which pickups and deliveries are made throughout the day. For a fleet of homogeneous vehicles, a given set of customers, and expected demand for service, the objective is to find the least number of work areas or clusters that satisfy a variety of geometric and capacity constraints. Using rectangles as the basic shape, each cluster must have an aspect ratio that falls within certain bounds, as well as meet load and time requirements dictated by the capacity of a vehicle and the working hours in a day, respectively. The latter requirement presents a unique hurdle because travel times are a function of the actual routes followed by the drivers, and are not known, even in a probabilistic sense, until the clusters are formed. A novel aspect of the paper is the method proposed for dealing with this uncertainty. The problem is modelled using a compact set-covering formulation and is solved with an adaptive column generation heuristic. Because it is not possible to efficiently represent all the constraints in algebraic form, thus allowing a Dantzig-Wolfe decomposition, a constructive approach was taken. The first step involved generating a subset of attractive clusters from seed customers scattered throughout the service region and then iteratively pricing them out to obtain a relaxed solution to the set-covering model. To find integer solutions, a three-phase variable fixing scheme was designed with the aim of balancing solution quality with runtimes. The full methodology was tested on six data sets provided by an internationally known express package carrier. The results showed that vehicle reductions averaging 7.6% could be realized by adopting the configurations derived from the proposed approach. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010123a.html

Computing confidence intervals for output-oriented DEA models / G. Souza in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1844–1850 Titre : Computing confidence intervals for output-oriented DEA models : an application to agricultural research in Brazil Type de document : texte imprimé Auteurs : G. Souza, Auteur ; M. Souza, Auteur ; E. Gomes, Auteur Année de publication : 2011 Article en page(s) : pp. 1844–1850 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Data  envelopment  analysis  Confidence  intervals  Hootstrap  Agricultural  research Index. décimale : 001.424 Résumé : We define and model the research production at Embrapa, the major Brazilian institution responsible for applied agricultural research. The main theoretical framework is data envelopment analysis. We explore the economic interpretation and the statistical properties of these models to compute confidence intervals for output-oriented efficiency measurements. It was based on a parametric flexible model, defined by the truncated normal distribution. Intervals are calculated exploring a bootstrap approach. These results provide a better insight on the efficiency classification and allow comparisons among the decision making units involved in the evaluation process, taking into account random errors and inefficiency random variation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010137a.html [article] Computing confidence intervals for output-oriented DEA models : an application to agricultural research in Brazil [texte imprimé] / G. Souza, Auteur ; M. Souza, Auteur ; E. Gomes, Auteur . - 2011 . - pp. 1844–1850. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1844–1850 Mots-clés : Data  envelopment  analysis  Confidence  intervals  Hootstrap  Agricultural  research Index. décimale : 001.424 Résumé : We define and model the research production at Embrapa, the major Brazilian institution responsible for applied agricultural research. The main theoretical framework is data envelopment analysis. We explore the economic interpretation and the statistical properties of these models to compute confidence intervals for output-oriented efficiency measurements. It was based on a parametric flexible model, defined by the truncated normal distribution. Intervals are calculated exploring a bootstrap approach. These results provide a better insight on the efficiency classification and allow comparisons among the decision making units involved in the evaluation process, taking into account random errors and inefficiency random variation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010137a.html

An exact approach for relating recovering surgical patient workload to the master surgical schedule / P. T. Vanberkel in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1851–1860 Titre : An exact approach for relating recovering surgical patient workload to the master surgical schedule Type de document : texte imprimé Auteurs : P. T. Vanberkel, Auteur ; Boucherie, R. J., Auteur ; E. W. Hans, Auteur Année de publication : 2011 Article en page(s) : pp. 1851–1860 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Probability  Queueing  Hospitals  Surgical  scheduling  Ward  occupancy Index. décimale : 001.424 Résumé : No other department influences the workload of a hospital more than the Department of Surgery and in particular, the activities in the operating room. These activities are governed by the master surgical schedule (MSS), which states which patient types receive surgery on which day. In this paper, we describe an analytical approach to project the workload for downstream departments based on this MSS. Specifically, the ward occupancy distributions, patient admission/discharge distributions and the distributions for ongoing interventions/treatments are computed. Recovering after surgery requires the support of multiple departments, such as nursing, physiotherapy, rehabilitation and long-term care. With our model, managers from these departments can determine their workload by aggregating tasks associated with recovering surgical patients. The model, which supported the development of a new MSS at the Netherlands Cancer Institute–Antoni van Leeuwenhoek Hospital, provides the foundation for a decision support tool to relate downstream hospital departments to the operating room. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010141a.html [article] An exact approach for relating recovering surgical patient workload to the master surgical schedule [texte imprimé] / P. T. Vanberkel, Auteur ; Boucherie, R. J., Auteur ; E. W. Hans, Auteur . - 2011 . - pp. 1851–1860. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1851–1860 Mots-clés : Probability  Queueing  Hospitals  Surgical  scheduling  Ward  occupancy Index. décimale : 001.424 Résumé : No other department influences the workload of a hospital more than the Department of Surgery and in particular, the activities in the operating room. These activities are governed by the master surgical schedule (MSS), which states which patient types receive surgery on which day. In this paper, we describe an analytical approach to project the workload for downstream departments based on this MSS. Specifically, the ward occupancy distributions, patient admission/discharge distributions and the distributions for ongoing interventions/treatments are computed. Recovering after surgery requires the support of multiple departments, such as nursing, physiotherapy, rehabilitation and long-term care. With our model, managers from these departments can determine their workload by aggregating tasks associated with recovering surgical patients. The model, which supported the development of a new MSS at the Netherlands Cancer Institute–Antoni van Leeuwenhoek Hospital, provides the foundation for a decision support tool to relate downstream hospital departments to the operating room. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010141a.html

A hierarchical decomposition approach to retail shelf space management and assortment decisions / J. Irion in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1861–1870 Titre : A hierarchical decomposition approach to retail shelf space management and assortment decisions Type de document : texte imprimé Auteurs : J. Irion, Auteur ; J-C. Lu, Auteur ; F. A. Al-Khayyal, Auteur Année de publication : 2011 Article en page(s) : pp. 1861–1870 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Shelf  management  Assortment  Allocation  Hierarchical  decomposition  technique Index. décimale : 001.424 Résumé : Shelf management is a crucial task in retailing. Because of the large number of products found in most retail stores (sometimes more than 60 000), current shelf space management models can only solve sub-problems of the overall store optimization problem, since the size of the complete optimization problem would be prohibitively large. Consequently, an optimal allocation of store shelf space to products has not yet been achieved. We show that a hierarchical decomposition technique, consisting of two interwoven models, is suitable to overcome this limitation and, thus, is capable of finding accurate solutions to very large and complex shelf space management problems. We further conclude that other important variables (such as product-price) can be included into the methodology and their optimal values can be determined using the same solution technique. Our methodology is illustrated on a real-life application where we predict a 22.33% increase in store profits if our model's solution is implemented. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010147a.html [article] A hierarchical decomposition approach to retail shelf space management and assortment decisions [texte imprimé] / J. Irion, Auteur ; J-C. Lu, Auteur ; F. A. Al-Khayyal, Auteur . - 2011 . - pp. 1861–1870. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1861–1870 Mots-clés : Shelf  management  Assortment  Allocation  Hierarchical  decomposition  technique Index. décimale : 001.424 Résumé : Shelf management is a crucial task in retailing. Because of the large number of products found in most retail stores (sometimes more than 60 000), current shelf space management models can only solve sub-problems of the overall store optimization problem, since the size of the complete optimization problem would be prohibitively large. Consequently, an optimal allocation of store shelf space to products has not yet been achieved. We show that a hierarchical decomposition technique, consisting of two interwoven models, is suitable to overcome this limitation and, thus, is capable of finding accurate solutions to very large and complex shelf space management problems. We further conclude that other important variables (such as product-price) can be included into the methodology and their optimal values can be determined using the same solution technique. Our methodology is illustrated on a real-life application where we predict a 22.33% increase in store profits if our model's solution is implemented. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010147a.html

Measuring potential gains from specialization under non-convex technologies / S. Blancard in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1871–1880 Titre : Measuring potential gains from specialization under non-convex technologies Type de document : texte imprimé Auteurs : S. Blancard, Auteur ; J.-P. Boussemart, Auteur ; H. Leleu, Auteur Année de publication : 2011 Article en page(s) : pp. 1871–1880 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Specialization  Free  coordination  hull  Free  disposal  hull  Agriculture Index. décimale : 001.424 Résumé : In this paper, the Free Coordination Hull (FCH) approach developed by Green and Cook (2004) is combined with the Free Disposal Hull (FDH) model to detect potential gains from specialization. As a non-convex approach that allows both directly observed and summed Decision Making Units to define the production technology, FCH is the relevant model for analysing optimal reallocation of activity among smaller and more specialized units. Indeed in more traditional Data Envelopment Analysis models the convexity assumption precludes the possibility of detecting potential gains from specialization and can only reveal economies of scope. Therefore non-convex technologies are required to model diseconomies of scope. On the basis of FDH and FCH technologies, an overall efficiency measure is decomposed into three components, namely: technical, size and specialization efficiencies. A 2003 database of French farms is used as an illustration. Results indicate that input inefficiency in the agricultural sector is mainly driven by a lack of specialization, which represents approximately 50% of the overall inefficiency. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010148a.html [article] Measuring potential gains from specialization under non-convex technologies [texte imprimé] / S. Blancard, Auteur ; J.-P. Boussemart, Auteur ; H. Leleu, Auteur . - 2011 . - pp. 1871–1880. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1871–1880 Mots-clés : Specialization  Free  coordination  hull  Free  disposal  hull  Agriculture Index. décimale : 001.424 Résumé : In this paper, the Free Coordination Hull (FCH) approach developed by Green and Cook (2004) is combined with the Free Disposal Hull (FDH) model to detect potential gains from specialization. As a non-convex approach that allows both directly observed and summed Decision Making Units to define the production technology, FCH is the relevant model for analysing optimal reallocation of activity among smaller and more specialized units. Indeed in more traditional Data Envelopment Analysis models the convexity assumption precludes the possibility of detecting potential gains from specialization and can only reveal economies of scope. Therefore non-convex technologies are required to model diseconomies of scope. On the basis of FDH and FCH technologies, an overall efficiency measure is decomposed into three components, namely: technical, size and specialization efficiencies. A 2003 database of French farms is used as an illustration. Results indicate that input inefficiency in the agricultural sector is mainly driven by a lack of specialization, which represents approximately 50% of the overall inefficiency. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010148a.html

Output-specific input-assurance regions in DEA / W. D. Cook in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1881–1887 Titre : Output-specific input-assurance regions in DEA Type de document : texte imprimé Auteurs : W. D. Cook, Auteur ; Zhu, J., Auteur Année de publication : 2011 Article en page(s) : pp. 1881–1887 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : DEA  Multiple  components  Assurance  regions  Divisible  inputs Index. décimale : 001.424 Résumé : The use of assurance region (AR) constraints to restrict multipliers in data envelopment analysis (DEA) is well-established, and has been discussed at length in the literature. The conventional assumption in imposing such restrictions is that they apply universally. Specifically, AR constraints on input multipliers are intended to control the relative importance of the individual inputs in terms of how they impact the entire bundle of outputs. In many settings the relative importance of inputs is different for some of the outputs than for others. A typical example of this in the financial services sector is where the importance of sales staff versus service staff is different in regard to sales outputs than is true for service outputs. In this paper we develop a general DEA framework that incorporates multiple input-AR structures that cater to multiple output classes. We examine the cases of both divisible and indivisible inputs, and as well as mutually exclusive and overlapping output sets. The concepts are applied to a financial services situation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010150a.html [article] Output-specific input-assurance regions in DEA [texte imprimé] / W. D. Cook, Auteur ; Zhu, J., Auteur . - 2011 . - pp. 1881–1887. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1881–1887 Mots-clés : DEA  Multiple  components  Assurance  regions  Divisible  inputs Index. décimale : 001.424 Résumé : The use of assurance region (AR) constraints to restrict multipliers in data envelopment analysis (DEA) is well-established, and has been discussed at length in the literature. The conventional assumption in imposing such restrictions is that they apply universally. Specifically, AR constraints on input multipliers are intended to control the relative importance of the individual inputs in terms of how they impact the entire bundle of outputs. In many settings the relative importance of inputs is different for some of the outputs than for others. A typical example of this in the financial services sector is where the importance of sales staff versus service staff is different in regard to sales outputs than is true for service outputs. In this paper we develop a general DEA framework that incorporates multiple input-AR structures that cater to multiple output classes. We examine the cases of both divisible and indivisible inputs, and as well as mutually exclusive and overlapping output sets. The concepts are applied to a financial services situation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010150a.html

The role of preparedness in ambulance dispatching / S. Lee in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1888–1897 Titre : The role of preparedness in ambulance dispatching Type de document : texte imprimé Auteurs : S. Lee, Auteur Année de publication : 2011 Article en page(s) : pp. 1888–1897 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Ambulance  dispatching  Preparedness  Composite  performance  indicator  Social  welfare  functions Index. décimale : 001.424 Résumé : Response time in the emergency medical service is an important performance measure and ambulance dispatching is one of the most important factors affecting the response time. The most commonly used dispatching rule is to send the closest available unit to the call site. However, though dispatching the closest unit enables the service to achieve the minimal response time for the current call, the response times for the next incoming calls may increase if the area where the closest ambulance is currently located has a high call rate, that is the area becomes ill-prepared. A dispatching algorithm based on the preparedness concept was recently proposed. Rather than greedily minimizing each current response time, the dispatching algorithm takes account of future calls by a quantitative definition of preparedness. This study investigates the role of preparedness by examining the performance of the preparedness-based dispatching algorithm as well as by evolving the algorithm in several ways in order to magnify the effectiveness of preparedness consideration. As a result of these efforts, it is found that the consideration of preparedness in ambulance dispatching can provide significant benefits in reducing response time but only when appropriately used. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010145a.html [article] The role of preparedness in ambulance dispatching [texte imprimé] / S. Lee, Auteur . - 2011 . - pp. 1888–1897. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1888–1897 Mots-clés : Ambulance  dispatching  Preparedness  Composite  performance  indicator  Social  welfare  functions Index. décimale : 001.424 Résumé : Response time in the emergency medical service is an important performance measure and ambulance dispatching is one of the most important factors affecting the response time. The most commonly used dispatching rule is to send the closest available unit to the call site. However, though dispatching the closest unit enables the service to achieve the minimal response time for the current call, the response times for the next incoming calls may increase if the area where the closest ambulance is currently located has a high call rate, that is the area becomes ill-prepared. A dispatching algorithm based on the preparedness concept was recently proposed. Rather than greedily minimizing each current response time, the dispatching algorithm takes account of future calls by a quantitative definition of preparedness. This study investigates the role of preparedness by examining the performance of the preparedness-based dispatching algorithm as well as by evolving the algorithm in several ways in order to magnify the effectiveness of preparedness consideration. As a result of these efforts, it is found that the consideration of preparedness in ambulance dispatching can provide significant benefits in reducing response time but only when appropriately used. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010145a.html

Parallel machines scheduling with a deteriorating maintenance activity / J-J. Wang in Journal of the operational research society (JORS), Vol. 62 N° 10 (Octobre 2011) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1898–1902 Titre : Parallel machines scheduling with a deteriorating maintenance activity Type de document : texte imprimé Auteurs : J-J. Wang, Auteur ; Wang, J.-B., Auteur ; F. Liu, Auteur Année de publication : 2011 Article en page(s) : pp. 1898–1902 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Scheduling  Parallel  identical  machines  Maintenance  activity  Polynomial  algorithm Index. décimale : 001.424 Résumé : In this paper, we consider parallel identical machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the deteriorating maintenance activities and the sequence of jobs to minimize total completion time. We provide a polynomial time algorithm to solve the total completion time minimization problem. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010143a.html [article] Parallel machines scheduling with a deteriorating maintenance activity [texte imprimé] / J-J. Wang, Auteur ; Wang, J.-B., Auteur ; F. Liu, Auteur . - 2011 . - pp. 1898–1902. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 62 N° 10 (Octobre 2011) . - pp. 1898–1902 Mots-clés : Scheduling  Parallel  identical  machines  Maintenance  activity  Polynomial  algorithm Index. décimale : 001.424 Résumé : In this paper, we consider parallel identical machines scheduling problems with a deteriorating maintenance activity. In this model, each machine has a deteriorating maintenance activity, that is, delaying the maintenance increases the time required to perform it. We need to make a decision on when to schedule the deteriorating maintenance activities and the sequence of jobs to minimize total completion time. We provide a polynomial time algorithm to solve the total completion time minimization problem. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v62/n10/abs/jors2010143a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse