Approximation results in parallel machines stochastic scheduling

DOI10.1007/BF02248591zbMath0709.90062MaRDI QIDQ922283

Gideon Weiss

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

parallel machinesstochastic schedulingheuristicstochastic processing timesweighted flowtimeexpected flowtimeSmith's Rule

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Unnamed Item ⋮ Unrelated Machine Scheduling with Stochastic Processing Times ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ An algorithm for flow time minimization and its asymptotic makespan properties ⋮ Analysis of computer job control under uncertainty ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ On Suboptimal Policies in Multiclass Tandem Models ⋮ Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines ⋮ Stochastic Online Scheduling Revisited ⋮ Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distribution-free bounds on the expectation of the maximum with scheduling applications
• Multiple feedback at a single-server station
• Scheduling with Deadlines and Loss Functions
• Scheduling tasks with exponential service times on parallel processors
• Scheduling for Minimum Total Loss Using Service Time Distributions
• Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• The Asymptotic Optimality of the LPT Rule
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
• The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
• Scheduling jobs with exponential processing times on parallel machines
• 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
• Scheduling of stochastic tasks on two parallel processors
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• Time-Sharing Service Systems. I
• Turnpike Planning Horizons for a Markovian Decision Model
• Scheduling with Random Service Times

This page was built for publication: Approximation results in parallel machines stochastic scheduling