| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524021 | Operations Research Letters | 2005 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Wendell G. Gilland,