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

Authors:
Wendell G. Gilland
Affiliations:
Kenan-Flagler Business School, University of North Carolina at Chapel Hill, Campus Box 3490, Chapel Hill, NC 27599-3490, USA
Venue:
Operations Research Letters
Year:
2005

Citing 2
Cited 0

Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs

Operations Research
Effective Sequencing Rules for Closed Manufacturing Networks

Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.