A Simple Release Policy for Networks of Queues with Controllable Inputs

Izak Duenyas
Additional contact information
Izak Duenyas: University of Michigan, Ann Arbor, Michigan

Operations Research, 1994, vol. 42, issue 6, 1162-1171

Abstract: In a recent paper, L. M. Wein (1992) addressed the problem of scheduling a network of queues. Given a multistation, multiclass queueing network, the problem involves deciding when to release a job to the network as well as how to sequence jobs at each machine in the network to meet a desired throughput level. By approximating this problem by a control problem involving Brownian motion, Wein derived effective heuristics, which easily outperformed traditional work release and sequencing rules. However, Wein's work release rules are complex and his sequencing rules are dynamic. In this paper, we test the performance of a simpler work release policy based on CONWIP (constant work-in-process) in conjunction with static sequencing rules. The results of our simulation study indicate that this simple work release rule can be effective.

Keywords: production/inventory: release and sequencing in a job shop; queues: multiclass closed queueing networks (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.42.6.1162 (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:42:y:1994:i:6:p:1162-1171

Access Statistics for this article

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