In this paper we consider the polling system with multiple vacations an bulk arrival using M-gated services in continuous time. By the imbedded Markov chain theory, the generating functions of queue length at the station is obtained. Then computational equations are explicitly determined for the mean queue length. Especially we can obtain some corresponding results under some especial cases. The results reveal that our system model can guarantee better QoS and system stability, and it has better efficiency than that of traditional gated service.
The article presents simplified queuing system model of freight marine port. The article discusses the basic elements of queuing system, its mathematical solution and structure. Simulation model was created using AnyLogic to analyze an effect of system capacity on queue length. The results were analyzed and the solution for queue optimization was proposed. Key words: queuing system, simulation modeling, AnyLogic, marine port, servers, queue.
Disaster arrival in a queuing system with negative arrivals causes all customers to leave the system instantaneously. Here we obtain a queue-length and virtual waiting (sojourn) time distribution for the more complicated system BMAP/SM/1 with MAP input of disasters.
We consider a bulk arrival, bulk service queueing system. Customers are served in batches ofrunits if the queue length is not less thanr. Otherwise, the server delays the service until the number of units in the queue reaches or exceeds levelr. We assume that unserved customers may get impatient and leave the system. An ergodicity condition and steady-state probabilities are derived. Various system characteristics are also computed.
The author studies the queueing process in a single-server, bulk
arrival and batch service queueing system with a compound Poisson
input, bilevel service delay discipline, start-up time, and a fixed
accumulation level with control operating policy. It is assumed that when
the queue length falls below a predefined level r(≥1), the system, with
server capacity R, immediately stops service until the queue length
reaches or exceeds the second predefined accumulation level N(≥r).
Two cases, with N≤R and N≥R, are studied.The author finds explicitly the probability generating function of
the stationary distribution of the queueing process and gives numerical
examples.
A simple queuing system in the case that a server joins in the system when the queue length attains to a certain length.