We present two new linear algorithms for the single source shortest paths problem. The worst case running time of the first algorithm is O(m + C log C), where m is the number of edges of the input network and C is the ratio of the largest and the smallest edge weight. The pseudo-polynomial...

Ambulance offload delays are a growing concern for health care providers in many countries. Offload delays occur when ambulance paramedics arriving at a hospital Emergency Department (ED) cannot transfer patient care to staff in the ED immediately. This is typically caused by overcrowding in the...

In many service systems, customers are not served in the order they arrive, but according to a priority scheme that ranks them with respect to their relative "importance." However, it may not be an easy task to determine the importance level of customers, especially when decisions need to be...

We model two separate, decentralized systems, each consisting of a warehouse and a production capacity. The demand processes experienced by the systems have different variabilities. The two decentralized systems consider an agreement to pool their production capacities. We examine the impact of...

We give a closed-form expression for the long-run average cost and the bias vector in a two-class exponential preemptive resume priority queue with holding and switching costs. The bias vector is the sum of a quadratic function of the number of customers in each priority class and an exponential...

We give a closed-form expression for the long-run average cost and the bias vector in a two-class exponential preemptive resume priority queue with holding and switching costs. The bias vector is the sum of a quadratic function of the number of customers in each priority class and an exponential...