Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems

DOI10.1287/OPRE.40.2.367MaRDI QIDQ4004743zbMATH OpenOpenAlexFDO

Authors Susan H. Xu

Publication date 27 September 1992

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.40.2.367

zbMATH Keywords

fixed number of nonpreemptive jobsmultiple nonidentical processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Probabilistic games; gambling (91A60)

Recommendations

• Individually optimal routing in parallel systems
• Stochastic dispatching of multi-priority jobs to heterogeneous processors
• Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Optimal routing to parallel heterogeneous servers-small arrival rates

Cited in

(3)

• scientific article; zbMATH DE number 431652 (Why is no real title available?)
• Individually optimal routing in parallel systems
• On a job resequencing issue in parallel processor stochastic scheduling

This page was built for publication: Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems

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