Dépouillements

Iterative algorithms for part grouping and loading in cellular reconfigurable manufacturing systems / J-M Yu in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1635–1644 Titre : Iterative algorithms for part grouping and loading in cellular reconfigurable manufacturing systems Type de document : texte imprimé Auteurs : J-M Yu, Auteur ; H-H Doh, Auteur ; H-W. Kim, Auteur Année de publication : 2013 Article en page(s) : pp. 1635–1644 Note générale : operational research Langues : Anglais (eng) Mots-clés : cellular  reconfigurable  manufacturing  systems;  part  grouping;  loading;  iterative  algorithms Index. décimale : 001.424 Résumé : A reconfigurable manufacturing system (RMS), one of state-of-the-art manufacturing system technologies, is the one designed at the outset for rapid changes in its hardware and software components in order to quickly adjust its production capacity and functionality in response to market or system changes. In this study, we consider a cellular RMS with multiple reconfigurable machining cells (RMCs), each of which has numerical control machines, a setup station, and an automatic material handling and storage system. Each machine within the RMC has an automatic tool changer and a tool magazine of a limited capacity. Two important operational problems, part grouping and loading, are considered in this study. Part grouping is the problem of allocating parts to RMCs, and loading is the problem of allocating operations and their cutting tools to machines within the RMC. An integer programming model is suggested to represent the two problems at the same time for the objective of balancing the workloads assigned to machines. Then, due to the complexity of the problem, we suggest two iterative algorithms in which the two problems are solved repeatedly until a solution is obtained. Computational experiments were done on various test instances and the results are reported. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20129a.html [article] Iterative algorithms for part grouping and loading in cellular reconfigurable manufacturing systems [texte imprimé] / J-M Yu, Auteur ; H-H Doh, Auteur ; H-W. Kim, Auteur . - 2013 . - pp. 1635–1644. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1635–1644 Mots-clés : cellular  reconfigurable  manufacturing  systems;  part  grouping;  loading;  iterative  algorithms Index. décimale : 001.424 Résumé : A reconfigurable manufacturing system (RMS), one of state-of-the-art manufacturing system technologies, is the one designed at the outset for rapid changes in its hardware and software components in order to quickly adjust its production capacity and functionality in response to market or system changes. In this study, we consider a cellular RMS with multiple reconfigurable machining cells (RMCs), each of which has numerical control machines, a setup station, and an automatic material handling and storage system. Each machine within the RMC has an automatic tool changer and a tool magazine of a limited capacity. Two important operational problems, part grouping and loading, are considered in this study. Part grouping is the problem of allocating parts to RMCs, and loading is the problem of allocating operations and their cutting tools to machines within the RMC. An integer programming model is suggested to represent the two problems at the same time for the objective of balancing the workloads assigned to machines. Then, due to the complexity of the problem, we suggest two iterative algorithms in which the two problems are solved repeatedly until a solution is obtained. Computational experiments were done on various test instances and the results are reported. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20129a.html

Adaptive consumer credit classification / N. G. Pavlidis in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1645-1654 Titre : Adaptive consumer credit classification Type de document : texte imprimé Auteurs : N. G. Pavlidis, Auteur ; D. K. Tasoulis, Auteur ; N. M. Adams, Auteur Année de publication : 2013 Article en page(s) : pp. 1645-1654 Note générale : operational research Langues : Anglais (eng) Mots-clés : credit  scoring;  logistic  regression;  population  drift;  online  learning;  H-measure Index. décimale : 001.424 Résumé : Credit scoring methods for predicting creditworthiness have proven very effective in consumer finance. In light of the present financial crisis, such methods will become even more important. One of the outstanding issues in credit risk classification is population drift. This term refers to changes occurring in the population due to unexpected changes in economic conditions and other factors. In this paper, we propose a novel methodology for the classification of credit applications that has the potential to adapt to population drift as it occurs. This provides the opportunity to update the credit risk classifier as new labelled data arrives. Assorted experimental results suggest that the proposed method has the potential to yield significant performance improvement over standard approaches, without sacrificing the classifier's descriptive capabilities. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201215a.html [article] Adaptive consumer credit classification [texte imprimé] / N. G. Pavlidis, Auteur ; D. K. Tasoulis, Auteur ; N. M. Adams, Auteur . - 2013 . - pp. 1645-1654. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1645-1654 Mots-clés : credit  scoring;  logistic  regression;  population  drift;  online  learning;  H-measure Index. décimale : 001.424 Résumé : Credit scoring methods for predicting creditworthiness have proven very effective in consumer finance. In light of the present financial crisis, such methods will become even more important. One of the outstanding issues in credit risk classification is population drift. This term refers to changes occurring in the population due to unexpected changes in economic conditions and other factors. In this paper, we propose a novel methodology for the classification of credit applications that has the potential to adapt to population drift as it occurs. This provides the opportunity to update the credit risk classifier as new labelled data arrives. Assorted experimental results suggest that the proposed method has the potential to yield significant performance improvement over standard approaches, without sacrificing the classifier's descriptive capabilities. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201215a.html

