A Practical Scheduling Method for Multiclass Production Systems with Setups
- 1 January 1999
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 45 (1) , 116-130
- https://doi.org/10.1287/mnsc.45.1.116
Abstract
Consider a multiclass production system where many job classes share a single server and a setup time is incurred whenever the server changes class. This paper presents a simple method for scheduling these systems that performs well, not only with respect to mean waiting time, but also with respect to waiting-time variance and the outer percentiles of waiting time. The scheduling method is dynamic and uses the ages of items in each queue, as well as the queue statistics, to decide which queue to service next.Keywords
This publication has 10 references indexed in Scilit:
- Dynamic Scheduling of a Two-Class Queue with SetupsOperations Research, 1998
- Heuristic Scheduling of Parallel Heterogeneous Queues with Set-UpsManagement Science, 1996
- Scheduling Groups of Jobs on a Single MachineOperations Research, 1995
- Dynamic Scheduling with Convex Delay Costs: The Generalized $c|mu$ RuleThe Annals of Applied Probability, 1995
- On optimal polling policiesQueueing Systems, 1992
- Efficient visit frequencies for polling tables: minimization of waiting costQueueing Systems, 1991
- Broader Product Line: A Necessity to Achieve Success?Management Science, 1990
- Dynamic priority rules for cyclic-type queuesAdvances in Applied Probability, 1989
- On the Optimal Control of Two Queues with Server Setup Times and Its AnalysisSIAM Journal on Computing, 1987
- Stochastic Decompositions in the M/G/1 Queue with Generalized VacationsOperations Research, 1985