Sequencing Appointments for Service Systems Using Inventory Approximations

Published Online:https://doi.org/10.1287/msom.2013.0470

References

  • Begen MA, Queyranne M (2011) Appointment scheduling with discrete random durations. Math. Oper. Res. 36(2):240–257.LinkGoogle Scholar
  • Begen MA, Levi R, Queyranne M (2012) A sampling-based approach to appointment scheduling. Oper. Res. 60(3):675–681.LinkGoogle Scholar
  • Birge JR, Louveaux F (1997) Introduction to Stochastic Programming (Springer, New York).Google Scholar
  • Cardoen B, Demeulemeester E (2011) A decision support system for surgery sequencing at UZ Leuven's day-care department. Internat. J. Inform. Tech. Decision Making 10(3):435–450.CrossrefGoogle Scholar
  • Cardoen B, Demeulemeester E, Belien J (2010) Operating room planning and scheduling: A literature review. Eur. J. Oper. Res. 201(3):921–932.CrossrefGoogle Scholar
  • Cayirli T, Veral E (2003) Outpatient scheduling in health care: A review of literature. Production Oper. Management 12(4): 519–549.CrossrefGoogle Scholar
  • Chen F, Song JS (2001) Optimal policies for multiechelon inventory problems with Markov-modulated demand. Oper. Res. 49(2):226–234.LinkGoogle Scholar
  • Chen F, Zheng Y-S (1994) Lower bounds for multi-echelon stochastic inventory systems. Management Sci. 40(11):1426–1443.LinkGoogle Scholar
  • Chen RR, Robinson LW (2014) Sequencing and scheduling appointments with potential call-in patients. Production Oper. Management. Forthcoming.CrossrefGoogle Scholar
  • Clark AJ, Scarf H (1960) Optimal policies for a multi-echelon inventory problem. Management Sci. 6(4):475–490.LinkGoogle Scholar
  • DeCoster C, Carriere KC, Peterson S, Walld R, MacWilliam L (1999) Waiting times for surgical procedures. Medical Care 37(6): JS187–JS205.Google Scholar
  • Denton BT, Gupta D (2003) A sequential bounding approach for optimal appointment scheduling. IIE Trans. 35(11):1003–1016.CrossrefGoogle Scholar
  • Denton BT, Viapiano J, Vogl A (2007) Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Management Sci. 10(1):13–24.CrossrefGoogle Scholar
  • Denton BT, Miller AJ, Balasubramanian HJ, Huschka TR (2010) Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4):802–816.LinkGoogle Scholar
  • Erdogan SA, Denton BT (2011) Surgery planning and scheduling. Cochran JJ, Cox LA Jr, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (Wiley, Hoboken, NJ).CrossrefGoogle Scholar
  • Gallego G, Viapiano J, Ozer O (2005) A new algorithm and a new heuristic for serial supply systems. Oper. Res. Lett. 33(4):349–362.CrossrefGoogle Scholar
  • Ge D, Wan G, Wang Z, Zhang J (2013) A note on appointment scheduling with piecewise linear cost functions. Math. Oper. Res., ePub ahead of print November 13, http://dx.doi.org/10.1287/moor.2013.0631.Google Scholar
  • Glasserman P, Tayur S (1994) The stability of a capacitated, multi-echelon production-inventory system under a base-stock policy. Oper. Res. 42(5):913–925.LinkGoogle Scholar
  • Gupta D (2007) Surgical suites operations management. Production Oper. Management 16(6):689–700.CrossrefGoogle Scholar
  • Gupta D, Denton BT (2008) Appointment scheduling in health care: Challenges and opportunities. IIE Trans. 40(9):800–819.CrossrefGoogle Scholar
  • Huh WT, Janakiraman G (2008) A sample-path approach to the optimality of echelon order-up-to policies in serial inventory systems. Oper. Res. Lett. 36(5):547–550.CrossrefGoogle Scholar
  • Huh WT, Janakiraman G, Nagarajan M (2010) Capacitated serial inventory systems: Sample path and stability properties under base-stock policies. Oper. Res. 58(4):1017–1022.LinkGoogle Scholar
  • Kaandorp GC, Koole G (2007) Optimal outpatient appointment scheduling. Health Care Management Sci. 10(3):217–229.CrossrefGoogle Scholar
  • Kong Q, Lee C, Teo CP, Zheng Z (2013) Scheduling arrivals to a stochastic service delivery system using copositive cones. Oper. Res. 61(3):711–726.LinkGoogle Scholar
  • Liao C-J, Pegden CD, Rosenshine M (1993) Planning timely arrivals to a stochastic production or service system. IIE Trans. 25(5): 63–73.CrossrefGoogle Scholar
  • Macario A (2010) Is it possible to predict how long a surgery will last? Medscape Anesthesiology 108(3):681–685.Google Scholar
  • Mancilla C, Storer RH (2012) A sample average approximation approach to stochastic appointment sequencing and scheduling. IIE Trans. 44(8):655–670.CrossrefGoogle Scholar
  • Moon I, Gallego G (1994) Distribution free procedures for some inventory models. J. Oper. Res. Soc. 45(6):651–658.CrossrefGoogle Scholar
  • Olivares M, Terwiesch C, Cassorla L (2008) Structural estimation of the newsvendor model: An application to reserving operating room time. Management Sci. 54(1):41–55.LinkGoogle Scholar
  • Perakis G, Roels G (2008) Regret in the newsvendor model with partial information. Oper. Res. 56(1):188–203.LinkGoogle Scholar
  • Robinson LW, Chen RR (2003) Scheduling doctors's appointments: Optimal and empirically-based heuristic policies. IIE Trans. 35(3):295–307.CrossrefGoogle Scholar
  • Sabria F, Daganzo CF (1989) Approximate expressions for queueing systems with scheduled arrivals and established service order. Transportation Sci. 23(3):159–165.LinkGoogle Scholar
  • Sauder School of Business (2011) Innovative Sauder-BC Cancer Agency system reduces waitlisting for chemotherapy. (July 4), http://www.sauder.ubc.ca/News/2011/Sauder-BC_Cancer_Agency_system_reduces_waitlisting_for_chemotherapy.Google Scholar
  • Scarf H (1958) A min-max solution of an inventory problem. Arrow K, Karlin S, Scarf H, eds. Studies in the Mathematical Theory of Inventory and Production (Stanford University Press, Stanford, CA), 201–209.Google Scholar
  • See CT, Sim M (2010) Robust approximation to multiperiod inventory management. Oper. Res. 58(3):583–594.LinkGoogle Scholar
  • Shang KH, Song JS (2003) Newsvendor bounds and heuristic for optimal policies in serial supply chains. Management Sci. 49(5):618–638.LinkGoogle Scholar
  • Van Mieghem JA (2000) Price and service discrimination in queuing systems: Incentive compatibility of Gcμ scheduling. Management Sci. 46(9):1249–1267.LinkGoogle Scholar
  • Vanden Bosch PM, Dietz DC (2000) Minimizing expected waiting in a medical appointment system. IIE Trans. 32(9):841–848.CrossrefGoogle Scholar
  • Vanden Bosch PM, Dietz DC (2001) Scheduling and sequencing arrivals to an appointment system. J. Service Res. 4(1):15–25.CrossrefGoogle Scholar
  • Wang P (1993) Static and dynamic scheduling of customer arrivals to a single-server system. Naval Res. Logist. 40(3):345–360.CrossrefGoogle Scholar
  • Weiss EN (1990) Models for determining estimated start times and case orderings in hospital operating rooms. IIE Trans. 22(2): 143–150.CrossrefGoogle Scholar
  • Zacharias C, Pinedo M (2013) Appointment scheduling with no-shows and overbooking. Production Oper. Management, ePub ahead of print August 23, doi: 10.1111/poms.12065.Google Scholar
  • Zhu Z, Zhang J, Ye Y (2013) Newsvendor optimization with limited distribution information. Optim. Methods and Software 28(3): 640–667.CrossrefGoogle Scholar
  • Zipkin P (2000) Foundations of Inventory Management (McGraw-Hill New York).Google 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.