A simple approach for analyzing feedback vacation queues with levy input process

Article Abstract:

A simple method for modeling and analyzing a queue, where the server may take repeated vacations, is proposed. The server takes a vacation of random duration at the end of a busy period. Upon the end of every vacation, the server may either take another vacation or resume service. The server always takes a new vacation if the queue is empty after each vacation. A number of performance measures of the system are obtained, including the mean and second moment of the cycle time, the mean queue length at the beginning of a cycle of service and the expected delay observed by a customer.

---

Analysis of nonpreemptive priority queues with multiple servers and two priority classes

Article Abstract:

A power-series formulation was developed for a priority multiserver queueing system with two priority classes. The proposed formulation employs three types of logarithmic reduction algorithms, namely A, C' and LR, that were derived from the matrix-geometric paradigm of Neuts. It was observed that the logarithmic reduction algorithms demonstrate better computational speed compared to matrix-based algorithms. However, their speed spurred some loss of accuracy.

Methods, Usage, Algorithms

---

Analysis of M/G/1 queues with delayed vacations and exhaustive service discipline

Article Abstract:

M/G/1 queues characterized by Poisson arrivals, delayed vacations and an exhaustive service and first-come first-served policy were considered. Specifically, the Laplace transformation of the joint distribution of the queue length and remaining vacation time was obtained using the method of supplementary variables. Using the results, the virtual waiting time distribution, which leads to the stochastic decomposition property, was also derived.

Operations research, Management science, Case studies, Decomposition method

Similar abstracts:

• Abstracts: An exact algorithm for the capacitated facility location problems with single sourcing. A method for the cutting stock problem with different qualities
• Abstracts: Delay analysis for discrete-time queueing systems with multiple randomly interrupted servers. System delay versus system content for discrete-time queueing systems subject to server interruptions
• Abstracts: A simple heuristic for buffer design in finite-capacity queues. Reliability modelling using G-queues
• Abstracts: The French market for skin care. Baby care in France. The French market for make-up
• Abstracts: A framework for an interactive project scheduling system under limited resources. Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.