Analysis of optimal and nearly optimal sequencing policies for a closed queueing network

摘要

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. (C) 2004 Elsevier B.V. All rights reserved.