Scheduling for Minimum Total Loss Using Service Time Distributions

DOI10.1145/321796.321803MaRDI QIDQ3214416zbMATH OpenOpenAlexFDO

Authors K. C. Sevcik

Publication date 1974

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321796.321803

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(18)

• Online scheduling for outpatient services with heterogeneous patients and physicians
• On the Gittins index in the M/G/1 queue
• Scheduling of multi-class multi-server queueing systems with abandonments
• Properties of the Gittins index with application to optimal scheduling
• Four proofs of Gittins' multiarmed bandit theorem
• Branching Bandit Processes
• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines
• The expected asymptotical ratio for preemptive stochastic online problem
• Un ordonnancement dynamique de tâches stochastiques sur un seul processeur
• A tight 2-approximation for preemptive stochastic scheduling
• Coping with Incomplete Information in Scheduling — Stochastic and Online Models
• History of Queueing Theory in Canada Prior to 1980
• The power of proportional fairness for nonclairvoyant polytope scheduling
• Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
• Approximation results in parallel machines stochastic scheduling
• Dynamic priority allocation via restless bandit marginal productivity indices
• Preemptive stochastic online scheduling on two uniform machines

This page was built for publication: Scheduling for Minimum Total Loss Using Service Time Distributions

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