Discrete time GI/Geom/1 queueing system with priority
From MaRDI portal
Publication:2482811
DOI10.1016/J.EJOR.2007.02.056zbMATH Open1146.90020OpenAlexW2089537518MaRDI QIDQ2482811FDOQ2482811
Benedetto Scoppola, Sokol Ndreca
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.02.056
Recommendations
- Discrete-time \(Geo^{X}/G/1\) queue with non-preemptive priority
- Discrete priority queueing systems
- Analysis of the discrete-time \(GI/\text{Geom}(n)/1/N\) queue
- Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
- scientific article; zbMATH DE number 3923832
Cites Work
- Title not available (Why is that?)
- Modeling and analysis of discrete-time multiserver queues with batch arrivals: \(GI^{X}/geom/m\)
- Discrete-time multiserver queues with geometric service times.
- The discrete-time GI/Geo/1 queue with multiple vacations
- Using the discrete time modelling approach to evaluate the time-dependent behaviour of queueing systems
- Analytical distribution of waiting time in the M/\{iD\}/1 queue
- On discrete-time multiserver queues with finite buffer: \(GI/Geom/m/N\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Performance analysis of discrete-time finite-buffer batch-arrival \(GI^X/Geom/1/N\) queues
Cited In (20)
- Title not available (Why is that?)
- A discrete-time queueing system with server breakdowns and changes in the repair times
- Discrete priority queueing systems
- Analysis of G-queue with pseudo-fault and multiple working vacations
- Performance analysis and optimization of a pseudo-fault \(\mathrm{Geo}/\mathrm{Geo}/1\) repairable queueing system with \(N\)-policy, setup time and multiple working vacations
- Delay analysis of a discrete-time multiclass slot-bound priority system
- Delay analysis of a discrete-timeGI−GI− 1 queue with reservation-based priority scheduling
- Discrete queueing system with relative priority
- Synchronized abandonment in discrete-time renewal input queues with vacations
- A multi-class discrete-time queueing system under the FCFS service discipline
- A two-stage approach in solving the state probabilities of the multi-queueM/G/1 model
- Discrete-time \(Geo^{X}/G/1\) queue with non-preemptive priority
- Queue content analysis in a 2-class discrete-time queueing system under the slot-bound priority service rule
- Discrete time \(Geo/G/1\) queue with Bernoulli gated service simulation system
- A discrete-time queue with preferred customers and partial buffer sharing
- Lagrangian relaxation and constraint generation for allocation and advanced scheduling
- Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times
- Two competing discrete-time queues with priority
- Analysis of a discrete-time repairable queue with disasters and working breakdowns
- Delay characteristics in place-reservation queues with class-dependent service times
This page was built for publication: Discrete time \(GI/Geom/1\) queueing system with priority
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482811)
