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

DOI10.1016/J.ORL.2004.02.007zbMath1076.90013OpenAlexW2083409063MaRDI QIDQ1886792

Wendell G. Gilland

Publication date: 19 November 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.02.007

zbMATH Keywords

Markov decision processSequencingQueueing network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Cites Work

• Effective Sequencing Rules for Closed Manufacturing Networks
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of optimal and nearly optimal sequencing policies for a closed queueing network