Stochastic scheduling of parallel queues with set-up costs
From MaRDI portal
Publication:1905067
DOI10.1007/BF01151932zbMath0840.90075OpenAlexW2159122894MaRDI QIDQ1905067
Izak Duenyas, Mark P. Van Oyen
Publication date: 16 January 1996
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01151932
stochastic schedulingPoisson arrivalssingle serveroptimal policypolling systemset-up costcontrol heuristicheuristic scheduling policysystem of queues
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (8)
Static and dynamic server allocation in systems with on/off sources ⋮ Flexible servers in tandem lines with setup costs ⋮ Dynamic control of a flexible server in an assembly-type queue with setup costs ⋮ Assigning a single server to inhomogeneous queues with switching costs ⋮ Dynamic scheduling of a single-server two-class queue with constant retrial policy ⋮ Mathematical methods to study the polling systems ⋮ A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups ⋮ Dynamic server assignment in a two-queue model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dominance relations in polling systems
- K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
- Interchange arguments for classical scheduling problems in queues
- Efficient visit frequencies for polling tables: Minimization of waiting cost
- On optimal polling policies
- On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
- Assigning a single server to inhomogeneous queues with switching costs
- Dynamic Scheduling of a Two-Class Queue with Setups
- Interchange arguments in stochastic scheduling
- The cμ rule revisited
- Extensions of the multiarmed bandit problem: The discounted case
- Open bandit processes and optimal scheduling of queueing networks
- Time-Sharing Service Systems. II
- Optimality of index policies for stochastic scheduling with switching penalties
- A Priority Queue with Discounted Linear Costs
- Dynamic Scheduling of a Multiclass Queue: Discount Optimality
- Time-Sharing Service Systems. I
- Optimal stochastic scheduling of forest networks with switching penalties
- Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups
- On the Optimal Control of Two Queues with Server Setup Times and Its Analysis
- Priority Queues with Setup Times
This page was built for publication: Stochastic scheduling of parallel queues with set-up costs
