Abstract
Dynamic scheduling and control in queuing networks are addressed. A two-station queuing network with two types of jobs is studied. Type 1 jobs visit both stations 1 and 2 in sequence, and type 2 jobs visit station 1 only. The problem is to control the (external) arrival processes and the service processes, as well as to schedule the server at station 1 among the two types of jobs. The objective is to minimize a discounted cost function over an infinite time horizon. The approach is based on stochastic intensity representation of point processes. The problem is divided into several cases, each corresponding to a certain parameter range. Optimal control and scheduling are derived for some cases. For the other cases, conjectures for the optimality of certain simple threshold policies are presented.
| Original language | English |
|---|---|
| Pages (from-to) | 582-586 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 2 |
| DOIs | |
| Publication status | Published - 1990 |
| Externally published | Yes |
| Event | Proceedings of the 29th IEEE Conference on Decision and Control Part 6 (of 6) - Honolulu, HI, USA Duration: 5 Dec 1990 → 7 Dec 1990 |
Fingerprint
Dive into the research topics of 'Optimal control and scheduling in a multi-class queueing network: Results and conjectures'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver