Appointment Scheduling with Discrete Random Durations

References

• Begen M. A., Queyranne M. Appointment scheduling with discrete random durations. Proc. 20th Annual ACM—SIAM Sympos. Discrete Algorithms (2009) (SIAM, New York) 845–854Crossref, Google Scholar
• Begen M. A., Queyranne M. Minimizing a discrete-convex function for appointment scheduling. (2011) . Working paper, University of Western Ontario, London, Ontario, CanadaGoogle Scholar
• Begen M. A., Queyranne M. Advance multi-period quantity commitment and appointment scheduling. (2011) . Working paper, University of Western Ontario, London, Ontario, CanadaGoogle Scholar
• Begen M. A., Levi R., Queyranne M. A sampling-based approach to appointment scheduling. (2011) . Under review, University of Western Ontario, London, Ontario, CanadaGoogle Scholar
• Begen M. A., Ryan C. T., Queyranne M. Incentive-based surgery scheduling: Determining optimal number of surgeries. (2011) . Working paper, University of Western Ontario, London, Ontario, Canada. ForthcomingGoogle Scholar
• Bendavid I., Golany B. Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology. Ann. Oper. Res. (2009) 172(1):259–276Crossref, Google Scholar
• Bosch P. M. V., Dietz D. C., Simeoni J. R. Scheduling customer arrivals to a stochastic service system. Naval Res. Logist. (1999) 46(5):549–559Crossref, Google Scholar
• Cardoen B., Demeulemeester E., Belien J. Operating room planning and scheduling: A literature review. Eur. J. Oper. Res. (2010) 201(3):921–932Crossref, Google Scholar
• Cayirli T., Veral E. Outpatient scheduling in health care: A review of literature. Production Oper. Management (2003) 12(4):519–549Crossref, Google Scholar
• Denton B., Gupta D. A sequential bounding approach for optimal appointment scheduling. IIE Trans. (2003) 35(11):1003–1016Crossref, Google Scholar
• Elhafsi M. Optimal leadtime planning in serial production systems with earliness and tardiness costs. IIE Trans. (2002) 34(3):233–243Crossref, Google Scholar
• Fleischer L. Recent progress in submodular function minimization. OPTIMA: Math. Programming Soc. Newsletter (2000) 64(9):1–11Google Scholar
• Fujishige S.Submodular Functions and Optimization (2005) (Elsevier, Amsterdam) Google Scholar
• Green L., Savin S., Wang B. Managing patient service in a diagnostic medical facility. Oper. Res. (2006) 54(1):11–25Link, Google Scholar
• Gupta D., Wang L. Revenue management for a primary-care clinic in the presence of patient choice. Oper. Res. (2008) 56(3):576–592Link, Google Scholar
• Hassin R., Mendel S. Scheduling arrivals to queues: A single-server model with no-shows. Management Sci. (2008) 54(3):565–572Link, Google Scholar
• Iwata S. Submodular function minimization. Math. Programming (2008) 112(1):45–64Crossref, Google Scholar
• Kaandorp G. C., Koole G. Optimal outpatient appointment scheduling. Health Care Man. Sci. (2007) 10(3):217–229Crossref, Google Scholar
• Luzon Y., Mandelbaum A., Penn M. Scheduling appointments via fluids control. Internat. Conf. Model-Based System Engrg. (2009) (IEEE, Piscataway, NJ) Crossref, Google Scholar
• McCormick S. T., Aardal K., Nemhauser G., Weismantel R. Submodular function minimization. Handbook on Discrete Optimization (2006) (Elsevier, Amsterdam) 321–391Google Scholar
• Murota K. Discrete convex analysis. Math. Programming (1998) 83(3):313–371Crossref, Google Scholar
• Murota K.Discrete Convex Analysis (2003) 10(Society for Industrial and Applied Mathematics, Philadelphia) SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Murota K. On steepest descent algorithms for discrete convex functions. SIAM J. Optim. (2003) 14(3):699–707Crossref, Google Scholar
• Murota K., Cook W., Lovasz L., Vygen J. Recent developments in discrete convex analysis. Research Trends in Combinatorial Optimization (2009) (Springer-Verlag, Berlin/Heidelberg) 219–260Crossref, Google Scholar
• Orlin J. B. A faster strongly polynomial time algorithm for submodular function minimization. Math. Programming (2007) 118(2):237–251Crossref, Google Scholar
• Patrick J., Puterman M. L., Queyranne M. Dynamic multipriority patient scheduling for a diagnostic resource. Oper. Res. (2008) 56(6):1507–1525Link, Google Scholar
• Pinedo M. Stochastic scheduling with release dates and due dates. Oper. Res. (1993) 31(3):559–572Link, Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms, and Systems (2001) (Prentice Hall, New York) Google Scholar
• Robinson L. W., Chen R. R. Scheduling doctors' appointments: Optimal and empirically based heuristic policies. IIE Trans. (2003) 35:295–307Crossref, Google Scholar
• Robinson L. W., Gerchak Y., Gupta D. Appointment times which minimize waiting and facility idleness. (1996) . Working paper, DeGroote School of Business, McMaster University, Hamilton, Ontario, CanadaGoogle Scholar
• Sabria F., Daganzo C. F. Approximate expressions for queuing systems with scheduling arrivals and established service order. Transportation Sci. (1989) 23(3):159–165Link, Google Scholar
• Santibanez P., Begen M., Atkins D. Surgical block scheduling in a system of hospitals: An application to resource and wait list management in a British Columbia health authority. Health Care Management Sci. (2007) 10(2):269–282Crossref, Google Scholar
• Schutz H.-J., Kolisch R. Capacity allocation for demand of different customer–product combinations with cancellations, no-shows, and overbooking when there is a sequential delivery of service. (2008) . Working paper, School of Management, Technische Universität, Munchen, GermanyGoogle Scholar
• Strum D. P., May J. H., Vargas L. G. Modeling the uncertainty of surgical procedure times: Comparison of log-normal and normal models. Anesthesiology (2000) 92(4):1160–1167Crossref, Google Scholar
• Topkis D. M. Minimizing a submodular function on a lattice. Oper. Res. (1978) 26(2):305–321Link, Google Scholar
• Wang P. P. Static and dynamic scheduling of customer arrivals to a single-server system. Naval Res. Logist. (1993) 40(3):345–360Crossref, Google Scholar
• Wang P. P. Sequencing and scheduling n customers for a stochastic server. Eur. J. Oper. Res. (1999) 119(3):729–738Crossref, Google Scholar
• Weiss E. N. Models for determining estimated start times and case orderings in hospital operating rooms. IIE Trans. (1990) 22(2):143–150Crossref, Google Scholar
• Zipkin P. On the structure of lost-sales inventory models. Oper. Res. (2008) 56(4):937–944Link, Google Scholar