Pub Date : 2022-06-13DOI: 10.1080/03155986.2022.2085944
C. Chen
Abstract For fashion products that have rather uncertain consumer demands, retailers can use the demand-chasing tactic to mitigate the uncertainty. Specifically, the demand-chasing retailer can place small, initial orders to identify which products are popular and then press suppliers to deliver expedited reorders. Moreover, the retailer can reduce the required lead time, and the supplier can either ramp up capacity levels to fulfill the reorders in a timely manner or face hefty penalties. However, the supplier prefers receiving firm order commitments as far in advance as possible for better capacity planning. This conflict of interest regarding capacity levels creates tension, especially if the supplier and retailer have unequal channel powers. The goal of this research is to provide a better understanding of the required lead time and how it affects capacity decisions in a decentralized supply chain. We use game-theoretic models to show the implications of required lead time and channel power on capacity decisions. In addition, we propose contract mechanisms that can coordinate the supply chain and optimize capacity levels.
{"title":"Fulfillment lead time and capacity decisions under demand chasing","authors":"C. Chen","doi":"10.1080/03155986.2022.2085944","DOIUrl":"https://doi.org/10.1080/03155986.2022.2085944","url":null,"abstract":"Abstract For fashion products that have rather uncertain consumer demands, retailers can use the demand-chasing tactic to mitigate the uncertainty. Specifically, the demand-chasing retailer can place small, initial orders to identify which products are popular and then press suppliers to deliver expedited reorders. Moreover, the retailer can reduce the required lead time, and the supplier can either ramp up capacity levels to fulfill the reorders in a timely manner or face hefty penalties. However, the supplier prefers receiving firm order commitments as far in advance as possible for better capacity planning. This conflict of interest regarding capacity levels creates tension, especially if the supplier and retailer have unequal channel powers. The goal of this research is to provide a better understanding of the required lead time and how it affects capacity decisions in a decentralized supply chain. We use game-theoretic models to show the implications of required lead time and channel power on capacity decisions. In addition, we propose contract mechanisms that can coordinate the supply chain and optimize capacity levels.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"25 1","pages":"491 - 504"},"PeriodicalIF":1.3,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82756296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-28DOI: 10.1080/03155986.2022.2063598
Kenneth Dolson, H. Sarhadi, A. Saif
Abstract We present deterministic and stochastic goal programming models for coordinating of flock collection activities in a poultry processing company. The aim is to develop weekly schedules that balance three goals: ensuring a steady workload in the processing facility, reducing processing defects due to weight differences, and fulfilling production targets of farmers, while satisfying logistical constraints. Two deterministic goal programming models are proposed: a weighted model that considers the collective interests of farmers, and a min-max model that prevents large deviations from the production target for any individual farmer. Furthermore, two-stage stochastic programming models are developed, in which forecasts of the average flock weights are uncertain. The proposed approaches are applied to a real case study in Nova Scotia (Canada). Numerical results show that, compared to the weighted models, the min-max models considerably reduce the maximum expected deviation from optimality without significantly increasing the gross deviation from production targets. Furthermore, the stochastic models led to substantial improvements over the deterministic ones, thus justifying the transition to a two-stage planning procedure. The proposed stochastic min-max model was also shown to outperform the current manual approach in terms of reducing the average weight spread between flocks collected on the same day.
{"title":"Goal programming approaches for coordinating flock collection in the poultry industry","authors":"Kenneth Dolson, H. Sarhadi, A. Saif","doi":"10.1080/03155986.2022.2063598","DOIUrl":"https://doi.org/10.1080/03155986.2022.2063598","url":null,"abstract":"Abstract We present deterministic and stochastic goal programming models for coordinating of flock collection activities in a poultry processing company. The aim is to develop weekly schedules that balance three goals: ensuring a steady workload in the processing facility, reducing processing defects due to weight differences, and fulfilling production targets of farmers, while satisfying logistical constraints. Two deterministic goal programming models are proposed: a weighted model that considers the collective interests of farmers, and a min-max model that prevents large deviations from the production target for any individual farmer. Furthermore, two-stage stochastic programming models are developed, in which forecasts of the average flock weights are uncertain. The proposed approaches are applied to a real case study in Nova Scotia (Canada). Numerical results show that, compared to the weighted models, the min-max models considerably reduce the maximum expected deviation from optimality without significantly increasing the gross deviation from production targets. Furthermore, the stochastic models led to substantial improvements over the deterministic ones, thus justifying the transition to a two-stage planning procedure. The proposed stochastic min-max model was also shown to outperform the current manual approach in terms of reducing the average weight spread between flocks collected on the same day.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"27 1","pages":"359 - 384"},"PeriodicalIF":1.3,"publicationDate":"2022-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81770768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-05-17DOI: 10.1080/03155986.2022.2073110
Maximiliano Cubillos, R. Spliet, Sanne Wøhlk
Abstract In this paper, we study an inventory-routing problem with stochastic demand, in which knowledge of the demands of customers can be updated by the use of sensor information, and used to plan delivery decisions in a given planning period. We consider the case in which a limited number of sensors can be placed, and investigate what simple rules can best be applied to decide on their allocation. To evaluate these simple sensor allocation rules, we propose a Variable Neighborhood Search algorithm for an inventory-routing problem in a rolling horizon framework to solve the problem which uses both sensor and historical data to update demand forecasts. We perform extensive computational experiments in which we generate random instances and consider different demand generation scenarios to test different sensor allocation rules. Results show that simple allocation rules, such as placing sensors at customers with high demand or far from the depot, can significantly reduce the total cost, particularly if combined with dynamic forecast information.
{"title":"On the effect of using sensors and dynamic forecasts in inventory-routing problems","authors":"Maximiliano Cubillos, R. Spliet, Sanne Wøhlk","doi":"10.1080/03155986.2022.2073110","DOIUrl":"https://doi.org/10.1080/03155986.2022.2073110","url":null,"abstract":"Abstract In this paper, we study an inventory-routing problem with stochastic demand, in which knowledge of the demands of customers can be updated by the use of sensor information, and used to plan delivery decisions in a given planning period. We consider the case in which a limited number of sensors can be placed, and investigate what simple rules can best be applied to decide on their allocation. To evaluate these simple sensor allocation rules, we propose a Variable Neighborhood Search algorithm for an inventory-routing problem in a rolling horizon framework to solve the problem which uses both sensor and historical data to update demand forecasts. We perform extensive computational experiments in which we generate random instances and consider different demand generation scenarios to test different sensor allocation rules. Results show that simple allocation rules, such as placing sensors at customers with high demand or far from the depot, can significantly reduce the total cost, particularly if combined with dynamic forecast information.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"1 1","pages":"473 - 490"},"PeriodicalIF":1.3,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87255079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-26DOI: 10.1080/03155986.2022.2066404
Armagan Ozbilge, E. Hassini, M. Parlar
Abstract The proliferation of e-commerce has changed the retail market landscape significantly in most industries. Due to fiercer competition, many bricks-and-mortar retailers established an online channel and have become bricks-and-clicks. On the other hand, some e-tailers are adding a conventional channel to their portfolio by launching physical stores or forming a partnership with traditional retailers. Deciding on whether or not to adopt a dual-channel policy and how to operate it, in the presence of online sales, present multiple and unique research challenges. More than two decades of research have accumulated and there is a need for a comprehensive look at what has been achieved and where more research is required. Recent reviews in the field are limited in scope and depth: they focus on fulfillment and distribution issues only and cover a limited portion of the literature, less than 60 journal papers versus more than 260 papers in this survey. In this paper, we offer a structured literature review (SLR) on bricks-and-clicks dual-channels. We contribute to the literature in three main areas: (1) We present a comprehensive look at all operational aspects of bricks-and-clicks dual supply chains, (2) provide a systematic discussion of common demand modeling functions, and (3) analyze the reviewed literature, identify recent research trends and opportunities, and illustrate how existing research can be used to address up-to-date challenges in the industry.
{"title":"A review of bricks-and-clicks dual-channels literature: trends and opportunities","authors":"Armagan Ozbilge, E. Hassini, M. Parlar","doi":"10.1080/03155986.2022.2066404","DOIUrl":"https://doi.org/10.1080/03155986.2022.2066404","url":null,"abstract":"Abstract The proliferation of e-commerce has changed the retail market landscape significantly in most industries. Due to fiercer competition, many bricks-and-mortar retailers established an online channel and have become bricks-and-clicks. On the other hand, some e-tailers are adding a conventional channel to their portfolio by launching physical stores or forming a partnership with traditional retailers. Deciding on whether or not to adopt a dual-channel policy and how to operate it, in the presence of online sales, present multiple and unique research challenges. More than two decades of research have accumulated and there is a need for a comprehensive look at what has been achieved and where more research is required. Recent reviews in the field are limited in scope and depth: they focus on fulfillment and distribution issues only and cover a limited portion of the literature, less than 60 journal papers versus more than 260 papers in this survey. In this paper, we offer a structured literature review (SLR) on bricks-and-clicks dual-channels. We contribute to the literature in three main areas: (1) We present a comprehensive look at all operational aspects of bricks-and-clicks dual supply chains, (2) provide a systematic discussion of common demand modeling functions, and (3) analyze the reviewed literature, identify recent research trends and opportunities, and illustrate how existing research can be used to address up-to-date challenges in the industry.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"272 1","pages":"436 - 472"},"PeriodicalIF":1.3,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76420706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-04-08DOI: 10.1080/03155986.2022.2040274
Nils-Hassan Quttineh, Uledi Ngulo, T. Larsson
Abstract We study a bi-objective covering problem stemming from a real-world application concerning the design of camera surveillance systems for large-scale outdoor areas. It is in this application prohibitively costly to surveil the entire area, and therefore necessary to be able to present a decision-maker with trade-offs between total cost and the portion of the area that is surveilled. The problem can be stated as a set covering problem with two objectives, describing cost and portion of covering constraints that are fulfilled. Finding the Pareto frontier for these objectives is very computationally demanding and we therefore derive a method for finding a good approximate frontier in a practically feasible computing time. The method is based on the ϵ-constraint reformulation, an established heuristic for set covering problems, and subgradient optimization.
{"title":"Approximating the Pareto frontier for a challenging real-world bi-objective covering problem","authors":"Nils-Hassan Quttineh, Uledi Ngulo, T. Larsson","doi":"10.1080/03155986.2022.2040274","DOIUrl":"https://doi.org/10.1080/03155986.2022.2040274","url":null,"abstract":"Abstract We study a bi-objective covering problem stemming from a real-world application concerning the design of camera surveillance systems for large-scale outdoor areas. It is in this application prohibitively costly to surveil the entire area, and therefore necessary to be able to present a decision-maker with trade-offs between total cost and the portion of the area that is surveilled. The problem can be stated as a set covering problem with two objectives, describing cost and portion of covering constraints that are fulfilled. Finding the Pareto frontier for these objectives is very computationally demanding and we therefore derive a method for finding a good approximate frontier in a practically feasible computing time. The method is based on the ϵ-constraint reformulation, an established heuristic for set covering problems, and subgradient optimization.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"43 1","pages":"342 - 358"},"PeriodicalIF":1.3,"publicationDate":"2022-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78418905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-21DOI: 10.1080/03155986.2022.2049567
Yacine Laalaoui, H. Mhalla
Abstract The Knapsack Sharing Problem (KSP) is the problem of assigning a subset of n items from m disjoint classes to a shared knapsack such that the total profit of the smallest class is maximized subject to the knapsack capacity constraint. The KSP problem generalizes the 0/1 Knapsack Problem (KP), and it has wide applications in finance and resource allocation domains. In this article, we describe a new Dichotomous-based exact algorithm, called Sharknap, to solve large knapsack sharing problems. Sharknap solves the KSP problem by decomposition and dichotomous reduction like all existing Dichotomous-based algorithms. The decomposition phase splits each KSP instance into a series of KP problems to be solved using an exact KP solver. The dichotomous reduction phase reduces the weight of each considered class. We introduce the concept of critical class to bound the number of calls to the KP solver and to speed up the search algorithm. Experimental results on standard benchmarks from the literature as well as on randomly generated instances show that Sharknap significantly outperforms all existing exact algorithms. Interestingly, the new algorithm is able to solve large instances with up to 100000 items and 1000 classes within less than one second in many times.
{"title":"An exact algorithm for large knapsack sharing problems","authors":"Yacine Laalaoui, H. Mhalla","doi":"10.1080/03155986.2022.2049567","DOIUrl":"https://doi.org/10.1080/03155986.2022.2049567","url":null,"abstract":"Abstract The Knapsack Sharing Problem (KSP) is the problem of assigning a subset of n items from m disjoint classes to a shared knapsack such that the total profit of the smallest class is maximized subject to the knapsack capacity constraint. The KSP problem generalizes the 0/1 Knapsack Problem (KP), and it has wide applications in finance and resource allocation domains. In this article, we describe a new Dichotomous-based exact algorithm, called Sharknap, to solve large knapsack sharing problems. Sharknap solves the KSP problem by decomposition and dichotomous reduction like all existing Dichotomous-based algorithms. The decomposition phase splits each KSP instance into a series of KP problems to be solved using an exact KP solver. The dichotomous reduction phase reduces the weight of each considered class. We introduce the concept of critical class to bound the number of calls to the KP solver and to speed up the search algorithm. Experimental results on standard benchmarks from the literature as well as on randomly generated instances show that Sharknap significantly outperforms all existing exact algorithms. Interestingly, the new algorithm is able to solve large instances with up to 100000 items and 1000 classes within less than one second in many times.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"40 1","pages":"315 - 341"},"PeriodicalIF":1.3,"publicationDate":"2022-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77709366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-21DOI: 10.1080/03155986.2022.2049154
Haijiao Li, Kuan Yang, Guoqing Zhang
Abstract Online reviews have attracted much attention from firms as they play a significant role in consumers' purchase decisions. While prior investigations have explored the impact of online reviews on firms' operational decisions, little is known about how review volume and valence affect different players' operational decisions in a channel structure. We develop game-theoretic models to examine the effect of review volume and valence on different players' pricing strategies under two-period centralized, decentralized, and coordination structures composed of an online retailer and a manufacturer. The results indicate that the retailer and manufacturer benefit from a high review valence but are not necessarily harmed by a low review valence. Particularly, when review volume is sufficiently large, the low review valence may also bring more profits. In this case, online reviews can expand the potential market. Finally, a two-period two-part tariff contract can perfectly coordinate the supply chain and create a win-win situation for both the retailer and manufacturer under certain conditions. The manufacturer may charge a sufficiently low first-period wholesale price and even subsidize the retailer under a low valence and moderate number of reviews. Our results offer a more complete understanding of the implications of reviews in supply chain management.
{"title":"The impact of online reviews on pricing strategy and coordination in a two-period two-echelon supply chain","authors":"Haijiao Li, Kuan Yang, Guoqing Zhang","doi":"10.1080/03155986.2022.2049154","DOIUrl":"https://doi.org/10.1080/03155986.2022.2049154","url":null,"abstract":"Abstract Online reviews have attracted much attention from firms as they play a significant role in consumers' purchase decisions. While prior investigations have explored the impact of online reviews on firms' operational decisions, little is known about how review volume and valence affect different players' operational decisions in a channel structure. We develop game-theoretic models to examine the effect of review volume and valence on different players' pricing strategies under two-period centralized, decentralized, and coordination structures composed of an online retailer and a manufacturer. The results indicate that the retailer and manufacturer benefit from a high review valence but are not necessarily harmed by a low review valence. Particularly, when review volume is sufficiently large, the low review valence may also bring more profits. In this case, online reviews can expand the potential market. Finally, a two-period two-part tariff contract can perfectly coordinate the supply chain and create a win-win situation for both the retailer and manufacturer under certain conditions. The manufacturer may charge a sufficiently low first-period wholesale price and even subsidize the retailer under a low valence and moderate number of reviews. Our results offer a more complete understanding of the implications of reviews in supply chain management.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"4 6","pages":"1 - 33"},"PeriodicalIF":1.3,"publicationDate":"2022-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72543587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-03-17DOI: 10.1080/03155986.2022.2051385
Helu Xiao, Xin Liu, Tiantian Ren, Zhongbao Zhou
Abstract This article proposes some alternative multi-period diversification-consistent data envelopment analysis (DEA) models to assess the dynamic performance of socially responsible investment (SRI) funds accounting for both finance and SRI criteria. First, three portfolio possibility sets (PPSs) are constructed based on some alternative dynamic input-output processes of SRI funds. Second, three diversification-consistent DEA models are developed by combining the directional distance function (DDF) measure with the proposed PPSs. Finally, this article selects 45 SRI funds to investigate the impact of social responsibility scores (SRSs), intermediate linkages, efficiency weights, and projection directions on their efficiency and ranking, respectively.
{"title":"Measuring the dynamic efficiency of socially responsible investment funds: evidence from dynamic network DEA with diversification","authors":"Helu Xiao, Xin Liu, Tiantian Ren, Zhongbao Zhou","doi":"10.1080/03155986.2022.2051385","DOIUrl":"https://doi.org/10.1080/03155986.2022.2051385","url":null,"abstract":"Abstract This article proposes some alternative multi-period diversification-consistent data envelopment analysis (DEA) models to assess the dynamic performance of socially responsible investment (SRI) funds accounting for both finance and SRI criteria. First, three portfolio possibility sets (PPSs) are constructed based on some alternative dynamic input-output processes of SRI funds. Second, three diversification-consistent DEA models are developed by combining the directional distance function (DDF) measure with the proposed PPSs. Finally, this article selects 45 SRI funds to investigate the impact of social responsibility scores (SRSs), intermediate linkages, efficiency weights, and projection directions on their efficiency and ranking, respectively.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"8 1","pages":"531 - 557"},"PeriodicalIF":1.3,"publicationDate":"2022-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82568617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-02-28DOI: 10.1080/03155986.2022.2044222
Bilal Aslam, Changyong Zhang
Abstract Thanks to the reduced price and less exposition to sudden crashes or price hikes, the Asian option is among the most favorable hedging instruments that are hard to be manipulated, in both the commodity market and executive compensation plan. Since the creation of the option, the main focus has been more on how to price it accurately while much less on how to explore deeper the benefits that the option offers. In this paper, a new type of path-dependent option, referred to as the average-Asian option, is introduced to reduce further the volatility of the underlying price risk and minimize option manipulation threat. The price is proved to be less than that of the standard option. It is additionally shown by numerical results that, when granted at the money, the proposed option is on average about 49.32% and 5.45% cheaper than the standard and Asian options, respectively. Furthermore, the option is less sensitive than the Asian counterpart, at both the front-end and the back-end price manipulation.
{"title":"A strengthened solution to option manipulation","authors":"Bilal Aslam, Changyong Zhang","doi":"10.1080/03155986.2022.2044222","DOIUrl":"https://doi.org/10.1080/03155986.2022.2044222","url":null,"abstract":"Abstract Thanks to the reduced price and less exposition to sudden crashes or price hikes, the Asian option is among the most favorable hedging instruments that are hard to be manipulated, in both the commodity market and executive compensation plan. Since the creation of the option, the main focus has been more on how to price it accurately while much less on how to explore deeper the benefits that the option offers. In this paper, a new type of path-dependent option, referred to as the average-Asian option, is introduced to reduce further the volatility of the underlying price risk and minimize option manipulation threat. The price is proved to be less than that of the standard option. It is additionally shown by numerical results that, when granted at the money, the proposed option is on average about 49.32% and 5.45% cheaper than the standard and Asian options, respectively. Furthermore, the option is less sensitive than the Asian counterpart, at both the front-end and the back-end price manipulation.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"17 1","pages":"407 - 427"},"PeriodicalIF":1.3,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90198164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-02-28DOI: 10.1080/03155986.2022.2041331
Xianmei Wang, Hanhui Hu, Yuqi Wei
Abstract The performance of the provincial cable television (CATV) industry in China has become one of the main points of interest as competition in this market intensifies and policy making gradually moves from the central to the provincial level with the introduction of Internet Protocol Television (IPTV) and Over the Top (OTT). The CATV industry has two different vertically integrated activities: program production and service transmitting. In this paper, we develop a dynamic framework to describe an integrated system aiming to reflect the operation process of the CATV industry. Considering the service transmitting division further affects the program production division in the following period, this paper proposes a multi-period two-stage DEA model with feedback structures between service transmitting stage in the current period and program production stage in the next period to evaluate the relative performance. Detailed empirical results are presented from a panel data set of Chinese CATV industry from 2010 to 2019, covering two Five-Year Plans.
{"title":"Multi-period two-stage DEA model: measuring performance of integrated production and service systems in Chinese cable TV industry","authors":"Xianmei Wang, Hanhui Hu, Yuqi Wei","doi":"10.1080/03155986.2022.2041331","DOIUrl":"https://doi.org/10.1080/03155986.2022.2041331","url":null,"abstract":"Abstract The performance of the provincial cable television (CATV) industry in China has become one of the main points of interest as competition in this market intensifies and policy making gradually moves from the central to the provincial level with the introduction of Internet Protocol Television (IPTV) and Over the Top (OTT). The CATV industry has two different vertically integrated activities: program production and service transmitting. In this paper, we develop a dynamic framework to describe an integrated system aiming to reflect the operation process of the CATV industry. Considering the service transmitting division further affects the program production division in the following period, this paper proposes a multi-period two-stage DEA model with feedback structures between service transmitting stage in the current period and program production stage in the next period to evaluate the relative performance. Detailed empirical results are presented from a panel data set of Chinese CATV industry from 2010 to 2019, covering two Five-Year Plans.","PeriodicalId":13645,"journal":{"name":"Infor","volume":"504 1","pages":"385 - 406"},"PeriodicalIF":1.3,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76509570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：