Level Crossings in Point Processes Applied to Queues: Single-Server Case

From MaRDI portal
Publication:4150983

DOI10.1287/opre.25.4.662zbMath0373.60114OpenAlexW2090521765MaRDI QIDQ4150983

Morton J. M. Posner, Percy H. Brill

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.25.4.662




Related Items (54)

\(\mathrm{MAP}/\mathrm{M}/c\) and \(\mathrm{M}/\mathrm{PH}/c\) queues with constant impatience timesQueueing systems with vacations - a surveyA state dependent reinsurance modelScheduling of multi-class multi-server queueing systems with abandonmentsA level-crossing approach to the solution of the shortest-queue problemOptimal and simple approximate solutions to a production-inventory system with stochastic and deterministic demandThe virtual waiting time of the M/G/1 queue with customers of \(n\) types of impatienceApproximations for the \(M/GI/N +GI\) type call centerCompound Cycle of a Renewal Process and ApplicationsHistory of Queueing Theory in Canada Prior to 1980Examples of Applications of Queueing Theory in CanadaCrossings states and sets of states in random walksWhen supplier's availability affects the replenishment lead time -- an extension of the supply-interruption problemMulti-class M/PH/1 queues with deterministic impatience timesOn level crossings for a general class of piecewise-deterministic Markov processesWorkload analysis of an \(M/G/1\) queue under the \(P^{M}_{\lambda}\) policy with a set-up timeAnalysis of risk models using a level crossing techniqueFlow time distributions in a \(K\) class \(M/G/1\) priority feedback queueThe effects of information on a queue with balking and phase‐type service timesOn priority queues with impatient customersA partial replenishment model for an inventory with constant demandNonparametric Estimation for a Class of Piecewise-Deterministic Markov ProcessesOn pathwise rate conservation for a class of semi-martingalesRelationships in stationary jump processes with countable state space and their applications to queuesDeterministic analysis of queueing systems with heterogeneous serversALTERNATIVE ANALYSIS OF FINITE-TIME PROBABILITY DISTRIBUTIONS OF RENEWAL THEORYSample path analysis of level crossings for the workload processManufacturing quality density, control and maintenanceThe idle period of the finite \(G/M/1\) queue with an interpretation in risk theoryAn \(M/G/1\)-type queuing model with service times depending on queue lengthThe stationary workload of the \(G/M/1\) queue with impatient customersA \(GI/Geo/1\) queue with negative and positive customersAnalysis of \(M^{ X}/ G/1\) queues with impatient customersAnalysis of the loss probability in the \(\mathrm{M}/\mathrm{G}/1+\mathrm{G}\) queueThe \(( S - 1 , S)\) inventory model and its counterparts in queueing theoryAn \(M/ PH /1\) queue with workload-dependent processing speed and vacationsConditional and unconditional distributions for M/G/1 type queues with server vacationsA batch arrival queue with different vacationsComparison results for M/G/1 queues with waiting and sojourn time deadlinesThe Workload in the M/G/1 Queue with Work RemovalPRICING PERISHABLE PRODUCTS WITH COMPOUND POISSON DEMANDSSample-path analysis of processes with imbedded point processesAnalysis of a production-inventory system with unreliable production facilityOn first-come, first-served queues with two classes of impatient customersWAITING TIME ANALYSIS OF MULTI-CLASS QUEUES WITH IMPATIENT CUSTOMERSStationary queuing systems with dependenciesA replacement model for an additive damage model with restorationThe throughput performance of a prioritized LIFO service disciplineA review of \(L=\lambda W\) and extensionsA \(P_{\lambda}^M\)-policy for an \(M/G/1\) queueing systemRate conservation laws: A surveyOn the \(M/G/1\) queue with Bernoulli feedbackAffine Storage and Insurance Risk ModelsMultiple replenishment orders in a continuous-review inventory system with lost sales




This page was built for publication: Level Crossings in Point Processes Applied to Queues: Single-Server Case