Approximation results in parallel machines stochastic scheduling
type: Item
instance of: scholarly article
title: Approximation results in parallel machines stochastic scheduling
zbMATH Open document ID: 0709.90062
DOI: 10.1007/BF02248591
author: Gideon Weiss
published in: Annals of Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4167838
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: stochastic processing times
zbMATH Keywords: parallel machines
zbMATH Keywords: expected flowtime
zbMATH Keywords: weighted flowtime
zbMATH Keywords: heuristic
zbMATH Keywords: Smith's Rule
MaRDI profile type: Publication
cites work: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
cites work: Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
cites work: Q3286690
cites work: Q5528194
cites work: Distribution-free bounds on the expectation of the maximum with scheduling applications
cites work: Q5624436
cites work: The Asymptotic Optimality of the LPT Rule
cites work: Q4198056
cites work: Q4197923
cites work: Q3959421
cites work: Scheduling tasks with exponential service times on parallel processors
cites work: Dynamic Scheduling of a Multiclass Queue: Discount Optimality
cites work: On the optimality of static priority policies in stochastic scheduling on parallel machines
cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
cites work: Time-Sharing Service Systems. I
cites work: Q4124328
cites work: Scheduling jobs with exponential processing times on parallel machines
cites work: Scheduling with deadlines and loss functions
cites work: Multiple feedback at a single-server station
cites work: Scheduling of stochastic tasks on two parallel processors
cites work: The “Largest Variance First” Policy in Some Stochastic Scheduling Problems
cites work: Scheduling with Random Service Times
cites work: Scheduling for Minimum Total Loss Using Service Time Distributions
cites work: Turnpike Planning Horizons for a Markovian Decision Model
cites work: Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtime
cites work: Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtime
description: scientific article; zbMATH DE number 4167838