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)
In this paper, we develop a general framework to analyze the influence of system load on service times in queueing systems. Our proposed framework unifies previous results and ties them to possible future studies to help empirical and analytical researchers to investigate and model the ways in which load impacts service times. We identify three load(More)
  • 1