Zobrazeno 1 - 10
of 17
pro vyhledávání: '"van der J Jan Wal"'
Publikováno v:
Stochastic Models, 24(4), 604-625. Taylor and Francis Ltd.
This article considers a batch service polling system. We first study the case in which the server visits the queues cyclically, considering three different service regimes: gated, exhaustive, and globally gated. We subsequently analyze the case (the
Publikováno v:
Transfusion. 46:165A-233A
Autor:
E.L. Örmeci, van der J Jan Wal
Publikováno v:
Stochastic Models, 22(1), 37-53. Taylor and Francis Ltd.
This paper considers the problem of dynamic admission control in a loss queueing system with two classes of jobs. The jobs require an exponential amount of service time with different means and bring different revenues, whereas the arrivals occur acc
Autor:
Gajf Gido Brouns, van der J Jan Wal
Publikováno v:
Mathematical Methods of Operations Research, 58, 483-501. Physica-Verlag
Mathematical Methods of Operations Research, 58(3), 483-501. Physica-Verlag
Mathematical Methods of Operations Research, 58(3), 483-501. Physica-Verlag
We consider an M|E N |1 queue in which there are two essential on-line decisions that have to be taken. The first one is the decision to either accept or reject new jobs. The second one is the decision to either continue or abort the service of a job
Publikováno v:
Naval Research Logistics, 48(4), 281-292. Wiley
This paper deals with a repair shop with multiple parallel servers, which has to carry out planned overhauls. Each overhaul consists of a large number of maintenance jobs. The overhaul process is interrupted by randomly arriving emergency jobs. To co
Publikováno v:
Stochastic Models, 17(4), 513-539. Taylor and Francis Ltd.
Scopus-Elsevier
Stochastic Models, 17. Taylor and Francis Ltd.
Scopus-Elsevier
Stochastic Models, 17. Taylor and Francis Ltd.
We consider the problem of dynamic admission control in a Markovian loss queueing system with two classes of customers with different service rates and revenues. We show that under certain conditions, customers of one class, which we call a preferred
Autor:
van Jaee Jo Nunen, van der J Jan Wal
Publikováno v:
Statistica Neerlandica, 54(2), 116-126. Wiley-Blackwell
Statistica Neerlandica, 54, 116-126. Wiley-Blackwell
Statistica Neerlandica, 54, 116-126. Wiley-Blackwell
Autor:
van der J Jan Wal, Ijbf Ivo Adan
Publikováno v:
Operations-Research-Spektrum. 20:73-81
In inventory control and production planning one is tempted to use one of two strategies: produce all demand to stock or produce all demand to order. The disadvantages are well-known. In the ‘make everything to order’ case (MTO) the response time
Publikováno v:
European Journal of Operational Research 124 (2000) 3
European Journal of Operational Research, 124(3), 437-446. Elsevier
European journal of operational research, 124(3), 437. Elsevier
European Journal of Operational Research, 124(3), 437-446
European Journal of Operational Research, 124(3), 437-446. Elsevier
European journal of operational research, 124(3), 437. Elsevier
European Journal of Operational Research, 124(3), 437-446
In this paper we present a closed queueing network model for a robotic milking barn. We use an approximative mean-value algorithm to evaluate important performance criteria such as the number of cows waiting, their waiting time and the utilization of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e234281c74b9eb105b8c139e2947ac2b
https://research.wur.nl/en/publications/the-design-of-robotic-dairy-barns-using-closed-queuing-networks
https://research.wur.nl/en/publications/the-design-of-robotic-dairy-barns-using-closed-queuing-networks
Autor:
van der J Jan Wal, A Anton Dekkers
Publikováno v:
Operations Research Proceedings ISBN: 9783540524892
In this paper we will discuss the analysis of the response time distribution of database queries to a computer system. This computer system is described as an open queueing model, consisting of a CP and a Disk. The complexity of the model is too larg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bde4d60be95fbb7bda0451683aad062
https://doi.org/10.1007/978-3-642-75639-9_89
https://doi.org/10.1007/978-3-642-75639-9_89