Name
Abstract | ||
|---|---|---|
We consider scheduling a shared server in a two-class, make-to-stock, closed queueing network. We include server switching costs and lost sales costs (equivalently, server starvation penalties) for lost jobs. If the switching costs are zero, the optimal policy has a monotonic threshold type of switching curve provided that the service times are identical. For completely symmetric systems without set-ups, it is optimal to serve the longer queue. Using simple analytical models as approximations, we derive a heuristic scheduling policy. Numerical results demonstrate the effectiveness of our heuristic, which is typically within 10% of optimal. We also develop and test a heuristic policy for a model in which the shared resource is part of a series network under a CONWIP release policy. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1023/A:1019136231100 | Queueing Syst. |
Keywords | Field | DocType |
make-to-stock scheduling,CONWIP,set-up costs,closed queueing network,heuristic policy,Markov decision process | Mathematical optimization,Heuristic,Scheduling (computing),Computer science,Queue,Markov decision process,Real-time computing,Queueing theory,CONWIP,Dynamic priority scheduling,Shared resource | Journal |
Volume | Issue | ISSN |
29 | 2/4 | 1572-9443 |
Citations | PageRank | References |
6 | 0.74 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eungab Kim | 1 | 45 | 6.34 |
| Mark P. Van Oyen | 2 | 234 | 19.02 |