Analysis of optimal and nearly optimal sequencing policies for a closed queueing network |
| |
Authors: | Wendell G. Gilland |
| |
Affiliation: | Kenan-Flagler Business School, University of North Carolina at Chapel Hill, Campus Box 3490, Chapel Hill, NC 27599-3490, USA |
| |
Abstract: | ![]() We analyze sequencing policies designed to most effectively utilize the resources of a closed queueing network representation of a manufacturing system. A continuous time Markov decision process formulation is used to compare the performance of optimal sequencing policies and a heuristic developed by analyzing a heavy traffic approximation of the system. |
| |
Keywords: | Queueing network Markov decision process Sequencing |
本文献已被 ScienceDirect 等数据库收录! |