Manufacturing & Service Operations Management最新文献

筛选
英文 中文
Erratum: Correction of Affiliation 勘误:隶属关系更正
Manufacturing & Service Operations Management Pub Date : 2022-06-23 DOI: 10.1287/msom.2022.1121
{"title":"Erratum: Correction of Affiliation","authors":"","doi":"10.1287/msom.2022.1121","DOIUrl":"https://doi.org/10.1287/msom.2022.1121","url":null,"abstract":"","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128374893","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MSOM Society Student Paper Competition: Abstracts of 2021 Winners MSOM协会学生论文竞赛:2021年获奖者摘要
Manufacturing & Service Operations Management Pub Date : 2022-05-01 DOI: 10.1287/msom.2013.0467
Ashish Kabra, D. Sabán, Fei Gao, Tugce G. Martagan, Hummy Song, Şafak Yücel
{"title":"MSOM Society Student Paper Competition: Abstracts of 2021 Winners","authors":"Ashish Kabra, D. Sabán, Fei Gao, Tugce G. Martagan, Hummy Song, Şafak Yücel","doi":"10.1287/msom.2013.0467","DOIUrl":"https://doi.org/10.1287/msom.2013.0467","url":null,"abstract":"The journal is pleased to publish the abstracts of the six finalists of the 2021 Manufacturing and Service Operations Management Society’s student paper competition. The 2021 prize committee was chaired by Vishal Agrawal (Georgetown University), Florin Ciocan (INSEAD), and Yanchong Zheng (Massachusetts Institute of Technology). The judges were Adam Elmachtoub, Adem Orsdemir, Amrita Kundu, Antoine Desir, Anyan Qi, Arian Aflaki, Arzum Akkas, Ashish Kabra, Bin Hu, Bora Keskin, Brent Moritz, Can Zhang, Chloe Kim Glaeser, Dan Iancu, Daniel Freund, Daniel Lin, Daniela Saban, David F. Drake, Dawson Kaaua, Divya Singhvi, Ekaterina Astashkina, Elena Belavina, Elodie Adida, Enis Kayis, Ersin Korpeoglu, Evgeny Kagan, Fabian Sting, Fanyin Zheng, Fei Gao, Fernanda Bravo, Francisco Castro, Georgina Hall, Gonzalo Romero, Guangwen Kong, Guoming Lai, Hamsa Bastani, Hessam Bavafa, Hummy Song, Ioannis (Yannis) Stamatopoulos, Ioannis Bellos, Iris Wang, Jake Feldman, Jason Acimovic, Jiankun Sun, Jiaru Bai, John Silberholz, Joline Uichanco, Jonas Oddur Jonasson, Jose Guajardo, Kaitlin Daniels, Kenan Arifoglu, Lennart Baardman, Leon Valdes, Lesley Meng, Luyi Gui, Luyi Yang, Mary Parkinson, Mazhar Arikan, Mehmet Ayvaci, Miao Bai, Michael Freeman, Ming Hu, Morvarid Rahmani, Mumin Kurtulus, Nan Yang, Nektarios Oraiopoulos, Nikhil Garg, Nil Karacaoglu, Nitin Bakshi, Nur Sunar, Olga Perdikaki, Ovunc Yilmaz, Ozan Candogan, Ozge Sahin, Panos Markou, Pascale Crama, Pengyi Shi, Pnina Feldman, Qiuping Yu, Renyu Zhang, Ruslan Momot, Ruth Beer, Ruxian Wang, Saed Alizamir, Safak Yucel, Samantha Keppler, Sanjith Gopalakrishnan, Santiago Gallino, Sarah Yini Gao, Sebastien Martin, Serdar Simsek, Seyed Emadi, Shima Nassiri, Shouqiang Wang, Siddharth Singh, Simone Marinesi, So Yeon Chun, Somya Singhvi, Song-Hee Kim, Soo-Haeng Cho, Soroush Saghafian, Sriram Dasu, Stefanus Jasin, Stephen Leider, Suresh Muthulingam, Suvrat Dhanorkar, Tian Chan, Tim Kraft, Tom TAN, Tugce Martagan, Velibor Misic, Vishal Gupta, Weiming Zhu, Xiajun Amy Pan, Xiaoshan Peng, Xiaoyang Long, Yangfang (Helen) Zhou, Yehua Wei, Yiangos Papanastasiou, Ying-Ju Chen, Yinghao Zhang, Yoni Gur, Yuqian Xu, Zhaohui (Zoey) Jiang, Zumbul Atan.","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131080720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Acknowledgment to Editors and Reviewers (2021) 对编辑和审稿人的感谢(2021)
Manufacturing & Service Operations Management Pub Date : 2022-05-01 DOI: 10.1287/msom.2017.0632
{"title":"Acknowledgment to Editors and Reviewers (2021)","authors":"","doi":"10.1287/msom.2017.0632","DOIUrl":"https://doi.org/10.1287/msom.2017.0632","url":null,"abstract":"The continued success of Manufacturing & Service Operations Management (M&SOM) relies on the support of authors and reviewers. On behalf of M&SOM, I would like to express my sincere appreciation to the department editors, guest editors, associate editors, guest associate editors, and reviewers who provided expert counsel and guidance on a voluntary basis. The following list acknowledges those who served from January to December 2021. Through their efforts, the journal was able to provide submitting authors with timely, thoughtful, and constructive reviews. I hereby acknowledge their service for the journal and gratefully appreciate their contributions for our profession. Georgia Perakis, M&SOM editor","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130953870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Demand Learning and Pricing for Varying Assortments 不同分类的需求学习与定价
Manufacturing & Service Operations Management Pub Date : 2022-03-14 DOI: 10.1287/msom.2022.1080
K. Ferreira, Emily Mower
{"title":"Demand Learning and Pricing for Varying Assortments","authors":"K. Ferreira, Emily Mower","doi":"10.1287/msom.2022.1080","DOIUrl":"https://doi.org/10.1287/msom.2022.1080","url":null,"abstract":"Problem definition: We consider the problem of demand learning and pricing for retailers who offer assortments of substitutable products that change frequently, for example, due to limited inventory, perishable or time-sensitive products, or the retailer’s desire to frequently offer new styles. Academic/practical relevance: We are one of the first to consider the demand learning and pricing problem for retailers who offer product assortments that change frequently, and we propose and implement a learn-then-earn algorithm for use in this setting. Our algorithm prioritizes a short learning phase, an important practical characteristic that is only considered by few other algorithms. Methodology: We develop a novel demand learning and pricing algorithm that learns quickly in an environment with varying assortments and limited price changes by adapting the commonly used marketing technique of conjoint analysis to our setting. We partner with Zenrez, an e-commerce company that partners with fitness studios to sell excess capacity of fitness classes, to implement our algorithm in a controlled field experiment to evaluate its effectiveness in practice using the synthetic control method. Results: Relative to a control group, our algorithm led to an expected initial dip in revenue during the learning phase, followed by a sustained and significant increase in average daily revenue of 14%–18% throughout the earning phase, illustrating that our algorithmic contributions can make a significant impact in practice. Managerial implications: The theoretical benefit of demand learning and pricing algorithms is well understood—they allow retailers to optimally match supply and demand in the face of uncertain preseason demand. However, most existing demand learning and pricing algorithms require substantial sales volume and the ability to change prices frequently for each product. Our work provides retailers who do not have this luxury a powerful demand learning and pricing algorithm that has been proven in practice.","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115033843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Robust and Heterogenous Odds Ratio: Estimating Price Sensitivity for Unbought Items 稳健性和异质性优势比:估计未购买物品的价格敏感性
Manufacturing & Service Operations Management Pub Date : 2021-06-21 DOI: 10.1287/msom.2022.1118
J. Pauphilet
{"title":"Robust and Heterogenous Odds Ratio: Estimating Price Sensitivity for Unbought Items","authors":"J. Pauphilet","doi":"10.1287/msom.2022.1118","DOIUrl":"https://doi.org/10.1287/msom.2022.1118","url":null,"abstract":"Problem definition: Mining for heterogeneous responses to an intervention is a crucial step for data-driven operations, for instance, to personalize treatment or pricing. We investigate how to estimate price sensitivity from transaction-level data. In causal inference terms, we estimate heterogeneous treatment effects when (a) the response to treatment (here, whether a customer buys a product) is binary, and (b) treatment assignments are partially observed (here, full information is only available for purchased items). Methodology/Results: We propose a recursive partitioning procedure to estimate heterogeneous odds ratio, a widely used measure of treatment effect in medicine and social sciences. We integrate an adversarial imputation step to allow for robust estimation even in presence of partially observed treatment assignments. We validate our methodology on synthetic data and apply it to three case studies from political science, medicine, and revenue management. Managerial implications: Our robust heterogeneous odds ratio estimation method is a simple and intuitive tool to quantify heterogeneity in patients or customers and personalize interventions, while lifting a central limitation in many revenue management data.","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123655151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multi-purchase Behavior: Modeling, Estimation, and Optimization 多重购买行为:建模、估计和优化
Manufacturing & Service Operations Management Pub Date : 2020-06-14 DOI: 10.1287/msom.2020.0238
Theja Tulabandhula, Deeksha Sinha, Saketh Reddy Karra, Prasoon Patidar
{"title":"Multi-purchase Behavior: Modeling, Estimation, and Optimization","authors":"Theja Tulabandhula, Deeksha Sinha, Saketh Reddy Karra, Prasoon Patidar","doi":"10.1287/msom.2020.0238","DOIUrl":"https://doi.org/10.1287/msom.2020.0238","url":null,"abstract":"Problem definition: We study the problem of modeling purchase of multiple products and using it to display optimized recommendations for online retailers and e-commerce platforms. Rich modeling of users and fast computation of optimal products to display given these models can lead to significantly higher revenues and simultaneously enhance the user experience. Methodology/results: We present a parsimonious multi-purchase family of choice models called the BundleMVL-K family and develop a binary search based iterative strategy that efficiently computes optimized recommendations for this model. We establish the hardness of computing optimal recommendation sets and derive several structural properties of the optimal solution that aid in speeding up computation. This is one of the first attempts at operationalizing multi-purchase class of choice models. We show one of the first quantitative links between modeling multiple purchase behavior and revenue gains. The efficacy of our modeling and optimization techniques compared with competing solutions is shown using several real-world data sets on multiple metrics such as model fitness, expected revenue gains, and run-time reductions. For example, the expected revenue benefit of taking multiple purchases into account is observed to be [Formula: see text] in relative terms for the Ta Feng and UCI shopping data sets compared with the multinomial choice model for instances with ∼1,500 products. Additionally, across six real-world data sets, the test log-likelihood fits of our models are on average 17% better in relative terms. Managerial implications: Our work contributes to the study of multi-purchase decisions, analyzing consumer demand, and the retailers optimization problem. The simplicity of our models and the iterative nature of our optimization technique allows practitioners meet stringent computational constraints while increasing their revenues in practical recommendation applications at scale, especially in e-commerce platforms and other marketplaces. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2020.0238 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132611411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge 提前销售如何降低利润:什么时候买,什么时候卖,收取什么价格
Manufacturing & Service Operations Management Pub Date : 2019-12-05 DOI: 10.1287/msom.2023.1218
A. Glazer, Refael Hassin, Irit Nowik
{"title":"How Advance Sales Can Reduce Profits: When to Buy, When to Sell, and What Price to Charge","authors":"A. Glazer, Refael Hassin, Irit Nowik","doi":"10.1287/msom.2023.1218","DOIUrl":"https://doi.org/10.1287/msom.2023.1218","url":null,"abstract":"Problem definition: Consider consumers who prefer to consume a good later rather than earlier. If the price is constant, then we would expect consumers to wait to buy the good. That does not hold if consumers are concerned that others will buy the good early, so that a shortage will later occur. When will consumers arrive when they fear a shortage? What is the profit-maximizing policy of a monopolist? Might the firm lose profits by offering advance sales? The timing of consumer arrivals is much studied. Little consideration, however, has addressed how anticipated shortages affect arrival times. The application is important: managers want to know when consumers will arrive, when they should make the product available, and what price to charge to maximize profits. Methodology/results: We use game theory. We analyze analytically outcomes when a single item is for sale: we give closed solutions for the equilibrium customer behavior and profit-maximizing firm strategy and conduct sensitivity analysis. For generalization concerning more than one unit, we give some analytical results and provide many numerical solutions. When the price is constant over time, then even with no operating cost of doing so, offering advance sales reduces profits. If, however, the firm must offer both advance sales and later sales, then the profit-maximizing price induces all arrivals at the same time (either early or late, depending on the parameters). An increase in the number of units offered for sale increases the profit-maximizing price and increases the firm’s expected profit. The equilibrium strategy of consumers can generate some unexpected behavior. The arrival rate may increase with the price of the good. For a given price, an increase in the number of units for sale increases the number of consumers who arrive early. Managerial implications: The firm should offer the good only at the time consumers most desire it, and not earlier. Additionally, the profit-maximizing price can be derived from our analysis. This price is not the price which maximizes the expected number of arrivals. Funding: This work was supported by the Israel Science Foundation [Grant 852/22]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.1218 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127994190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信