Case Article—DeLand Crayon Company: An Application of the Traveling Salesman Problem to Production Scheduling with Sequence-Dependent Setup Times

Published Online:https://doi.org/10.1287/ited.2019.0216ca

References

  • Alpers A, Trotter LE (2009) Teaching computational discrete optimization at the undergraduate level. INFORMS Trans. Ed. 9(1):63–69.LinkGoogle Scholar
  • Anderson R, Ashlagi I, Gamarnik D, Rees M, Roth AE, Sönmez T, Ünver MU (2015) Kidney exchange and the alliance for paired donation: Operations research changes the way kidneys are transplanted. Interfaces 45(1):26–42.LinkGoogle Scholar
  • Bartholdi JJ III, Platzman LK, Collins RL, Warden WH III (1983) A minimal technology routing system for Meals on Wheels. Interfaces 13(3):1–8.LinkGoogle Scholar
  • Bean JC, Birge JR (1980) Reducing travelling costs and player fatigue in the National Basketball Association. Interfaces 10(3):98–102.LinkGoogle Scholar
  • Beliën J, Colpaert J, De Boeck L, Eyckmans J, Leirens W (2013) Teaching integer programming starting from an energy supply game. INFORMS. Trans. Ed. 13(3):129–137.LinkGoogle Scholar
  • Caramia M, Guerriero F (2010) A milk collection problem with incompatibility constraints. Interfaces 40(2):130–143.LinkGoogle Scholar
  • Chlond MJ (2002) The traveling space telescope problem. INFORMS Trans. Ed. 3(1):69–71.LinkGoogle Scholar
  • Chlond MJ (2016) Puzzle–TSP at the movies: Yondu’s dart problem. INFORMS Trans. Ed. 16(3):110–111.LinkGoogle Scholar
  • Dekker R, de Koster MBM, Roodbergen KJ, van Kalleveen H (2004) Improving order-picking response time at Ankor’s warehouse. Interfaces 34(4):303–313.LinkGoogle Scholar
  • DePuy GW (2009) Puzzle-chain-reaction: A puzzle to demonstrate TSP formulation. INFORMS Trans. Ed. 10(1):41–44.LinkGoogle Scholar
  • Faulin J, Sarobe P, Simal J (2005) The DSS LOGDIS optimizes delivery routes for FRILAC’s frozen products. Interfaces 35(3):24–36.Google Scholar
  • Frontline Solvers. Accessed July 18, 2019, https://www.solver.com/. Google Scholar
  • General Algebraic Modeling System (GAMS). Accessed July 18, 2019, https://www.gams.com/. Google Scholar
  • Garfinkel RS (1977) Minimizing wallpaper waste, part 1: A class of traveling salesman problems. Oper. Res. 25(5):741–751.LinkGoogle Scholar
  • Gorenstein S (1970) Printing press scheduling for multi-edition periodicals. Management Sci. 16(6):B373–B383.LinkGoogle Scholar
  • Holland C, Levis J, Nuggehalli R, Santilli B, Winters J (2017) UPS optimizes delivery routes. Interfaces 47(1):8–23.LinkGoogle Scholar
  • Howick M (1996) A mathematical model for scheduling crayon production on two molding machines. MBA project report, Bowling Green State University, Toledo, OH.Google Scholar
  • Huang Z, Zheng QP (2015) Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs. Optim. Lett. 9(8):1553–1568.CrossrefGoogle Scholar
  • Huang Z, Zheng QP, Pasiliao EL, Simmons D (2017) Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios. Ann. Oper. Res. 249(1–2):141–162.CrossrefGoogle Scholar
  • Huang Z, Zheng QP, Pasiliao EL, Boginski V, Zhang T (2018) A cutting plane method for risk-constrained traveling salesman problem with random arc costs. J. Global Optim., ePub ahead of print September 29, https://doi.org/10.1007/s10898-018-0708-0.Google Scholar
  • Keskin BB, Capar I, Sox CR, Freeman NK (2014) An integrated load-planning algorithm for outbound logistics at Webb Wheel. Interfaces 44(5):480–497.LinkGoogle Scholar
  • Kostuk KJ, Willoughby KA (2012) A decision support system for scheduling the Canadian Football League. Interfaces 42(3):286–293.LinkGoogle Scholar
  • Lee J, Raffensperger JF (2006) Using AMPL for teaching the TSP. INFORMS Trans. Ed. 7(1):37–69.LinkGoogle Scholar
  • Magirou VF (1986) The efficient drilling of printed circuit boards. Interfaces 16(4):13–23.LinkGoogle Scholar
  • Moss S, Dale C, Brame G (2000) Sequence-dependent scheduling at Baxter International. Interfaces 30(2):70–80.LinkGoogle Scholar
  • Pataki G (2003) Teaching integer programming formulations using the traveling salesman problem. SIAM Rev. 45(1):116–123.CrossrefGoogle Scholar
  • Sahoo S, Kim S, Kim B, Kraas B, Popov A Jr (2005) Routing optimization for waste management. Interfaces 35(1):24–36.LinkGoogle Scholar
  • Schultmann F, Engels B, Rentz O (2003) Closed-loop supply chains for spent batteries. Interfaces 33(6):57–71.LinkGoogle Scholar
  • Trick MA (2004) Using sports scheduling to teach integer programming. INFORMS Trans. Ed. 5(1):10–17.LinkGoogle Scholar
  • Trick MA, Yildiz H, Yunes T (2012) Scheduling Major League Baseball umpires and the traveling umpire problem. Interfaces 42(3):232–244.LinkGoogle Scholar
  • Zavichi A, Madani K, Xanthopoulos P, Oloufa A (2014) Enhanced crane operations in construction using service request optimization. Automation Construction 47:69–77.CrossrefGoogle 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.