scientific article
From MaRDI portal
Publication:4003445
zbMath0766.90028MaRDI QIDQ4003445
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items
Modeling and analysis of flexible queueing systems, Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems, A Bayesian inference to estimate change point for traffic intensity in \(M/M/1\) queueing model, Value of capacity pooling in supply chains with heterogeneous customers, Strategic behavior and social outcomes in a bottleneck queue: experimental evidence, Predicting the performance of queues -- a data analytic approach, The \(G_{t}/GI/s_{t}+GI\) many-server fluid queue, Applications of fluid models in service operations management, Large-time asymptotics for the \(G_{t}/M_{t}/s_{t}+GI_{t}\) many-server fluid queue with abandonment, Two classes of time-inhomogeneous Markov chains: Analysis of the periodic case, Batch queues with choice of arrivals: equilibrium analysis and experimental study, Fluid approximations and control of queues in emergency departments, An approach to single parameter process design, Online scheduling policies for multiclass call centers with impatient customers, Networks of infinite-server queues with nonstationary Poisson input, An exploration of models that minimize leadtime through batching of arrived orders, Nonlinear programming for multiperiod capacity planning in a manufacturing system, Locating and staffing service centers under service level constraints, Uniform acceleration expansions for Markov chains with time-varying rates, Using different response-time requirements to smooth time-varying demand for service, Dynamic staffing in a telephone call center aiming to immediately answer all calls
