An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2864

Full metadata record

DC Field	Value	Language
dc.contributor	Gershwin, S. B.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:22:46Z	-
dc.date	2003-04-29T15:22:46Z	-
dc.date	1983	-
dc.date.accessioned	2013-06-04T16:15:33Z	-
dc.date.available	2013-06-04T16:15:33Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/2864	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Stanley B. Gershwin.	-
dc.description	"December, 1983"	-
dc.description	Bibliography: p. 36-37.	-
dc.description	"DAAK11-82-K-0018"	-
dc.format	39 p.	-
dc.format	2130440 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology	-
dc.relation	LIDS-P ; 1309	-
dc.subject	TK7855.M41 E3845 no.1309	-
dc.subject	Production control Mathematical models	-
dc.title	An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI