×
Shanthikumar, J. G.

On reducing time spent in M/G/1 systems. (English) Zbl 0475.60083

Eur. J. Oper. Res. 9, 286-294 (1982).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0475.60083

Cited in 3 Documents

MSC:

60K25 Queueing theory (aspects of probability theory)
90B22 Queues and service in operations research
90B35 Deterministic scheduling theory in operations research

Keywords:

shortest processing time; scheduling discipline
PDF BibTeX XML Cite
\textit{J. G. Shanthikumar}, Eur. J. Oper. Res. 9, 286--294 (1982; Zbl 0475.60083)
Full Text: DOI

References:

[1] Balachandran, K. R.; Schaefer, M. K., Public and private optimization at a service facility with approximate information on congestion, European J. Operational Res., 4, 195-202 (1980) · Zbl 0425.90036
[2] Cobham, A., Priority assignment in waiting line problems, Operations Res., 2, 70-76 (1954) · Zbl 1414.90098
[3] Conway, R. W.; Maxwell, W. L.; Miller, L. M., Theory of Scheduling (1967), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 1058.90500
[4] Kesten, H.; Runnenburg, J. T., Priority in waiting line problems, I and II, (Nederl. Akad. Wetensch. Proc. Ser. A, 60 (1957)), 312-336 · Zbl 0085.34801
[5] Lawler, E. L.; Sivazlian, B. D., Minimization of time-varying costs in single-machine scheduling, Operations Res., 4, 563-569 (1978) · Zbl 0385.90055
[6] Luenberger, D. G., Introduction to Linear and Nonlinear Programming (1973), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0241.90052
[7] Matthews, D. E., Probabilistic priorities in the M/G/1 queue, Naval Res. Logist. Quart., 24, 457-462 (1977) · Zbl 0374.60131
[8] Matthews, D. E., A simple method for reducing queueing times in M/G/1, Operations Res., 27, 318-323 (1979) · Zbl 0395.60086
[9] Menipaz, E., Optimization of stochastic maintenance policies, European J. Operational Res., 2, 97-106 (1978) · Zbl 0383.90049
[10] Phipps, T. E., Machine repair as a priority waiting-line problem, Operations Res., 4, 76-85 (1956) · Zbl 1414.90117
[11] Schrage, L. E., A proof of the optimality of the shortest remaining processing time discipline, Operations Res., 16, 687-690 (1968) · Zbl 0237.60039
[12] Schrage, L. E.; Miller, L. W., The queue M/G/1 with the shortest remaining processing time discipline, Operations Res., 14, 670-684 (1966) · Zbl 0147.16702
[13] Shanthikumar, J. G., Approximate queueing models of dynamic job shops, (Ph. D. Dissertation (1979), Dept. of Industrial Engineering, University of Toronto: Dept. of Industrial Engineering, University of Toronto Toronto) · Zbl 0551.90023
[14] Shanthikumar, J. G.; Buzacott, J. A., The conditional waiting time in an M/G/1 queue with shortest processing time discipline, (Working Paper No. 79-004 (1979), Dept. of Industrial Engineering, University of Toronto: Dept. of Industrial Engineering, University of Toronto Toronto) · Zbl 0539.60091
[15] Shanthikumar, J. G., Analysis of the control of queues with shortest processing time service discipline, J. Operations Res. Soc. Japan, 23, 341-352 (1980) · Zbl 0448.60065
[16] Takacs, Priority queues, Operations Res., 12, 63-74 (1964) · Zbl 0203.18401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.