Results 11 to 20 of about 376,238 (287)

A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy [PDF]

open access: yes, 2008
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production ...
Maraghi, Farzana Abdulla
core   +7 more sources

On the Optimal Input Rate in Queues with Batch Service

open access: yesAxioms, 2023
In recent years, queuing systems with batch service are emerging as powerful and flexible mathematical models in different frameworks. In this paper, we consider a single server queuing system with Poissonian arrivals, infinite buffers, and a constant ...
Michele Pagano   +2 more
doaj   +1 more source

Analysis of a k-Stage Bulk Service Queuing System with Accessible Batches for Service

open access: yesMathematics, 2021
In most of the service systems considered so far in queuing theory, no fresh customer is admitted to a batch undergoing service when the number in the batch is less than a threshold.
Achyutha Krishnamoorthy   +2 more
doaj   +1 more source

An approximate method for analyzing a queuing system with batch arrivals and batch services [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика
A queueing system with a single server and an infinite-capacity buffer is considered. At any given time, one or two customers with specified probabilities can be received at once.
Sergeeva, Nadezhda Viktorovna   +2 more
doaj   +1 more source

Ship Lock as General Queuing System with Batch Arrivals and Batch Service

open access: yesPromet (Zagreb), 2007
The real lock operations with ships and barge convoys areconsidered dependent on the transport technologies applied, ormore precisely, the kinds of ships/convoys requiring thelockage.
Zoran Radmilović   +2 more
doaj   +1 more source

Analysis of Single-Server Multi-Class Queue with Unreliable Service, Batch Correlated Arrivals, Customers Impatience, and Dynamical Change of Priorities

open access: yesMathematics, 2021
A single-server non-pre-emptive priority queueing system of a finite capacity with many types of customers is analyzed. Inter-arrival times can be correlated and batch arrivals are allowed.
Alexander Dudin   +3 more
doaj   +1 more source

Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service [PDF]

open access: yes, 2010
Whereas the buffer content of batch-service queueing systems has been studied extensively, the customer delay has only occasionally been studied. The few papers concerning the customer delay share the common feature that only the moments are calculated ...
Claeys, Dieter   +3 more
core   +1 more source

An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes [PDF]

open access: yesJournal of Optimization in Industrial Engineering, 2018
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch ...
Javad Rezaeian, Yaser Zarook
doaj   +1 more source

Optimal design of batch plants under economic and ecological considerations: Application to a biochemical batch plant [PDF]

open access: yes, 2007
This work deals with the multicriteria cost-environment design of multiproduct batch plants, where the design variables are the equipment item sizes as well as the operating conditions.
Dietz, Adrian   +3 more
core   +1 more source

Analysis of fibre-loop optical buffers with a void-avoiding schedule [PDF]

open access: yesEAI Endorsed Transactions on Internet of Things, 2015
In optical packet/burst switching, fibre-loop optical buffers provide a compact and effective means of contention resolution. In case of fixed packet length, the involved loop length is typically chosen matched (equal to the packet length), and the loops
Wouter Rogiest   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy