An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking
Citable URI:
http://hdl.handle.net/1721.1/2864
| Title: | An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking |
| Author: | Gershwin, S. B.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Publisher: | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology |
| Issue Date: | 1983 |
| Description: |
"December, 1983" Bibliography: p. 36-37. |
| URI: | http://hdl.handle.net/1721.1/2864 |
| Series/Report no.: | LIDS-P ; 1309 |
| Keywords: | TK7855.M41 E3845 no.1309, Production control Mathematical models |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| P-1309-15633555.pdf | 2.130Mb |
View/ |
This item appears in the following Collection(s)
-
LIDS Technical Reports
The Laboratory for Information and Decision Systems Technical Report Series
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|