Optimal control of multiclass parallel service systems

DOI10.1007/BF01797236MaRDI QIDQ1916032zbMATH OpenFDO

Authors Panayotis D. Sparaggis, Don Towsley, Christos G. Cassandras

Publication date 28 August 1996

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

zbMATH Keywords

schedulingroutingdigraphs with a cyclic structureparallel homogeneous servers with finite capacitiesshortest queue policy

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Miscellaneous topics in calculus of variations and optimal control (49N99)

Recommendations

• Optimal control of parallel server systems with many servers in heavy traffic
• On the optimal control of parallel systems and queues
• OPTIMAL CONTROL OF PARALLEL QUEUES WITH BATCH SERVICE
• Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously
• Optimal Control of a Multiclass, Flexible Queueing System
• Optimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime
• Optimal control of a queueing system with simultaneous service requirements
• Asymptotically optimal control of many-server heterogeneous service systems with \(H_{2}^{*}\) service times
• Optimal control for parallel queues with a single batch server

Cites work

• scientific article; zbMATH DE number 3885030 (Why is no real title available?)
• scientific article; zbMATH DE number 3852171 (Why is no real title available?)
• scientific article; zbMATH DE number 3575605 (Why is no real title available?)
• scientific article; zbMATH DE number 3598362 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 941166 (Why is no real title available?)
• A simple dynamic routing problem
• Comparing counting processes and queues
• Deciding Which Queue to Join: Some Counterexamples
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
• Inequalities: theory of majorization and its applications
• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
• On the Optimality of the Generalized Shortest Queue Policy
• On the optimal assignment of customers to parallel servers
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Optimal scheduling of two competing queues with blocking
• Optimality of routing and servicing in dependent parallel processing systems
• Optimality of the shortest line discipline
• Optimality of the shortest line discipline with state-dependent service rates
• Routing with limited state information in queueing systems with blocking
• Sample Path Criteria for Weak Majorization
• Scheduling policies using marked/phantom slot algorithms
• The cμ rule revisited
• The Existence of Probability Measures with Given Marginals

Cited in

(5)

• Risk-Sensitive Control for the Parallel Server Model
• On the duality between routing and scheduling systems with finite buffer space
• On the optimal control of parallel processing networks with resource collaboration and multitasking
• Optimal control with monotonicity constraints for a parallel-server loss channel serving multi-class jobs
• An overview for Markov decision processes in queues and networks

This page was built for publication: Optimal control of multiclass parallel service systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916032)