Mohammad Delasay

Learn More
Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are(More)
Servers in many real queueing systems do not work at a constant speed. They adapt to the system state by speeding up when the system is highly loaded or slowing down when load has been high for an extended time period. Their speed can also be constrained by other factors, such as geography or a downstream blockage. We develop a state-dependent queueing(More)
We propose a model of two comparable service providers competing for market share. The service providers employ different delay announcement strategies. The announcer (A) voluntarily provides real-time delay information, for example on a website. For the non-announcer (N), customers are only aware of the periodically updated long-term average delay(More)
  • 1