article

Order statistics applications to queueing and scheduling problems

Authors:

Hilary ChengAuthors Info & Claims

Queueing Systems: Theory and Applications, Volume 27, Issue 3/4

Pages 325 - 350

https://doi.org/10.1023/A:1019126501541

Published: 30 December 1997 Publication History

Abstract

We prove several basic combinatorial identities and use them in two applications: the queue inference engine (QIE) and earliest due date rule (EDD) scheduling. Larson (1990) introduced the QIE. His objective was to deduce the behavior of a multiserver queueing system without observing the queue. With only a Poisson arrival assumption, he analyzed the performance during a busy period. Such a period starts once all servers are busy with the queue empty, and it ends as soon as a server becomes idle. We generalize the standard order statistics result for Poisson processes, and show how to sample a busy period in the M/M/c system. We derive simple expressions for the variance of the total waiting time in the M/M/c and M/D/1 queues given that n Poisson arrivals and departures occur during a busy period. We also perform a probabilistic analysis of the EDD for a one-machine scheduling problem with earliness and tardiness penalties. The schedule is without preemption and with no inserted idle time. The jobs are independent and each may have a different due date. For large n, we show that the variance of the total penalty costs of the EDD is linear in n . The mean of the total penalty costs of the EDD is known to be proportional to the square root of n (see Harel (1993)).

References

[1]

{1} K. R. Baker and G. D. Scudder, Sequencing with earliness and tardiness penalties: A review, Oper. Res. 38 (1990) 22-36.

Digital Library

[2]

{2} D. J. Bertsimas and L. D. Servi, Deducing queueing from transactional data: the queue inference engine, revisited, Oper. Res. 40(2) (1992) 217-228.

Digital Library

[3]

{3} D. J. Daley and L. D. Servi, Exploiting Markov chains to infer queue length from transactional data, J. Appl. Probab. 29 (1992) 713-732.

[4]

{4} D. J. Daley and L. D. Servi, Estimating waiting times from transactional data, OR Journal on Computing 9 (1997) 224-229.

[5]

{5} D. J. Daley and L. D. Servi, Approximating last-exit probabilities of a random walk, with applications to conditional queue length moments within busy periods of M/GI /1 queues, J. Appl. Probab. 31A (1994) 251-267.

[6]

{6} J. Du and J. Y.-T. Leung, Minimizing total tardiness on one machine is NP-hard, Math. Oper. Res. 15 (1990) 483-495.

Digital Library

[7]

{7} T. D. Fry, R. D. Armstrong and J. H. Blackstone, Minimizing weighted absolute deviation in single machine scheduling, IIE Trans. 19 (1987) 445-450.

[8]

{8} M. R. Garey, R. E. Tarjan and G. T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties, Math. Oper. Res. 13 (1988) 330-348.

Digital Library

[9]

{9} H. W. Gould, Combinatorial identities: A standardized set of tables listing 500 binomial coefficient summations, published by the author (1972).

[10]

{10} N. G. Hall, W. Kubiak and S. P. Sethi, Earliness-tardiness scheduling problem, II: Deviation of completion times about a restrictive common due date, Oper. Res. 39 (1991) 847-856.

Digital Library

[11]

{11} N. G. Hall and M. E. Posner, Earliness-tardiness scheduling problems, I: Weighted deviation of completion times about a common due date, Oper. Res. 39 (1991) 836-846.

Digital Library

[12]

{12} A. Harel, On honest Bernoulli excursions, J. Appl. Probab. 27 (1990) 475-476.

[13]

{13} A. Harel, Random walk and the area underneath its path, Math. Oper. Res. 18(3) (1993) 566-577.

Digital Library

[14]

{14} L. K. Jones and R. C. Larson, Efficient computation of probabilities of events described by order statistics and applications to queue inference, ORSA J. Comput. 7(1) (1995) 89-100.

[15]

{15} S. Karlin and H. M. Taylor, A Second Course in Stochastic Processes (Academic Press, 1981).

[16]

{16} R. C. Larson, The queue inference engine: deducing queue statistics from transactional data, Management Sci. 36 (1990) 586-601.

Digital Library

[17]

{17} R. C. Larson, The queue inference engine: Addendum, Management Sci. 37(8) (1991) 1062.

Digital Library

[18]

{18} P. S. Ow and T. E. Morton, The single machine early-tardy problem, Management Sci. 35 (1989) 177-191.

Digital Library

Cited By

Fiorini P(2021)Analyzing the Busy Period of the M/M/1 Queue via Order Statistics and Record Values2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS53288.2021.9660840(217-224)Online publication date: 22-Sep-2021
https://dl.acm.org/doi/10.1109/IDAACS53288.2021.9660840

Order statistics applications to queueing and scheduling problems
1. Mathematics of computing
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Random Walk and the Area Below its Path

A simple random walk with reflected origin is considered. The walk starts at the origin and it must return to the origin at time 2 n . We show that the expected area below the path of this walk is n 2² ⁿ ^-1/ C _n ² ⁿ . If, however, the walk is ...
Analysis of a queueing system with impatient customers and working vacations
QTNA '11: Proceedings of the 6th International Conference on Queueing Theory and Network Applications

In this paper, we consider an M/M/1 queueing system with working vacations and impatient customers, where we examine the case that customers' impatience is due to a working vacation. During the working vacation, customers are served at a slower than ...
The QNET Method for Re-Entrant Queueing Networks with Priority Disciplines

This paper is concerned with the estimation of performance measures of two priority disciplines in a d-station re-entrant queueing network. Such networks arise from complex manufacturing systems such as wafer fabrication facilities. The priority ...

Comments

Information & Contributors

Information

Published In

cover image Queueing Systems: Theory and Applications

Queueing Systems: Theory and Applications Volume 27, Issue 3/4

1997

160 pages

ISSN:0257-0130

Issue’s Table of Contents

Copyright © Copyright © 1997 Kluwer Academic Publishers.

Publisher

J. C. Baltzer AG, Science Publishers

United States

Publication History

Published: 30 December 1997

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fiorini P(2021)Analyzing the Busy Period of the M/M/1 Queue via Order Statistics and Record Values2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS53288.2021.9660840(217-224)Online publication date: 22-Sep-2021
https://dl.acm.org/doi/10.1109/IDAACS53288.2021.9660840

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents