Priority queues and double-ended priority queues are fundamental data types in Computer Science, and various data structures have been proposed to implement them. In particular, diamond deques, interval heaps, min-max-pair heaps, and twin-heaps provide implicit structures for double-ended priority queues. Although these heap-like structures are essentially the same when they are presented in an...

A nite-buuered banyan network analysis technique designed to model networks at high traac loads is presented. The technique specially models two states of the network queues: queue empty and queue congested (roughly, zero or one slots free). A congested queue tends to stay congested because packets bound for the queue accumulate in the previous stage. The expected duration of this state is comp...

This paper considers a discrete-time queue with gated priority. Low priority customers arrive at the first queue at the gate in batches according to a batch Bernoulli process (BBP). When the gate opens, all low priority customers at the first queue move to the second queue at a single server. On the other hand, high priority customers directly join the second queue upon arrival. The arrival pro...

Using behavioral experiments, we examined the impact of dispensability of effort and salience of feedback on worker productivity and how they can be managed via queueing design. We considered two queue design features: queue structure that can either be parallel queues (multiple queues with a dedicated server per queue) or a single queue (a single pooled queue served by multiple providers); and...