Elevator service time distribution for the product allocation problem in a multi-level distribution center

2010 ◽  
Author(s):  
Yanru Chen ◽  
Yangsheng Jiang
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Distribution Center ◽  
Allocation Problem ◽  
Service Time Distribution ◽  
Product Allocation ◽  
Multi Level

Hitting time in an M/G/1 queue

1999 ◽  
Vol 36 (03) ◽  
pp. 934-940 ◽  
Author(s):  
Sheldon M. Ross ◽  
Sridhar Seshadri
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Arrival Rate ◽  
Hitting Time ◽  
Service Time Distribution ◽  
Expected Time ◽  
Efficient Simulation ◽  
Simulation Procedure ◽  
Poisson Arrival ◽  
Stationary Delay

We study the expected time for the work in an M/G/1 system to exceed the level x, given that it started out initially empty, and show that it can be expressed solely in terms of the Poisson arrival rate, the service time distribution and the stationary delay distribution of the M/G/1 system. We use this result to construct an efficient simulation procedure.

The general bulk queue as a matrix factorisation problem of the Wiener-Hopf type. Part II.

1975 ◽  
Vol 7 (3) ◽  
pp. 647-655 ◽  
Author(s):  
John Dagsvik
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Time Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Time Process ◽  
Waiting Time Process ◽  
Bulk Queue ◽  
Erlang Distributions ◽  
Matrix Factorisation

In a previous paper (Dagsvik (1975)) the waiting time process of the single server bulk queue is considered and a corresponding waiting time equation is established. In this paper the waiting time equation is solved when the inter-arrival or service time distribution is a linear combination of Erlang distributions. The analysis is essentially based on algebraic arguments.

An extension of Erlang's formulas which distinguishes individual servers

1972 ◽  
Vol 9 (1) ◽  
pp. 192-197 ◽  
Author(s):  
Jan M. Chaiken ◽  
Edward Ignall
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
The State ◽  
Service Time Distribution ◽  
Loss System ◽  
Arbitrary Service Time

For a particular kind of finite-server loss system in which the number and identity of servers depends on the type of the arriving call and on the state of the system, the limits of the state probabilities (as t → ∞) are found for an arbitrary service-time distribution.

scholarly journals s,S Inventory with Positive Service Time and Retrial of Demands: An Approach through Multiserver Queues

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Anoop N. Nair ◽  
M. J. Jacob
Keyword(s):  
Steady State ◽  
Poisson Process ◽  
Service Time ◽  
Time Distribution ◽  
Joint Distribution ◽  
Service Time Distribution ◽  
Exponential Rate ◽  
Numerical Illustration ◽  
Multiserver Queues ◽  
Geometric Methods

We analyze an s,S inventory with positive service time and retrial of demands by considering the inventory as servers of a multiserver queuing system. Demands arrive according to a Poisson process and service time distribution is exponential. On each service completion, the number of demands in the system as well as the number of inventories (servers) is reduced by one. When all servers are busy, new arrivals join an orbit from which they try to access the service at an exponential rate. Using matrix geometric methods the steady state joint distribution of the demands and inventory has been analyzed and a numerical illustration is given.

Sign in / Sign up

Export Citation Format

Share Document