Supply chain coordination for newsvendor-type products with two ordering opportunities and demand information update / Y-W. Zhou in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1655–1678 Titre : Supply chain coordination for newsvendor-type products with two ordering opportunities and demand information update Type de document : texte imprimé Auteurs : Y-W. Zhou, Auteur ; S-D. Wang, Auteur Année de publication : 2013 Article en page(s) : pp. 1655–1678 Note générale : operational research Langues : Anglais (eng) Mots-clés : supply  chain  coordination;  newsvendor  model;  two-ordering  opportunities;  improved  revenue-sharing  contract Index. décimale : 001.424 Résumé : This paper studies a coordination issue with two ordering opportunities in a two-echelon supply chain, where one manufacturer sells a single newsvendor-type product through one buyer. The manufacturer does not hold inventory and activates production or order with an infinite capacity and a fixed setup cost in response to the buyer’s order. The buyer places two orderings during the selling period of the product: one happens at the beginning of the period and the other at some specified time within the selling period. The whole selling period is divided into two stages or sub-periods by the buyer’s second order. The stochastic demands in the two sub-periods are assumed to be auto-correlated. The excess demand before the second order is partially backordered, whereas the excess demand at the end of the selling season is utterly lost. Under both the centralized and decentralized settings, we develop the models of how the buyer determines his two-ordering policies. We analyse the existence and uniqueness of the optimal solutions to the models and present the corresponding analytical solutions. Furthermore, we propose an improved revenue-sharing contract that can realize the perfect coordination of the supply chain and study how the revenue-sharing policies affect the supply chain members’ decisions. Finally, we show the superiority of the presented two-ordering strategy through numerical examples. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011152a.html [article] Supply chain coordination for newsvendor-type products with two ordering opportunities and demand information update [texte imprimé] / Y-W. Zhou, Auteur ; S-D. Wang, Auteur . - 2013 . - pp. 1655–1678. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1655–1678 Mots-clés : supply  chain  coordination;  newsvendor  model;  two-ordering  opportunities;  improved  revenue-sharing  contract Index. décimale : 001.424 Résumé : This paper studies a coordination issue with two ordering opportunities in a two-echelon supply chain, where one manufacturer sells a single newsvendor-type product through one buyer. The manufacturer does not hold inventory and activates production or order with an infinite capacity and a fixed setup cost in response to the buyer’s order. The buyer places two orderings during the selling period of the product: one happens at the beginning of the period and the other at some specified time within the selling period. The whole selling period is divided into two stages or sub-periods by the buyer’s second order. The stochastic demands in the two sub-periods are assumed to be auto-correlated. The excess demand before the second order is partially backordered, whereas the excess demand at the end of the selling season is utterly lost. Under both the centralized and decentralized settings, we develop the models of how the buyer determines his two-ordering policies. We analyse the existence and uniqueness of the optimal solutions to the models and present the corresponding analytical solutions. Furthermore, we propose an improved revenue-sharing contract that can realize the perfect coordination of the supply chain and study how the revenue-sharing policies affect the supply chain members’ decisions. Finally, we show the superiority of the presented two-ordering strategy through numerical examples. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011152a.html

