| Article ID: | iaor20001194 |
| Country: | United Kingdom |
| Volume: | 30 |
| Issue: | 4 |
| Start Page Number: | 1130 |
| End Page Number: | 1156 |
| Publication Date: | Dec 1998 |
| Journal: | Advances in Applied Probability |
| Authors: | Gans Noah, Ryzin Garrett Van |
| Keywords: | scheduling |
In this paper we develop policies for scheduling dynamically arriving jobs to a broad class of parallel-processing queueing systems. We show that in heavy traffic the policies asymptotically minimize a measure of the expected system backlog, which we call system work. Our results yield succinct, closed-form expressions for optimal system work in heavy traffic.