Sciweavers

TRANSCI
2010
169views more  TRANSCI 2010»
13 years 6 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
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...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
ORL
2007
80views more  ORL 2007»
13 years 11 months ago
Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS
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 ...
Michael Shalmon
QUESTA
2002
116views more  QUESTA 2002»
13 years 11 months ago
Analysis of an Infinite-Server Queue with Batch Markovian Arrival Streams
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...
Hiroyuki Masuyama, Tetsuya Takine
QUESTA
2006
119views more  QUESTA 2006»
14 years 2 days ago
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
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...
Ivo J. B. F. Adan, Vidyadhar G. Kulkarni
CORR
2007
Springer
99views Education» more  CORR 2007»
14 years 4 days ago
Services within a busy period of an M/M/1 queue and Dyck paths
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...
Moez Draief, Jean Mairesse
EOR
2008
106views more  EOR 2008»
14 years 7 days ago
Analysis of a discrete-time preemptive resume priority buffer
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...
Joris Walraevens, Bart Steyaert, Herwig Bruneel
COMAD
2008
14 years 1 months ago
Discovering Interesting Subsets Using Statistical Analysis
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...
Maitreya Natu, Girish Palshikar
DSN
2008
IEEE
14 years 6 months ago
Scheduling for performance and availability in systems with temporal dependent workloads
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...
Ningfang Mi, Giuliano Casale, Evgenia Smirni
ASMTA
2009
Springer
104views Mathematics» more  ASMTA 2009»
14 years 6 months ago
Preliminary Results on a Simple Approach to G/G/c-Like Queues
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...
Alexandre Brandwajn, Thomas Begin
NCA
2009
IEEE
14 years 7 months ago
Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead
—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...
Steve Thompson, Lester Lipsky, Sarah Tasneem, Feng...