Scheduling for Minimum Total Loss Using Service Time Distributions

DOI10.1145/321796.321803zbMath0271.68047OpenAlexW1998729850MaRDI QIDQ3214416

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

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

Related Items (16)

Four proofs of Gittins' multiarmed bandit theorem ⋮ Scheduling of multi-class multi-server queueing systems with abandonments ⋮ The expected asymptotical ratio for preemptive stochastic online problem ⋮ History of Queueing Theory in Canada Prior to 1980 ⋮ Approximation results in parallel machines stochastic scheduling ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Coping with Incomplete Information in Scheduling — Stochastic and Online Models ⋮ Online scheduling for outpatient services with heterogeneous patients and physicians ⋮ Preemptive stochastic online scheduling on two uniform machines ⋮ On the Gittins index in the M/G/1 queue ⋮ Un ordonnancement dynamique de tâches stochastiques sur un seul processeur ⋮ PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING ⋮ 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 ⋮ A Tight 2-Approximation for Preemptive Stochastic Scheduling

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