Priority Assignment in Waiting Line Problems
From MaRDI portal
Publication:5378614
DOI10.1287/opre.2.1.70zbMath1414.90098OpenAlexW2027385835WikidataQ55969781 ScholiaQ55969781MaRDI QIDQ5378614
Publication date: 3 June 2019
Published in: Journal of the Operations Research Society of America (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2.1.70
Related Items
Analysis of a finite capacity non preemptive priority queue, Queueing with priorities and standard service: Stoppable and unstoppable servers, Priority queuing in an operating system, Transient study of a queueing system with one unreliable server, batch arrivals, two types of verification, loss and vacation, An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas, A stochastic inventory model of COVID-19 and robust, real-time identification of carriers at large and infection rate via asymptotic laws, Time-dependent analysis of an \(\mathrm{M}/\mathrm{M}/c\) preemptive priority system with two priority classes, Delay performance in stochastic processing networks with priority service., Average waiting time of customers in an \(M/D/k\) queue with nonpreemptive priorities., Joint queue length distribution of multi-class, single-server queues with preemptive priorities, Error bounds on practical approximation for two tandem queue with blocking and non-preemptive priority, Price of Anarchy in Networks with Heterogeneous Latency Functions, On reducing time spent in M/G/1 systems, On the gap and time interval between the first two maxima of long random walks, Examination of worker assignment and dispatching rules for managing vital customer priorities in dual resource constrained job shop environments, Waiting times in queues with relative priorities, Heavy traffic response times for a priority queue with non-linear priorities., Waiting time in the \(\mathrm{M}/\mathrm{M}/m\) LCFS nonpreemptive priority queue with impatient customers, Mean sojourn times for phase-type discriminatory processor sharing systems, Discrete-time Geo\(^X\)/G/1 queue with preemptive resume priority, Cobham's model on nonpreemptive multiserver queueing systems. A heuristic method for its generalisation, Analysis of \(M/M/1\) queueing system with two priority classes, Optimization in task-completion networks, Simulating hospital emergency departments queuing systems: (GI/G/m(t)):(IHFF/N/\(\infty)\), Multi-server queueing systems with multiple priority classes