Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13011| Title: | Maximizing throughput in queueing networks with limited flexibility |
| Institution and School/Department of submitter: | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών |
| Keywords: | queueing networks,scheduling,approximation algorithms,source unsplittable flow,flexible servers,policies,systems,lines |
| URI: | https://olympias.lib.uoi.gr/jspui/handle/123456789/13011 |
| ISSN: | 0302-9743 |
| Link: | <Go to ISI>://000236886100038 http://download.springer.com/static/pdf/121/chp%253A10.1007%252F11682462_38.pdf?auth66=1390991913_15ff2eb9e374df7171d0312db37bd919&ext=.pdf |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Down-2006-Maximizing throughpu.pdf | 487.65 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