Analysis of back-office outsourcing contracts for financial services operations / P. Basu in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1679–1692 Titre : Analysis of back-office outsourcing contracts for financial services operations Type de document : texte imprimé Auteurs : P. Basu, Auteur ; S. K. Nair, Auteur Année de publication : 2013 Article en page(s) : pp. 1679–1692 Note générale : operational research Langues : Anglais (eng) Mots-clés : financial  services  operations;  outsourcing  contracts;  stackelberg  games;  stochastic  goal  programming Index. décimale : 001.424 Résumé : Managing back-office operations for financial services is a challenging task because of highly volatile and dynamic demand requirements. Lack of service inventories, the inability to backlog demand and significant shortage and overage costs complicate the problem. In such situations, outsourcing all or part of the demand to third-party vendors provides a viable and cost effective option for the firm. Motivated by the remittance processing operations of a Fortune 100 company we examine the usefulness of complementing in-house staffing with different outsourcing arrangements. We study capacity-based and volume-based contracts between a financial services firm and an outsourcing vendor. We examine the impact of demand characteristics on the parameters of contract choice. Through extensive numerical analysis, we ascertain that neither contract is universally preferred, but cost and revenue structures along with demand characteristics determine contract choice. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20125a.html [article] Analysis of back-office outsourcing contracts for financial services operations [texte imprimé] / P. Basu, Auteur ; S. K. Nair, Auteur . - 2013 . - pp. 1679–1692. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1679–1692 Mots-clés : financial  services  operations;  outsourcing  contracts;  stackelberg  games;  stochastic  goal  programming Index. décimale : 001.424 Résumé : Managing back-office operations for financial services is a challenging task because of highly volatile and dynamic demand requirements. Lack of service inventories, the inability to backlog demand and significant shortage and overage costs complicate the problem. In such situations, outsourcing all or part of the demand to third-party vendors provides a viable and cost effective option for the firm. Motivated by the remittance processing operations of a Fortune 100 company we examine the usefulness of complementing in-house staffing with different outsourcing arrangements. We study capacity-based and volume-based contracts between a financial services firm and an outsourcing vendor. We examine the impact of demand characteristics on the parameters of contract choice. Through extensive numerical analysis, we ascertain that neither contract is universally preferred, but cost and revenue structures along with demand characteristics determine contract choice. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20125a.html

Minimizing the maximum network flow: models and algorithms with resource synergy considerations / B. J. Lunday in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1693–1707 Titre : Minimizing the maximum network flow: models and algorithms with resource synergy considerations Type de document : texte imprimé Auteurs : B. J. Lunday, Auteur ; Sherali, H. D., Auteur Année de publication : 2013 Article en page(s) : pp. 1693–1707 Note générale : operational research Langues : Anglais (eng) Mots-clés : network  interdiction;  synergy;  resource  allocation;  inner-linearization;  outer-approximation Index. décimale : 001.424 Résumé : In this paper, we model and solve the network interdiction problem of minimizing the maximum flow through a network from a given source node to a terminus node, while incorporating different forms of superadditive synergy effects of the resources applied to the arcs in the network. Within this context, we examine linear, concave, and convex–concave synergy relationships, illustrate their relative effect on optimal solution characteristics, and accordingly develop and test effective solution procedures for the underlying problems. For a concave synergy relationship, which yields a convex programme, we propose an inner-linearization procedure that significantly outperforms the competitive commercial solver SBB by improving the quality of solutions found by the latter by 6.2% (within a time limit of 1800 CPU s), while saving 84.5% of the required computational effort. For general non-concave synergy relationships, we develop an outer-approximation-based heuristic that achieves solutions of objective value 0.20% better than the commercial global optimization software BARON, with a 99.3% reduction in computational effort for the subset of test problems for which BARON could identify a feasible solution within the set time limit. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20128a.html [article] Minimizing the maximum network flow: models and algorithms with resource synergy considerations [texte imprimé] / B. J. Lunday, Auteur ; Sherali, H. D., Auteur . - 2013 . - pp. 1693–1707. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1693–1707 Mots-clés : network  interdiction;  synergy;  resource  allocation;  inner-linearization;  outer-approximation Index. décimale : 001.424 Résumé : In this paper, we model and solve the network interdiction problem of minimizing the maximum flow through a network from a given source node to a terminus node, while incorporating different forms of superadditive synergy effects of the resources applied to the arcs in the network. Within this context, we examine linear, concave, and convex–concave synergy relationships, illustrate their relative effect on optimal solution characteristics, and accordingly develop and test effective solution procedures for the underlying problems. For a concave synergy relationship, which yields a convex programme, we propose an inner-linearization procedure that significantly outperforms the competitive commercial solver SBB by improving the quality of solutions found by the latter by 6.2% (within a time limit of 1800 CPU s), while saving 84.5% of the required computational effort. For general non-concave synergy relationships, we develop an outer-approximation-based heuristic that achieves solutions of objective value 0.20% better than the commercial global optimization software BARON, with a 99.3% reduction in computational effort for the subset of test problems for which BARON could identify a feasible solution within the set time limit. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors20128a.html

