𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Parallel Priority Queue with Constant Time Operations

✍ Scribed by Gerth Stølting Brodal; Jesper Larsson Träff; Christos D. Zaroliagis

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
245 KB
Volume
49
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Workload distribution of discrete-time p
Workload distribution of discrete-time parallel queues with two servers
✍ P. Patrick Wang 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

We study discrete-time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a

A queue with waiting time dependent serv
A queue with waiting time dependent service times
✍ J. R. Callahan 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract Sufficient conditions are developed for the ergodicity of a single server, first‐come‐first‐serve queue with waiting time dependent service times.

A branch-and-price algorithm for paralle
A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
✍ Jonathan F. Bard; Siwate Rojanasoonthon 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

## Abstract This paper presents a branch‐and‐price algorithm for scheduling __n__ jobs on __m__ nonhomogeneous parallel machines with multiple time windows. An additional feature of the problem is that each job falls into one of __ρ__ priority classes and may require two operations. The objective i