Effective Sequencing Rules for Closed Manufacturing Networks

Wendell G. Gilland ()
Additional contact information
Wendell G. Gilland: Kenan-Flagler Business School, University of North Carolina at Chapel Hill, Campus Box 3490, Chapel Hill, NC 27599-3490

Operations Research, 2001, vol. 49, issue 5, 759-770

Abstract: 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.

Keywords: Production scheduling; sequencing; stochastic: Priority sequencing in a multistation closed network; Queues; networks: scheduling rules based on approximate Brownian Models (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.49.5.759.10614 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:49:y:2001:i:5:p:759-770

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().