The Assortment Packing Problem: Multiperiod Assortment Planning for Short-Lived Products

Published Online:https://doi.org/10.1287/mnsc.2014.1991

References

  • Abernathy FH, Dunlop JT, Hammond JH, Weil D (1999) A Stitch in Time: Lean Retailing and the Transformation of Manufacturing—Lessons from the Apparel and Textile Industries (Oxford University Press, New York).Google Scholar
  • Ainslie A, Drèze X, Zufryden F (2005) Modeling movie life cycles and market share. Marketing Sci. 24(3):508–517.LinkGoogle Scholar
  • Allon G, Federgruen A, Pierson M (2010) Price competition under multinomial logit demand functions with random coefficients. Working paper, Kellogg School of Management, Northwestern University, Evanston, IL.Google Scholar
  • Aydin G, Porteus EL (2008) Joint inventory and pricing decisions for an assortment. Oper. Res. 56(5):1247–1255.LinkGoogle Scholar
  • Bell DE, Keeney RL, Little JDC (1975) A market share theorem. J. Marketing Res. 12(2):136–141.CrossrefGoogle Scholar
  • Benson HP (2007) A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. Eur. J. Oper. Res. 182(2):597–611.CrossrefGoogle Scholar
  • Bernstein F, Kök AG, Xie L (2014) Dynamic assortment customization with limited inventories. Working paper, Duke University, Durham, NC.Google Scholar
  • Bertsimas D, Popescu I (2003) Revenue management in a dynamic network environment. Transportation Sci. 37(3):257–277.LinkGoogle Scholar
  • Bertsimas D, Teo C, Vohra R (1999) On dependent randomized rounding algorithms. Oper. Res. Lett. 24:105–114.CrossrefGoogle Scholar
  • Besbes O, Sauré D (2013) Product assortment and price competition with informed consumers. Working paper, Graduate School of Business, Columbia University, New York.Google Scholar
  • Bront JM, Mendez Diaz I, Vulcano G (2009) A column generation algorithm for choice-based network revenue management. Oper. Res. 57(3):769–784.LinkGoogle Scholar
  • Caro F, Gallien J (2007) Dynamic assortment with demand learning for seasonal consumer goods. Management Sci. 53(2):276–292.LinkGoogle Scholar
  • Caro F, Martínez-de-Albéniz V (2012) Product and price competition with satiation effects. Management Sci. 58(7):1357–1373.LinkGoogle Scholar
  • Druehl CT, Schmidt GM, Souza GC (2009) The optimal pace of product updates. Eur. J. Oper. Res. 192(2):621–633.CrossrefGoogle Scholar
  • Economist, The (2007) Endless summer—How the business of making blockbusters has changed. (April 26), http://www.economist.com/node/9079888.Google Scholar
  • Elberse A, Eliashberg J (2003) Demand and supply dynamics for sequentially released products in international markets: The case of motion pictures. Marketing Sci. 22(3):329–354.LinkGoogle Scholar
  • Farias VF, Madan R (2011) Irrevocable multiarmed bandit policies. Oper. Res. 59(2):383–399.LinkGoogle Scholar
  • Farias VF, Jagabathula S, Shah D (2013) A nonparametric approach to modeling choice with limited data. Management Sci. 59(2): 305–322.LinkGoogle Scholar
  • H&M (2007) Annual report 2007. Report, H&M, Stockholm. Last accessed September 23, 2014, http://about.hm.com/content/dam/hm/about/documents/en/Annual%20Report/Annual_Report _2007_en.pdf.Google Scholar
  • Honhon D, Gaur V, Seshadri S (2010) Assortment planning and inventory decisions under stockout-based substitution. Oper. Res. 58(5):1364–1379.LinkGoogle Scholar
  • Honhon D, Kök AG (2011) Assortment planning with variety-seeking customers. Presented at the 2010 INFORMS Annual Meeting, Austin, TX.Google Scholar
  • Kalish S, Mahajan V, Muller E (1995) Waterfall and sprinkler new-product strategies in competitive global markets. Internat. J. Res. Marketing 12(2):105–119.CrossrefGoogle Scholar
  • Kök AG, Fisher M, Vaidyanathan R (2008) Assortment planning: Review of literature and industry practice. Retail Supply Chain Management (Springer, New York).CrossrefGoogle Scholar
  • Kuno T (2002) A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Global Optim. 22(1):155–174.CrossrefGoogle Scholar
  • Lim WS, Tang CS (2006) Optimal product rollover strategies. Eur. J. Oper. Res. 174(2):905–922.CrossrefGoogle Scholar
  • Mahajan S, van Ryzin GJ (2001) Stocking retail assortments under dynamic consumer substitution. Oper. Res. 49(3):334–351.LinkGoogle Scholar
  • Moskin J (2011) The perfect menu. Now change it. New York Times (February 15), http://www.nytimes.com/2011/02/16/dining/16next.html.Google Scholar
  • Raghavan P, Thompson C (1987) Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7:365–374.CrossrefGoogle Scholar
  • Rusmevichientong P, Shen Z-JM, Shmoys DB (2010) Dynamic assortment optimization with a multinomial logit choice model and capacity constraint. Oper. Res. 58(6):1666–1680.LinkGoogle Scholar
  • Sauré D, Zeevi A (2013) Optimal dynamic assortment planning with demand learning. Manufacturing Service Oper. Management 15(3):387–404.LinkGoogle Scholar
  • Savin S, Terwiesch C (2005) Optimal product launch times in a duopoly: Balancing life-cycle revenues with product cost. Oper. Res. 53(1):26–47.LinkGoogle Scholar
  • Schaible S, Shi J (2003) Fractional programming: The sum-of-ratios case. Optim. Methods and Software 18(2):219–229.CrossrefGoogle Scholar
  • Smith SA, Agrawal N (2000) Management of multi-item retail inventory systems with demand substitution. Oper. Res. 48(1): 50–64.LinkGoogle Scholar
  • Talluri K, van Ryzin GJ (2004) Revenue management under a general discrete choice model of consumer behavior. Management Sci. 50(1):15–33.LinkGoogle Scholar
  • Tiplady R (2006) Zara: Taking the lead in fast-fashion. Business Week (April 4), http://www.businessweek.com/stories/2006-04-04/zara-taking-the-lead-in-fast -fashionbusinessweek-business-news-stock-market-and-financial-advice.Google Scholar
  • Ulu C, Honhon D, Alptekinoğlu A (2012) Learning consumer tastes through dynamic assortments. Oper. Res. 60(4):833–849.LinkGoogle Scholar
  • van Ryzin G, Mahajan S (1999) On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. 45(11):1496–1509.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.