Add to ORKGWe analyse a storage process with dynamical arrivals and departures. Under probabilistic assumptions, we study the behavior of the storage unit and give the main features of it: the maximal throughput and the occupied length of the unit.dynamic storage allocation mximal throughput measure valued Markov processes
We consider a storage model which can be on or off. When on, the content increases at some state-dep...
AbstractWe consider a storage process with finite or infinite capacity having a compound Poisson pro...
We consider a storage model that can be on or off. When on, the content increases at some state-depe...
AbstractThe design and analysis of algorithms for on-line dynamic storage allocation has been a fund...
This paper presents a semi-Markov model as an important part of the computer-aided manufacturing and...
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
AbstractThis paper is concerned with a new version of on-line storage allocation in which the durati...
A mathematical model for the operation of an intermediate storage under stochastic operational condi...
We analyze a dynamic queue-storage problem where the arrival and departure processes are those of th...
AbstractIn this paper we study a storage process or a liquid queue in which the input process is the...
In this paper we introduce a storage process with singular continuous input. The input process is de...
. This paper is concerned with on-line storage allocation to processes in a dynamic environment. Thi...
We study a model of dynamic storage allocation in which requests for single units of memory arrive i...
A stationary storage process with Brownian input and constant service rate is studied. Explicit form...
In this paper we generalize known workload decomposition results for Lévy queues with secondary jump...
We consider a storage model which can be on or off. When on, the content increases at some state-dep...
AbstractWe consider a storage process with finite or infinite capacity having a compound Poisson pro...
We consider a storage model that can be on or off. When on, the content increases at some state-depe...
AbstractThe design and analysis of algorithms for on-line dynamic storage allocation has been a fund...
This paper presents a semi-Markov model as an important part of the computer-aided manufacturing and...
In this thesis, a storage model with infinite capacity, additive stochastic input and unit release p...
AbstractThis paper is concerned with a new version of on-line storage allocation in which the durati...
A mathematical model for the operation of an intermediate storage under stochastic operational condi...
We analyze a dynamic queue-storage problem where the arrival and departure processes are those of th...
AbstractIn this paper we study a storage process or a liquid queue in which the input process is the...
In this paper we introduce a storage process with singular continuous input. The input process is de...
. This paper is concerned with on-line storage allocation to processes in a dynamic environment. Thi...
We study a model of dynamic storage allocation in which requests for single units of memory arrive i...
A stationary storage process with Brownian input and constant service rate is studied. Explicit form...
In this paper we generalize known workload decomposition results for Lévy queues with secondary jump...
We consider a storage model which can be on or off. When on, the content increases at some state-dep...
AbstractWe consider a storage process with finite or infinite capacity having a compound Poisson pro...
We consider a storage model that can be on or off. When on, the content increases at some state-depe...