Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
This paper considers an M/G/1 queue in which service time distributions in each busy period change according to a finite state Markov chain, embedded at the arrival instants of cu...
We consider a single multi-server memoryless service station. Servers have heterogeneous service rates. Arrivals are routed to one of the servers, and the routing decisions are no...
In this paper we consider the robust portfolio selection problem involving two types of uncertainties; the uncertainty in the distribution of exit time and the uncertainty in the ...
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we d...