Single-manufacturer, multi-retailer consignment policy for retailers’ generalized demand distributions / J. Yu in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1708–1719 Titre : Single-manufacturer, multi-retailer consignment policy for retailers’ generalized demand distributions Type de document : texte imprimé Auteurs : J. Yu, Auteur ; Sarker, B. R., Auteur ; Q. Duan, Auteur Année de publication : 2013 Article en page(s) : pp. 1708–1719 Note générale : operational research Langues : Anglais (eng) Mots-clés : consignment  and  traditional  policies;  stochastic  demand;  supply  chain  coordination Index. décimale : 001.424 Résumé : Consignment policy (CP) is a novel approach to the inventory management in supply chains. It is based on strong interaction and reliable collaboration between vendor(s) and buyer(s), which is acquiring growing importance in today's industrial reality. Unlike most literature focusing on single-vendor single-buyer models and deterministic customer demand, a single-manufacturer (vendor) multi-retailer (buyer) generic model is developed under stochastic customer demand in this study. In order to understand the potential benefits of CP, it is compared with a traditional policy (TP) model developed in the similar approach. The models are tested with two scenarios of uniform and exponential demand distributions of the retailers. The results show how CP works better than the traditional uncoordinated optimization. It not only helps the manufacturer to generate higher profit, but also coordinates retailers to achieve a higher supply chain profit. At the same time, each retailer earns at least as much as they do in TP. Further price discount sensitivity analysis demonstrates the efficiency of CP when facing price-demand fluctuation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201213a.html [article] Single-manufacturer, multi-retailer consignment policy for retailers’ generalized demand distributions [texte imprimé] / J. Yu, Auteur ; Sarker, B. R., Auteur ; Q. Duan, Auteur . - 2013 . - pp. 1708–1719. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1708–1719 Mots-clés : consignment  and  traditional  policies;  stochastic  demand;  supply  chain  coordination Index. décimale : 001.424 Résumé : Consignment policy (CP) is a novel approach to the inventory management in supply chains. It is based on strong interaction and reliable collaboration between vendor(s) and buyer(s), which is acquiring growing importance in today's industrial reality. Unlike most literature focusing on single-vendor single-buyer models and deterministic customer demand, a single-manufacturer (vendor) multi-retailer (buyer) generic model is developed under stochastic customer demand in this study. In order to understand the potential benefits of CP, it is compared with a traditional policy (TP) model developed in the similar approach. The models are tested with two scenarios of uniform and exponential demand distributions of the retailers. The results show how CP works better than the traditional uncoordinated optimization. It not only helps the manufacturer to generate higher profit, but also coordinates retailers to achieve a higher supply chain profit. At the same time, each retailer earns at least as much as they do in TP. Further price discount sensitivity analysis demonstrates the efficiency of CP when facing price-demand fluctuation. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201213a.html

