A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning

DOI10.2478/amcs-2014-0065zbMath1309.90021OpenAlexW2049070931MaRDI QIDQ2018415

Robert K. Nowicki, Marcin Gabryel, Marcin Woźniak, Wojciech M. Kempa

Publication date: 14 April 2015

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/amcs-2014-0065

zbMATH Keywords

busy periodfinite-buffer queuequeueing systemsingle vacationidle timeevolutionary strategyobject positioning

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Queues and service in operations research (90B22) Stochastic systems in control theory (general) (93E03)

Related Items (4)

Performance evaluation of an \(M/G/n\)-type queue with bounded capacity and packet dropping ⋮ Transient Solution for Queueing Delay Distribution in the GI/M/1/K-type Mode with “Queued” Waking up and Balking ⋮ An Application of Differential Evolution to Positioning Queueing Systems ⋮ From exhaustive vacation queues to preemptive priority queues with general interarrival times

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytical and stochastic modeling techniques and applications. 19th international conference, ASMTA 2012, Grenoble, France, June 4--6, 2012. Proceedings
• Busy period analysis for the GI/M/1 queue with phase-type vacations
• \(GI/G/1/\infty\) batch arrival queueing system with a single exponential vacation
• Control of the service process in a queueing system
• Optimal control of a removable server in an M/G/1 queue with finite capacity
• Queueing systems with vacations - a survey
• A finite-capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes
• Application of the superposition of renewal processes to the study of batch arrival queues
• Optimal operating policy for an M/G/1 exhaustive server-vacation model
• A batch arrival queue with a vacation time under single vacation policy
• Artificial intelligence and soft computing. 12th international conference, ICAISC 2013, Zakopane, Poland, June 9--13, 2013. Proceedings, Part II
• Artificial intelligence and soft computing. 11th international conference, ICAISC 2012, Zakopane, Poland, April 29--May 3, 2012. Proceedings, Part II
• On departure process in the batch arrival queue with single vacation and setup time
• Artificial intelligence and soft computing. 13th international conference, ICAISC 2014, Zakopane, Poland, June 1--5, 2014. Proceedings, Part I
• Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation
• Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline
• Output Process in Batch-Arrival Queue with N-Policy and Multiple Vacations
• The Virtual Waiting Time in a Finite-Buffer Queue with a Single Vacation Policy
• Markov chain model of phytoplankton dynamics
• Analysis of Departure Process in Batch Arrival Queue with Multiple Vacations and Exhaustive Service
• Analysis of AQM queues with queue size based packet dropping
• The Virtual Waiting Time for the Batch Arrival Queueing Systems
• Some Results for the Actual Waiting Time in Batch Arrival Queueing Systems
• Some New Results for Departure Process in theM^X/G/1 Queueing System with a Single Vacation and Exhaustive Service
• Minimization of the total completion time for asynchronous transmission in a packet data-transmission system
• M/G/1//N Queues with Server Vacations and Exhaustive Service
• M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline
• The island model as a Markov dynamic system
• Optimal Control of the Vacation Scheme in an M/G/1 Queue
• Introduction to evolutionary computing

This page was built for publication: A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning