#### Filter Results:

#### Publication Year

2004

2007

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We consider the following queuing system which arises as a model of a wireless link shared by multiple users+ There is a finite number N of input flows served by a server+ The system operates in discrete time t ϭ 0,1,2, + + + + Each input flow can be described as an irreducible countable Markov chain; waiting customers of each flow are placed in a queue+… (More)

This paper presents a paired-vehicle recourse strategy for the vehicle routing problem with sto-chastic demands (VRPSD). In the VRPSD, a fleet of homogeneous capacitated vehicles is dispatched from a terminal to serve single-period customer demands which are known in distribution when planning but only revealed with certainty upon vehicle arrival. While… (More)

We investigate fast simulation techniques for estimating the unreliability in large Markovian models of highly reliable systems for which analytical0numerical techniques are difficult to apply+ We first show mathematically that for " small " time horizons, the relative simulation error, when using the importance sampling techniques of failure biasing and… (More)

- Ta A Ar, R Ra, Ja A Av, V Vi, I Id, D Di +5 others

We study the scheduling of jobs in a system of two interconnected service stations, called Q 1 and Q 2 , on m~m Ն 2! identical machines available in parallel, so that every machine can process any jobs in Q 1 or Q 2 + Preemption is allowed+ Under certain conditions on the arrival, service, and interconnection processes, we determine a scheduling policy that… (More)

We study a single-product periodic-review inventory model in which the ordering quantity is either zero or at least a minimum order size+ The ordering cost is a linear function of the ordering quantity, and the demand in different time periods are independent random variables+ The objective is to characterize the inventory policies that minimize the total… (More)

- ‹
- 1
- ›