Strategic competitive location / Drezner, T. in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1720–1730 Titre : Strategic competitive location : improving existing and establishing new facilities Type de document : texte imprimé Auteurs : Drezner, T., Auteur ; Z. Drezner, Auteur ; Kalczynski, P., Auteur Année de publication : 2013 Article en page(s) : pp. 1720–1730 Note générale : operational research Langues : Anglais (eng) Mots-clés : facility  location;  competitive  location;  cover  models Index. décimale : 001.424 Résumé : Competitive facility location models consider two main strategies for increasing the market share captured by a chain subject to a budget constraint. One strategy is the improvement of existing facilities. The second strategy is the construction of new facilities. In this paper we analyse these two strategies as well as the joint strategy which is a combination of the two. All three strategies are formulated as a unified model. The best solution to an individual strategy is a feasible solution to the joint one. Therefore, the joint strategy must yield solutions that are at least as good as the solutions to each of the individual strategies. Based on the results of extensive experiments, we conclude that the increase in market share captured by a chain when the joint strategy is employed can be significantly higher than increases obtained by individual strategies. A branch and bound procedure and a tabu search heuristic are constructed for the solution of the unified model. Both algorithms performed very well on a set of test problems with up to 900 demand points. A total of 62% of the test problems were optimally solved by the branch and bound procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201216a.html [article] Strategic competitive location : improving existing and establishing new facilities [texte imprimé] / Drezner, T., Auteur ; Z. Drezner, Auteur ; Kalczynski, P., Auteur . - 2013 . - pp. 1720–1730. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1720–1730 Mots-clés : facility  location;  competitive  location;  cover  models Index. décimale : 001.424 Résumé : Competitive facility location models consider two main strategies for increasing the market share captured by a chain subject to a budget constraint. One strategy is the improvement of existing facilities. The second strategy is the construction of new facilities. In this paper we analyse these two strategies as well as the joint strategy which is a combination of the two. All three strategies are formulated as a unified model. The best solution to an individual strategy is a feasible solution to the joint one. Therefore, the joint strategy must yield solutions that are at least as good as the solutions to each of the individual strategies. Based on the results of extensive experiments, we conclude that the increase in market share captured by a chain when the joint strategy is employed can be significantly higher than increases obtained by individual strategies. A branch and bound procedure and a tabu search heuristic are constructed for the solution of the unified model. Both algorithms performed very well on a set of test problems with up to 900 demand points. A total of 62% of the test problems were optimally solved by the branch and bound procedure. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201216a.html

Defending and improving the ‘slotting fee’ / Y-Y. Wang in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1731–1751 Titre : Defending and improving the ‘slotting fee’ : how it can benefit all the stakeholders dealing with a newsvendor product with price and effort-dependent demand Type de document : texte imprimé Auteurs : Y-Y. Wang, Auteur ; H-S. Lau, Auteur ; J-C. Wang, Auteur Année de publication : 2013 Article en page(s) : pp. 1731–1751 Note générale : operational research Langues : Anglais (eng) Mots-clés : pricing;  slotting  fee;  composite  pricing  contract  format;  Stackelberg-dominant  retailer;  newsvendor  product Index. décimale : 001.424 Résumé : ‘Slotting fee’ (hereafter ‘SF’) is an upfront fee a ‘supplier’ is required to pay a retailer in order to have his product sold on the retailer's shelves. It is becoming increasingly common, but also widely reviled. This paper considers a newsvendor product whose expected demand is dependent on retail price and sales effort. The question we pose is: given that the Stackelberg-dominant retailer has to choose a pricing contract with which she transacts with the supplier, how would the supply-chain stakeholders fare when the retailer implements SF instead of another practical pricing contract? We show that, contradicting its negative public image, SF empowers the dominant retailer to specify contract terms that will benefit all the stakeholder-groups. That is, the supplier's and the retailer's profits are higher, the production workers are asked to produce more, and the consumers pay a lower retail price. We also propose a new ‘composite’ contract format that incorporates both the SF and ‘buyback’ features. This composite format empowers the retailer to provide even greater benefits to the supply-chain's stakeholders. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011111a.html [article] Defending and improving the ‘slotting fee’ : how it can benefit all the stakeholders dealing with a newsvendor product with price and effort-dependent demand [texte imprimé] / Y-Y. Wang, Auteur ; H-S. Lau, Auteur ; J-C. Wang, Auteur . - 2013 . - pp. 1731–1751. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1731–1751 Mots-clés : pricing;  slotting  fee;  composite  pricing  contract  format;  Stackelberg-dominant  retailer;  newsvendor  product Index. décimale : 001.424 Résumé : ‘Slotting fee’ (hereafter ‘SF’) is an upfront fee a ‘supplier’ is required to pay a retailer in order to have his product sold on the retailer's shelves. It is becoming increasingly common, but also widely reviled. This paper considers a newsvendor product whose expected demand is dependent on retail price and sales effort. The question we pose is: given that the Stackelberg-dominant retailer has to choose a pricing contract with which she transacts with the supplier, how would the supply-chain stakeholders fare when the retailer implements SF instead of another practical pricing contract? We show that, contradicting its negative public image, SF empowers the dominant retailer to specify contract terms that will benefit all the stakeholder-groups. That is, the supplier's and the retailer's profits are higher, the production workers are asked to produce more, and the consumers pay a lower retail price. We also propose a new ‘composite’ contract format that incorporates both the SF and ‘buyback’ features. This composite format empowers the retailer to provide even greater benefits to the supply-chain's stakeholders. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011111a.html

