A FINITE CAPACITY RESEQUENCING MODEL WITH MARKOVIAN ARRIVALS

DOI10.1142/S0217595905000613zbMath1088.90008MaRDI QIDQ5708851

Srinivas R. Chakravarthy, Stefanka S. Chukova

Publication date: 21 November 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimizationqueueMarkovian arrival processalgorithmic probabilityphase type distribution

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Two-channel \(\mathrm{MAP}/\mathrm{PH}/2\) system with customer resequencing ⋮ A. B. Clarke's Tandem Queue Revisited—Sojourn Times

Cites Work

• Unnamed Item
• Unnamed Item
• New results on the single server queue with a batch markovian arrival process
• An End-to-End Approach to the Resequencing Problem
• Analysis of the resequencing buffer in a homogeneous M/M/2 queue
• Optimal decentralized control in a multiaccess channel with partial information

This page was built for publication: A FINITE CAPACITY RESEQUENCING MODEL WITH MARKOVIAN ARRIVALS