Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5312
Full metadata record
DC FieldValueLanguage
dc.creatorVeatch, Michael H.-
dc.creatorWein, Lawrence M.-
dc.date2004-05-28T19:33:06Z-
dc.date2004-05-28T19:33:06Z-
dc.date1991-08-
dc.date.accessioned2013-10-09T02:38:59Z-
dc.date.available2013-10-09T02:38:59Z-
dc.date.issued2013-10-09-
dc.identifierhttp://hdl.handle.net/1721.1/5312-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionWeber and Stidham (1987) used submodularity to establish transition monotonicity (a service completion at one station cannot reduce the service rate at another station) for Markovian queueing networks that meet certain regularity conditions and are controlled to minimize service and queueing costs. We give an extension of monotonicity to other directions in the state space, such as arrival transitions, and to arrival routing problems. The conditions used to establish monotonicity, which deal with the boundary of the state space, are easily verified for many queueing systems. We also show that, without service costs, transition-monotone controls can be described by simple control regions and switching functions, extending earlier results. The theory is applied to production/inventory systems with holding costs at each stage and finished goods backorder costs.-
dc.format1214972 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.publisherMassachusetts Institute of Technology, Operations Research Center-
dc.relationOperations Research Center Working Paper;OR 257-91-
dc.subjectcontrol of queues, dynamic programming, submodularity, monotone policies, production/inventory systems.-
dc.titleMonotone Control of Queueing and Production/Inventory Systems-
dc.typeWorking Paper-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.