Optimal assignment policy of a single server attended by two queues
type: Item
instance of: scholarly article
title: Optimal assignment policy of a single server attended by two queues
zbMATH Open document ID: 0871.60083
DOI: 10.1016/0096-3003(95)00298-7
published in: Applied Mathematics and Computation
publication date: 1997-05-05T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 1006553
zbMATH Keywords: queues
zbMATH Keywords: optimal assignment policy
author: Magdi S. Moustafa
MaRDI profile type: Publication
full work available at URL: 0096-3003(95)00298-7
OpenAlex ID: W2000398522
cites work: Time-Sharing Service Systems. I
cites work: A Priority Queue with Discounted Linear Costs
cites work: Dynamic Scheduling of a Multiclass Queue: Discount Optimality
cites work: Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
cites work: Optimal control of service in tandem queues
cites work: Q3804416
cites work: On the Optimal Control of Two Queues with Server Setup Times and Its Analysis
cites work: Q5615108
cites work: Applying a New Device in the Optimization of Exponential Queuing Systems
cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
cites work: Q4144550
cites work: Q3698635
cites work: On the convergence of successive approximations in dynamic programming with non-zero terminal reward
description: scientific article; zbMATH DE number 1006553