Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups

Izak Duenyas and Mark P. Van Oyen
Additional contact information
Izak Duenyas: Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109
Mark P. Van Oyen: Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208-3119

Management Science, 1996, vol. 42, issue 6, 814-829

Abstract: We consider the problem of allocating a single server to a system of queues with Poisson arrivals. Each queue represents a class of jobs and possesses a holding cost rate, general service distribution, and general set-up time distribution. The objective is to minimize the expected holding cost due to the waiting of jobs. A set-up time is required to switch from one queue to another. We provide a limited characterization of the optimal policy and a simple heuristic scheduling policy for this problem. Simulation results demonstrate the effectiveness of our heuristic over a wide range of problem instances.

Keywords: stochastic scheduling; production/inventory; production control; polling systems (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.42.6.814 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:42:y:1996:i:6:p:814-829

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().