Allocation of Service Time in a Multiserver System

References

• Abboud N. The Markovian two-echelon repairable item provisioning problem. J. Oper. Res. Soc. (1996) 47:284–296Crossref, Google Scholar
• Abboud N., Daigle J. A Little’s result approach to the service constrained spares provisioning problem for repairable items. Oper. Res. (1997) 45:577–583Link, Google Scholar
• Buzacott J. A. Commonalities in reengineering business processes: Models and issues. Management Sci. (1996) 42:768–782Link, Google Scholar
• Cooper R. B.Introduction to Queueing Theory (1981) 2nd ed.(North-Holland, New York)Google Scholar
• Cosmetatos G. Approximate explicit formulae for the average queueing time in the processes (M/D/r) and (D/M/r). INFOR (1975) 13:328–332Google Scholar
• Disney R. L., Kiessler P. C.Traffic Processes in Queueing Networks (1987) (The Johns Hopkins University Press, Baltimore, MD) Google Scholar
• El-Taha M. Optimal allocation of service time in a two-server system. Comput. Oper. Res. (2003) 30:683–693Crossref, Google Scholar
• Fischer M., Masi D., Gross D., Shortle J., Brill P. Using quantile estimates in simulating Internet queues with Pareto service times. Proc. 2001 Winter Simulation Conf. (2001) (INFORMS Simulation Society, Baltimore, MD) 477–485Crossref, Google Scholar
• Gross D., Harris C.Fundamentals of Queueing Theory (1998) 3rd ed.(John Wiley and Sons, New York) Google Scholar
• Harchol-Balter M. Task assignment with unknown duration. J. Assoc. Comput. Mach. (2002) 49:260–288Crossref, Google Scholar
• Harchol-Balter M., Downey A. B. Exploiting process lifetime distributions for dynamic load balancing. ACM Trans. Comput. Systems (1997) 15:253–285Crossref, Google Scholar
• Harchol-Balter M., Crovella M. E., Murta C. D. On choosing a task assignment policy for a distributed server system. J. Parallel Distributed Comput. (1999) 59:204–228Crossref, Google Scholar
• Hokstad P. Approximation for the M/G/m queue. Oper. Res. (1977) 26:510–523Link, Google Scholar
• Kiefer J., Wolfowitz J. On the characterization of the general queueing process with applications to random walk. Ann. Math. Statist. (1956) 27:147–161Crossref, Google Scholar
• Kimura T. A two-moment approximation for the mean waiting in the G/G/s queue. Management Sci. (1986) 32:751–763Link, Google Scholar
• Kramer W., Langenbach-Belz M. Approximate formulae for the delay in the queueing system GI/G/1. Proc. 8th Internat. Teletraffic Congress (1976) Melbourne, AustraliaGoogle Scholar
• Law A., Kelton W.Simulation Modeling and Analysis (1991) (McGraw-Hill, New York) Google Scholar
• Ma B. N., Mark J. W. Approximation of the mean queue length of an M/G/c queueing system. Oper. Res. (1995) 43:158–165Link, Google Scholar
• Maddah B., El-Taha M. Allocation of processing time in a multi-channel load balancing system. (2004) . Working paper, University of Southern Maine, Portland, MEGoogle Scholar
• Mandelbaum A., Reiman M. I. On pooling in queueing networks. Management Sci. (1998) 44:971–981Link, Google Scholar
• Marchal W. Some simple bounds on the mean queueing time. Oper. Res. (1978) 26:1083–1088Link, Google Scholar
• Medhi J.Stochastic Models in Queueing Theory (1991) (Academic Press, New York) Google Scholar
• Mesquite SoftwareCSIM 18 Users Guide (1998) (Mesquite Software Inc., Austin, TX) Google Scholar
• Nozaki S., Ross S. M. Approximations in finite capacity multiserver queues with Poisson arrivals. J. Appl. Probab. (1978) 13:826–834Crossref, Google Scholar
• Ross S. M.Introduction to Probability Models (1997) 6th ed.(Academic Press, San Diego, CA) Google Scholar
• Scheller-Wolf A., Sigman K. Delay moments for GI/G/s queues. Queueing Systems: Theory Appl. (1997a) 25:77–95Crossref, Google Scholar
• Scheller-Wolf A. S., Sigman K. New bounds for expected delay in FIFO GI/G/c queues. Queueing Systems (1997b) 26:169–186Crossref, Google Scholar
• Tijms H. C.Stochastic Models: An Algorithmic Approach (1994) (John Wiley and Sons, New York) Google Scholar
• Tijms H. C., Van Hoorn M. H., Federgruen A. Approximation of the steady-state probabilities in the M/G/c queue. Adv. Appl. Probab. (1981) 13:186–206Crossref, Google Scholar
• Uthaisombut P. New directions in machine scheduling. (2000) . Doctoral dissertation, Department of Computer Science and Engineering, Michigan State University, East Lansing, MIGoogle Scholar
• Whitt W. Approximating a point process by a renewal process: The view through a queue, an indirect approach. Management Sci. (1981) 27:619–636Link, Google Scholar
• Whitt W. Approximating a point process by a renewal process, I: Two basic methods. Oper. Res. (1982) 30:125–147Link, Google Scholar
• Whitt W. The queueing network analyzer. Bell System Tech. J. (1983) 62:2779–2815Crossref, Google Scholar
• Whitt W. Departures from a queue with many servers. Math. Oper. Res. (1984) 9:534–544Link, Google Scholar
• Whitt W. Planning queueing simulations. Management Sci. (1989) 35:1341–1366Link, Google Scholar
• Whitt W. Understanding the efficiency of multi-server queueing systems. Management Sci. (1992) 38:706–723Link, Google Scholar
• Whitt W. Partitioning customers into service groups. Management Sci. (1999) 45:1579–1592Link, Google Scholar
• Wolff R.Stochastic Modeling and the Theory of Queues (1989) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar