Mathematical Models of Multiserver Queuing System for Dynamic Performance Evaluation in Port

We discuss dynamic system performance evaluation in the river port utilizing queuing models with batch arrivals. The general models of the system are developed. This system is modelled by M-X/M/n/m queue with finite waiting areas and identical and independent cargo-handling capacities. The models are considered with whole and part batch acceptance (or whole and part batch rejections) and the interarrival and service times are exponentially distributed. Results related to the batch blocking probability and the blocking probability of an arbitrary vessel in nonstationary and stationary states have been obtained. Numerical results and computational experiments are reported to evaluate the efficiency of the models for the real system

Mathematical Models of Multiserver Queuing System for Dynamic Performance Evaluation in Port

We discuss dynamic system performance evaluation in the river port utilizing queuing models with batch arrivals. The general models of the system are developed. This system is modelled by M-X/M/n/m queue with finite waiting areas and identical and independent cargo-handling capacities. The models are considered with whole and part batch acceptance (or whole and part batch rejections) and the interarrival and service times are exponentially distributed. Results related to the batch blocking probability and the blocking probability of an arbitrary vessel in nonstationary and stationary states have been obtained. Numerical results and computational experiments are reported to evaluate the efficiency of the models for the real system

Delay analysis of a two-class batch-service queue with class-dependent variable server capacity

In this paper, we analyse the delay of a random customer in a two-class batch-service queueing model with variable server capacity, where all customers are accommodated in a common single-server first-come-first-served queue. The server can only process customers that belong to the same class, so that the size of a batch is determined by the length of a sequence of same-class customers. This type of batch server can be found in telecommunications systems and production environments. We first determine the steady state partial probability generating function of the queue occupancy at customer arrival epochs. Using a spectral decomposition technique, we obtain the steady state probability generating function of the delay of a random customer. We also show that the distribution of the delay of a random customer corresponds to a phase-type distribution. Finally, some numerical examples are given that provide further insight in the impact of asymmetry and variance in the arrival process on the number of customers in the system and the delay of a random customer

Mathematical Models of Multiserver Queuing System for Dynamic Performance Evaluation in Port

We discuss dynamic system performance evaluation in the river port utilizing queuing models with batch arrivals. The general models of the system are developed. This system is modelled by MX/M/n/m queue with finite waiting areas and identical and independent cargo-handling capacities. The models are considered with whole and part batch acceptance (or whole and part batch rejections) and the interarrival and service times are exponentially distributed. Results related to the batch blocking probability and the blocking probability of an arbitrary vessel in nonstationary and stationary states have been obtained. Numerical results and computational experiments are reported to evaluate the efficiency of the models for the real system

Computational Procedures for a Class of GI/D/ k

A class of discrete time GI/D/k systems is considered for which the interarrival times have finite support and customers are served in first-in first-out (FIFO) order. The system is formulated as a single server queue with new general independent interarrival times and constant service duration by assuming cyclic assignment of customers to the identical servers. Then the queue length is set up as a quasi-birth-death (QBD) type Markov chain. It is shown that this transformed GI/D/1 system has special structures which make the computation of the matrix R simple and efficient, thereby reducing the number of multiplications in each iteration significantly. As a result we were able to keep the computation time very low. Moreover, use of the resulting structural properties makes the computation of the distribution of queue length of the transformed system efficient. The computation of the distribution of waiting time is also shown to be simple by exploiting the special structures

EUROPEAN CONFERENCE ON QUEUEING THEORY 2016

International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the Takács Award for outstanding PhD thesis on "Queueing Theory and its Applications"