Weber 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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5323 |
| Date | 08 1900 |
| Creators | Veatch, Michael H., Wein, Lawrence M. |
| Publisher | Massachusetts Institute of Technology, Operations Research Center |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Working Paper |
| Format | 1214972 bytes, application/pdf |
| Relation | Operations Research Center Working Paper;OR 257-91 |
Page generated in 0.0024 seconds