Name
Abstract | ||
|---|---|---|
We consider the optimal scheduling of an infinite.capacity batch server in a N-node ring queueing network, where the controller observes only the length of the queue at which the server is located. For a cost criterion that includes linear holding costs, fixed dispatching costs, and linear service rewards, we prove optimality and monotonicity of threshold scheduling policies. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/BF01193939 | Mathematical Methods of Operations Research |
Keywords | Field | DocType |
mathematics,polling system,engineering,optimization | Monotonic function,Dynamic programming,Control theory,Mathematical optimization,Polling system,Holding cost,Scheduling (computing),Computer science,Queue,Queueing theory | Journal |
Volume | Issue | ISSN |
44 | 3 | 1432-5217 |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark P. Van Oyen | 1 | 234 | 19.02 |
| Demosthenis Teneketzis | 2 | 612 | 85.73 |