Expected Tardiness Computations in Multiclass Priority M/M/c Queues

Published Online:https://doi.org/10.1287/ijoc.1120.0507

References

  • Abate GL, Choudhury J, Whitt W. An introduction to numerical inversion and its applications to probability models. Computational Probability (1999) (Kluwer Academic Publishers, Norwell, MA) Google Scholar
  • Abate J, Valko PP. Multi-precision Laplace transform inversion. Internat. J. Numerical Methods Engrg. (2004) 60(5):979–993CrossrefGoogle Scholar
  • Abate J, Whitt W. The Fourier-series method for inverting transforms of probability distributions. Queueing Systems (1992) 10(1–2):5–88CrossrefGoogle Scholar
  • Abate J, Whitt W. A unified framework for numerically inverting Laplace transforms. INFORMS J. Comput. (2006) 18(4):408–421LinkGoogle Scholar
  • Avdis E, Whitt W. Power algorithms for inverting Laplace transforms. INFORMS J. Comput. (2007) 19(3):341–355LinkGoogle Scholar
  • Baker KR, Bertrand JWM. A comparison of due-date selection-rules. AIIE Trans. (1981) 13(2):123–131CrossrefGoogle Scholar
  • Bertrand JWM. The effect of workload dependent due-dates on job shop performance. Management Sci. (1983) 29(7):799–816LinkGoogle Scholar
  • Bookbinder JH, Noor AI. Setting job-shop due-dates with service-level constraints. J. Oper. Res. Soc. (1985) 36(11):1017–1026CrossrefGoogle Scholar
  • Davis PJ, Rabinowitz P. Methods of Numerical Integration (1984) (Academic Press Inc., Orlando, FL) Google Scholar
  • Davis RH. Waiting-time distribution of a multiserver priority queuing system. Oper. Res. (1966) 14(1):133–136LinkGoogle Scholar
  • Doetsch G. Introduction to the Theory and Application of the Laplace Transforms (1974) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Dubner H, Abate J. Numerical inversion of Laplace transforms by relating them to finite Fourier cosine transform. J. ACM (1968) 15(1):115–123CrossrefGoogle Scholar
  • Duenyas I. Single facility due-date setting with multiple customer classes. Management Sci. (1995) 41(4):608–619LinkGoogle Scholar
  • Duenyas I, Hopp WJ. Quoting customer lead times. Management Sci. (1995) 41(1):43–57LinkGoogle Scholar
  • Duffy DG. On the numerical inversion of Laplace transforms: Comparison of three new methods on characteristic problems from applications. ACM Trans. Math. Software (1993) 19(3):333–359CrossrefGoogle Scholar
  • Feng J, Liu L, Liu X. An optimal policy for joint dynamic price and leadtime quotation. Oper. Res. (2011) 59(6):1523–1527LinkGoogle Scholar
  • Gaver DP. Observing stochastic processes and approximate transform inversion. Oper. Res. (1966) 14(3):444–459LinkGoogle Scholar
  • Hassanzadeh H, Pooladi-Darvish M. Comparison of different numerical Laplace inversion methods for engineering applications. Appl. Math. Comput. (2007) 189(2):1966–1981CrossrefGoogle Scholar
  • Heyman DP, Sobel MJ. Stochastic Models in Operations Research (2004) 1(Dover, Mineola, NY) Google Scholar
  • Hunsucker JL, Shah JR. Performance of priority rules in a due date flow-shop. Omega-Internat. J. Management Sci. (1992) 20(1):73–89CrossrefGoogle Scholar
  • Jagerman DL, Melamed B. Models and approximations for call center design. Methodology Comput. Appl. Probab. (2003) 5(2):159–181CrossrefGoogle Scholar
  • Keskinocak P, Tayur S. Due date management policies. Handbook of Quantitative Supply Chain Analysis: Modeling in the eBusiness Era (2004) (Kluwer Academic Publishers, Norwell, MA) CrossrefGoogle Scholar
  • Lean-manufacturing-japan.com MTO (make to order). (2012) . Retrieved February 18, http://www.lean-manufacturing-japan.com/scm-terminology/mto-make-to-order.htmlGoogle Scholar
  • Merleblanc.de General purchasing terms and conditions of the company Merle Blanc UG & Co.KG. (2012) . Retrieved February 18, http://merleblanc.de/en/ekb.htmlGoogle Scholar
  • Motorola 3 year bronze service plan overview. (2012) . Retrieved February 18, http://www.dcrs.com/pics/db/document_library/000077.pdfGoogle Scholar
  • Paterok M, Ettl M. Sojourn time and waiting time distributions for M/GI/1 queues with preemption-distance priorities. Oper. Res. (1994) 42(6):1146–1161LinkGoogle Scholar
  • Savasaneril S, Griffin PM, Keskinocak P. Dynamic lead-time quotation for an M/M/1 base-stock inventory queue. Oper. Res. (2010) 58(2):383–395LinkGoogle Scholar
  • Segal M. A multiserver system with preemptive priorities. Oper. Res. (1970) 18(2):316–323LinkGoogle Scholar
  • Stanford DA, Drekic S. Interdeparture time distributions in Sigma M-i(i)/G(i)/1 priority queues. Queueing Systems (2000) 36(1–3):1–21CrossrefGoogle Scholar
  • Stehfest H. Numerical inversion of Laplace transforms. Comm. ACM (1970) 13(1):47–49CrossrefGoogle Scholar
  • Wein LM. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Sci. (1991) 37(7):834–850LinkGoogle Scholar
  • Zakian V. Numerical inversion of Laplace transform. Electronics Lett. (1969) 5(6):120–121CrossrefGoogle Scholar
  • Zeltyn S, Feldman Z, Wasserkrug S. Waiting and sojourn times in a multi-server queue with mixed priorities. Queueing Systems (2009) 61(4):305–328CrossrefGoogle 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.