Effective sequencing rules for closed manufacturing networks
成果类型：
Article
署名作者：
Gilland, WG
署名单位：
University of North Carolina; University of North Carolina Chapel Hill
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.49.5.759.10614
发表日期：
2001
页码：
759-770
关键词：
摘要：
This paper develops a method for determining sequencing policies to effectively control a multistation closed queueing network. We assume that several job classes, with different service time distributions, share each server and should be sequenced to maximize the long-run throughput rate of the system. A Brownian control problem that approximates the original queueing network is formulated and used to develop a dynamic sequencing policy that seeks to prevent idleness, unless the system is at a face of the workload imbalance polytope that arises in the Brownian formulation. Several examples are used to demonstrate the benefit of this policy over the static prioritization proposed by Chevalier and Wein (1993), which has previously been shown to dominate traditional scheduling policies in a closed network setting.