Optimization of Multiclass Queueing Networks with Changeover Times via the Achievable Region Approach: Part I, The Single-Station Case
We address the performance optimization problem in a single-station multiclass queueing network with changeover times by means of the achievable region approach. This approach seeks to obtain performance bounds and scheduling policies from the solution of a mathematical program over a relaxation of...
| Veröffentlicht in: | Mathematics of Operations Research. - Institute for Operations Research and the Management Sciences. - 24(1999), 2, Seite 306-330 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1999
|
| Zugriff auf das übergeordnete Werk: | Mathematics of Operations Research |
| Schlagworte: | Queueing networks Performance bound Scheduling policy Applied sciences Business Behavioral sciences Law Mathematics |
| Online verfügbar |
Volltext |