Show simple item record

dc.contributorGershwin, S. B.en_US
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.en_US
dc.date.accessioned2003-04-29T15:22:46Z
dc.date.available2003-04-29T15:22:46Z
dc.date.issued1983en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/2864
dc.description"December, 1983"en_US
dc.descriptionBibliography: p. 36-37.en_US
dc.description.sponsorship"DAAK11-82-K-0018"en_US
dc.description.statementofresponsibilityStanley B. Gershwin.en_US
dc.format.extent39 p.en_US
dc.format.extent2130440 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherLaboratory for Information and Decision Systems, Massachusetts Institute of Technologyen_US
dc.relation.ispartofseriesLIDS-P ; 1309en_US
dc.subject.lccTK7855.M41 E3845 no.1309en_US
dc.subject.lcshProduction control Mathematical modelsen_US
dc.titleAn efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blockingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record