Minimizing expected makespans on uniform processor systems

DOI10.2307/1427379MaRDI QIDQ3754427zbMATH OpenOpenAlexFDO

Authors M. R. Garey, E. G. jun. Coffman, L. Flatto, Richard Weber

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

stochastic optimizationthresholdsBellman equationsstochastic scheduling

Mathematics Subject Classification ID

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

Recommendations

• Job scheduling to minimize expected weighted flowtime on uniform processors
• Scheduling jobs on heterogeneous processors
• Minimizing expected makespans of multi-priority classes of jobs on uniform processors
• On the Expected Relative Performance of List Scheduling
• Probabilistic Bounds on the Performance of List Scheduling

Cited in

(9)

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

This page was built for publication: Minimizing expected makespans on uniform processor systems

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