Three revenue-sharing variants / Y-Y. Wang in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1752–1764 Titre : Three revenue-sharing variants : their significant performance differences under system-parameter uncertainties Type de document : texte imprimé Auteurs : Y-Y. Wang, Auteur ; H-S. Lau, Auteur ; Z-S Hua, Auteur Année de publication : 2013 Article en page(s) : pp. 1752–1764 Note générale : operational research Langues : Anglais (eng) Mots-clés : supply  chain  contract  design;  revenue  sharing;  decision  making  under  uncertain  system  parameters;  stackelberg  game  structure Index. décimale : 001.424 Résumé : In the widely studied ‘revenue sharing’ (hereafter [RS]) contract format, the manufacturer of a product not only charges the retailer a unit wholesale price w, but also requires the retailer to share part of the product's revenue (ie, the unit retail price p) with him. For a product with price-dependent demand, it is well known that if a dominant manufacturer knows the system parameters deterministically, then [RS] gives him the perfect power of simultaneously coordinating the channel and allocating profit arbitrarily. Unfortunately, [RS]'s power deteriorates as the manufacturer's knowledge of the system parameters becomes increasingly uncertain. This paper shows that this deterioration can be substantially reduced by using slightly modified versions of [RS]; these modifications roughly amount to sharing a retailer's gross profit instead of revenue. In other words, this paper presents simple modifications to the classical [RS], leading to contract formats that perform substantially better under system-parameter uncertainty. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011131a.html [article] Three revenue-sharing variants : their significant performance differences under system-parameter uncertainties [texte imprimé] / Y-Y. Wang, Auteur ; H-S. Lau, Auteur ; Z-S Hua, Auteur . - 2013 . - pp. 1752–1764. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1752–1764 Mots-clés : supply  chain  contract  design;  revenue  sharing;  decision  making  under  uncertain  system  parameters;  stackelberg  game  structure Index. décimale : 001.424 Résumé : In the widely studied ‘revenue sharing’ (hereafter [RS]) contract format, the manufacturer of a product not only charges the retailer a unit wholesale price w, but also requires the retailer to share part of the product's revenue (ie, the unit retail price p) with him. For a product with price-dependent demand, it is well known that if a dominant manufacturer knows the system parameters deterministically, then [RS] gives him the perfect power of simultaneously coordinating the channel and allocating profit arbitrarily. Unfortunately, [RS]'s power deteriorates as the manufacturer's knowledge of the system parameters becomes increasingly uncertain. This paper shows that this deterioration can be substantially reduced by using slightly modified versions of [RS]; these modifications roughly amount to sharing a retailer's gross profit instead of revenue. In other words, this paper presents simple modifications to the classical [RS], leading to contract formats that perform substantially better under system-parameter uncertainty. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011131a.html

Optimal challenges in tennis / Clarke, S. R. in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1765–1772 Titre : Optimal challenges in tennis Type de document : texte imprimé Auteurs : Clarke, S. R., Auteur ; J. M. Norman, Auteur Année de publication : 2013 Article en page(s) : pp. 1765–1772 Note générale : operational research Langues : Anglais (eng) Mots-clés : sports;  dynamic  programming;  optimisation;  challenge;  tennis Index. décimale : 001.424 Résumé : The use of technology in sport to assist umpires has been gradually introduced into several sports. This has now been extended to allow players to call upon technology to arbitrate when they disagree with the umpire's decision. Both tennis and cricket now allow the players to challenge a doubtful decision, which is reversed if the evidence shows it to be incorrect. However, the number of challenges is limited, and players must balance any possible immediate gain with the loss of a future right to challenge. With similar challenge rules expected to be introduced in other sports, this situation has been a motivation to consider challenges more widely. We use Dynamic Programming to investigate the optimal challenge strategy and obtain some general rules. In a traditional set of tennis, players should be more aggressive in challenging in the latter stages of the games and sets, and when their opponent is ahead. Optimal challenge strategy can increase a player's chance of winning an otherwise even five-set match to 59%. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011147a.html [article] Optimal challenges in tennis [texte imprimé] / Clarke, S. R., Auteur ; J. M. Norman, Auteur . - 2013 . - pp. 1765–1772. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1765–1772 Mots-clés : sports;  dynamic  programming;  optimisation;  challenge;  tennis Index. décimale : 001.424 Résumé : The use of technology in sport to assist umpires has been gradually introduced into several sports. This has now been extended to allow players to call upon technology to arbitrate when they disagree with the umpire's decision. Both tennis and cricket now allow the players to challenge a doubtful decision, which is reversed if the evidence shows it to be incorrect. However, the number of challenges is limited, and players must balance any possible immediate gain with the loss of a future right to challenge. With similar challenge rules expected to be introduced in other sports, this situation has been a motivation to consider challenges more widely. We use Dynamic Programming to investigate the optimal challenge strategy and obtain some general rules. In a traditional set of tennis, players should be more aggressive in challenging in the latter stages of the games and sets, and when their opponent is ahead. Optimal challenge strategy can increase a player's chance of winning an otherwise even five-set match to 59%. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors2011147a.html

