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)).
Similar content being viewed by others
References
K.R. Baker and G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Oper. Res. 38 (1990) 22–36.
D.J. Bertsimas and L.D. Servi, Deducing queueing from transactional data: the queue inference engine, revisited, Oper. Res. 40(2) (1992) 217–228.
D.J. Daley and L.D. Servi, Exploiting Markov chains to infer queue length from transactional data, J. Appl. Probab. 29 (1992) 713–732.
D.J. Daley and L.D. Servi, Estimating waiting times from transactional data, OR Journal on Computing 9 (1997) 224–229.
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.
J. Du and J.Y.-T. Leung, Minimizing total tardiness on one machine is NP-hard, Math. Oper. Res. 15 (1990) 483–495.
T.D. Fry, R.D. Armstrong and J.H. Blackstone, Minimizing weighted absolute deviation in single machine scheduling, IIE Trans. 19 (1987) 445–450.
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.
H.W. Gould, Combinatorial identities: A standardized set of tables listing 500 binomial coefficient summations, published by the author (1972).
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.
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.
A. Harel, On honest Bernoulli excursions, J. Appl. Probab. 27 (1990) 475–476.
A. Harel, Random walk and the area underneath its path, Math. Oper. Res. 18(3) (1993) 566–577.
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.
S. Karlin and H.M. Taylor, A Second Course in Stochastic Processes (Academic Press, 1981).
R.C. Larson, The queue inference engine: deducing queue statistics from transactional data, Management Sci. 36 (1990) 586–601.
R.C. Larson, The queue inference engine: Addendum, Management Sci. 37(8) (1991) 1062.
P.S. Ow and T.E. Morton, The single machine early-tardy problem, Management Sci. 35 (1989) 177–191.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Harel, A., Cheng, H. Order statistics applications to queueing and scheduling problems. Queueing Systems 27, 325–350 (1997). https://doi.org/10.1023/A:1019126501541
Issue Date:
DOI: https://doi.org/10.1023/A:1019126501541