Interchange arguments for classical scheduling problems in queues
type: Item
instance of: scholarly article
title: Interchange arguments for classical scheduling problems in queues
zbMATH Open document ID: 0672.90050
DOI: 10.1016/0167-6911(89)90011-X
published in: Systems \& Control Letters
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4100920
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: coupling
zbMATH Keywords: index-rule
zbMATH Keywords: scheduling problems in queues
zbMATH Keywords: partial feedback
zbMATH Keywords: \(\mu \) c-rule
author: Philippe Nain
MaRDI profile type: Publication
cites work: K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
cites work: Point processes and queues. Martingale dynamics
cites work: The cμ rule revisited
cites work: Q3944001
cites work: Dynamic Scheduling of a Multiclass Queue: Discount Optimality
cites work: Time-Sharing Service Systems. I
cites work: On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
cites work: Interchange arguments in stochastic scheduling
description: scientific article; zbMATH DE number 4100920