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

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

0.00 Avg rating0 Votes
Article ID: iaor2005777
Country: Netherlands
Volume: 33
Issue: 1
Start Page Number: 9
End Page Number: 16
Publication Date: Jan 2005
Journal: Operations Research Letters
Authors:
Keywords: markov processes, programming: markov decision
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.

Reviews

Required fields are marked *. Your email address will not be published.