Minimizing expected makespans of multi-priority classes of jobs on uniform processors

DOI10.1016/0167-6377(91)90013-FzbMath0751.90040OpenAlexW1985622070MaRDI QIDQ1180830

Susan H. Xu

Publication date: 27 June 1992

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90013-f

zbMATH Keywords

stochastic schedulingmulti-server systemsmakespan criterionnon- preemptive jobs with different priorities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic systems in control theory (general) (93E03)

Related Items (1)

Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines

Cites Work

• Job scheduling to minimize expected weighted flowtime on uniform processors
• Scheduling tasks with exponential service times on parallel processors
• A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
• Stochastic dispatching of multi-priority jobs to heterogeneous processors
• Minimizing expected makespans on uniform processor systems
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
• Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
• Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing expected makespans of multi-priority classes of jobs on uniform processors