-
作者：DALLERY, Y; FREIN, Y
作者单位：Sorbonne Universite; Communaute Universite Grenoble Alpes; Institut National Polytechnique de Grenoble; Communaute Universite Grenoble Alpes; Universite Grenoble Alpes (UGA)
摘要：Queueing networks with blocking are useful for modeling and analyzing discrete event systems, especially manufacturing systems. Most analysis methods for queueing networks with blocking are approximation methods that involve a decomposition of the network into a set of subsystems. This paper presents some insight into these decomposition methods as well as new results. Attention is mainly restricted to the case of tandem queueing networks with exponential service times and blocking-after-servi...
-
作者：GLYNN, PW; MELAMED, B; WHITT, W
作者单位：Nokia Corporation; Nokia Bell Labs; AT&T
摘要：In this paper we establish a joint central limit theorem for customer and time averages by applying a martingale central limit theorem in a Markov framework. The limiting values of the two averages appear in the translation terms. This central limit theorem helps to construct confidence intervals for estimators and perform statistical tests. It thus helps determine which finite average is a more asymptotically efficient estimator of its limit. As a basis for testing for PASTA (Poisson arrivals...
-
作者：BLUMENTHAL, S
摘要：When n independent identical renewal processes are superimposed, the number of events in (0, s) is approximately Poisson distributed for large n. For small to moderate n, this approximation is inaccurate. If no component process has more than one event in (0, s), the probability of exactly r events for the superimposed process is given by a binomial-like expression where the p and q do not sum to one. Several approximations have been derived from this observation and compared to the exact prob...
-
作者：PIENKOSZ, K; TOCZYLOWSKI, E
作者单位：Warsaw University of Technology
摘要：The paper considers the aggregation of similar products in the lot size scheduling problems for single-stage systems with limited upper bounds on inventory levels. The necessary and sufficient conditions of consistent aggregation, which guarantee that the optimal aggregate solution can be disaggregated into an optimal solution of the original problem, are presented.