A visual interactive approach for scenario-based stochastic multi-objective problems and an application / E. Balibek in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1773–1787 Titre : A visual interactive approach for scenario-based stochastic multi-objective problems and an application Type de document : texte imprimé Auteurs : E. Balibek, Auteur ; Köksalan, M., Auteur Année de publication : 2013 Article en page(s) : pp. 1773–1787 Note générale : operational research Langues : Anglais (eng) Mots-clés : multi-objective  programming;  interactive  methods;  stochastic  programming;  public  debt  management Index. décimale : 001.424 Résumé : In many practical applications of stochastic programming, discretization of continuous random variables in the form of a scenario tree is required. In this paper, we deal with the randomness in scenario generation and present a visual interactive method for scenario-based stochastic multi-objective problems. The method relies on multi-variate statistical analysis of solutions obtained from a multi-objective stochastic problem to construct joint confidence regions for the objective function values. The decision maker (DM) explores desirable parts of the efficient frontier using a visual representation that depicts the trajectories of the objective function values within confidence bands. In this way, we communicate the effects of randomness inherent in the problem to the DM to help her understand the trade-offs and the levels of risk associated with each objective. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201225a.html [article] A visual interactive approach for scenario-based stochastic multi-objective problems and an application [texte imprimé] / E. Balibek, Auteur ; Köksalan, M., Auteur . - 2013 . - pp. 1773–1787. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1773–1787 Mots-clés : multi-objective  programming;  interactive  methods;  stochastic  programming;  public  debt  management Index. décimale : 001.424 Résumé : In many practical applications of stochastic programming, discretization of continuous random variables in the form of a scenario tree is required. In this paper, we deal with the randomness in scenario generation and present a visual interactive method for scenario-based stochastic multi-objective problems. The method relies on multi-variate statistical analysis of solutions obtained from a multi-objective stochastic problem to construct joint confidence regions for the objective function values. The decision maker (DM) explores desirable parts of the efficient frontier using a visual representation that depicts the trajectories of the objective function values within confidence bands. In this way, we communicate the effects of randomness inherent in the problem to the DM to help her understand the trade-offs and the levels of risk associated with each objective. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201225a.html

‘Actors’ and ‘clients’ / N. Harrop in Journal of the operational research society (JORS), Vol. 63 N° 12 (Décembre 2012) 

Public ISBD [article]  in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1788–1789 Titre : ‘Actors’ and ‘clients’ : why systems dynamics needs help from soft systems methodology and unbounded systems thinking Type de document : texte imprimé Auteurs : N. Harrop, Auteur ; A. Gillies, Auteur ; A. T. Wood-Harper, Auteur Année de publication : 2013 Article en page(s) : pp. 1788–1789 Note générale : operational research Langues : Anglais (eng) Mots-clés : dynamic  system;  actors;  clients;  feasability Index. décimale : 001.424 Note de contenu : Viewpoints DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201299a.html [article] ‘Actors’ and ‘clients’ : why systems dynamics needs help from soft systems methodology and unbounded systems thinking [texte imprimé] / N. Harrop, Auteur ; A. Gillies, Auteur ; A. T. Wood-Harper, Auteur . - 2013 . - pp. 1788–1789. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 12 (Décembre 2012) . - pp. 1788–1789 Mots-clés : dynamic  system;  actors;  clients;  feasability Index. décimale : 001.424 Note de contenu : Viewpoints DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n12/abs/jors201299a.html

Exemplaires

Bibliothèque Ecole Nationale Polytechnique d'Alger

Accueil

Se connecter

Météo

Adresse