TRANSCI
2010
13 years 7 months ago
2010
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
ORL
2007
13 years 12 months ago
2007
For the M/D/1 processor sharing queue, explicit formulas for the coefficient of variation of the sojourn time conditioned on the service time and on the residual service times of ...
QUESTA
2002
14 years 2 days ago
2002
This paper considers an infinite-server queue with multiple batch Markovian arrival streams. The service time distribution of customers may be different for different arrival strea...
QUESTA
2006
14 years 10 days ago
2006
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
CORR
2007
Springer
14 years 12 days ago
2007
Springer
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the b...
EOR
2008
14 years 15 days ago
2008
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
COMAD
2008
14 years 1 months ago
2008
In this paper we present algorithms for identifying interesting subsets of a given database of records. In many real life applications, it is important to automatically discover s...
DSN
2008
IEEE
14 years 7 months ago
2008
IEEE
Temporal locality in workloads creates conditions in which a server, in order to remain available, should quickly process bursts of requests with large service requirements. In th...
ASMTA
2009
Springer
14 years 7 months ago
2009
Springer
In this paper we consider a multi-server queue with a near general arrival process (represented as an arbitrary state-dependent Coxian distribution), a near general state-dependent...
NCA
2009
IEEE
14 years 7 months ago
2009
IEEE
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...