Multiple feedback at a single-server station

DOI10.1016/0304-4149(77)90029-1zbMath0363.60101OpenAlexW2069896070MaRDI QIDQ1240487

Gideon Weiss, Isaac Meilijson

Publication date: 1977

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/12604

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)

Related Items (16)

Optimal control of single-server queueing networks ⋮ Stochastic scheduling and forwards induction ⋮ Four proofs of Gittins' multiarmed bandit theorem ⋮ Queueing models of secondary storage devices ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities ⋮ The archievable region method in the optimal control of queueing systems; formulations, bounds and policies ⋮ On the evaluation of fixed permutations as strategies in stochastic scheduling ⋮ Approximation results in parallel machines stochastic scheduling ⋮ Performance analysis and optimization of a cyclic-service tandem queueing system with multi-class customers ⋮ On the Gittins index in the M/G/1 queue ⋮ On optimal right-of-way policies at a single-server station when insertion of idle times is permitted ⋮ A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair ⋮ Branching Bandit Processes ⋮ Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines ⋮ On Nonpreemptive Policies for Stochastic Single-Machine Scheduling with Breakdowns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
• A Priority Queue with Discounted Linear Costs
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• On Scheduling Chains of Jobs on One Processor with Limited Preemption
• Time-Sharing Service Systems. I
• Discounted Dynamic Programming
• Negative Dynamic Programming
• A note on time sharing with preferred customers
• A note on time-sharing
• Work-conserving priorities
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: Multiple feedback at a single-server station