scholarly journals $MAP1, MAP2/G/1 FINITE QUEUES WITH SERVICE SCHEDULING FUNCTION DEPENDENT UPON QUEUE LENGTHS

2009 ◽  
Vol 46 (4) ◽  
pp. 673-689
Author(s):  
Doo-Il Choi ◽  
Sang-Min Lee
2012 ◽  
Vol 44 (12) ◽  
pp. 43-54 ◽  
Author(s):  
Agasi Zarbali ogly Melikov ◽  
Leonid A. Ponomarenko ◽  
Che Soong Kim

2019 ◽  
Vol 7 (1) ◽  
pp. 30-38
Author(s):  
P. Sen ◽  
D.Sarddar . ◽  
S.K. Sinha ◽  
R. Pandit

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Ekaterina Evdokimova ◽  
Sabine Wittevrongel ◽  
Dieter Fiems

This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i) overloaded and (ii) under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.


Forecasting ◽  
2021 ◽  
Vol 3 (2) ◽  
pp. 322-338
Author(s):  
Marvin Carl May ◽  
Alexander Albers ◽  
Marc David Fischer ◽  
Florian Mayerhofer ◽  
Louis Schäfer ◽  
...  

Currently, manufacturing is characterized by increasing complexity both on the technical and organizational levels. Thus, more complex and intelligent production control methods are developed in order to remain competitive and achieve operational excellence. Operations management described early on the influence among target metrics, such as queuing times, queue length, and production speed. However, accurate predictions of queue lengths have long been overlooked as a means to better understanding manufacturing systems. In order to provide queue length forecasts, this paper introduced a methodology to identify queue lengths in retrospect based on transitional data, as well as a comparison of easy-to-deploy machine learning-based queue forecasting models. Forecasting, based on static data sets, as well as time series models can be shown to be successfully applied in an exemplary semiconductor case study. The main findings concluded that accurate queue length prediction, even with minimal available data, is feasible by applying a variety of techniques, which can enable further research and predictions.


Sign in / Sign up

Export Citation Format

Share Document