Minimizing expected makespans on uniform processor systems

DOI10.2307/1427379zbMath0617.90044OpenAlexW2331310731MaRDI QIDQ3754427

Michael R. Garey, Richard R. Weber, Leopold Flatto, Edward G. jun. Coffman

Publication date: 1987

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cfc1d442d54687a2e873caed649daa22f36c3653

zbMATH Keywords

thresholdsstochastic optimizationstochastic schedulingBellman equations

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Scheduling jobs on heterogeneous processors, Job scheduling to minimize expected weighted flowtime on uniform processors, SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS, Minimizing expected makespans of multi-priority classes of jobs on uniform processors, Analysis of computer job control under uncertainty, Influencing waiting lists, Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines, Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines, Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines