Analysis of Smith's rule in stochastic machine scheduling
type: Item
instance of: scholarly article
title: Analysis of Smith's rule in stochastic machine scheduling
zbMATH Open document ID: 1287.90025
author: Caroline Jagtenberg
author: Uwe Schwiegelshohn
author: Marc Uetz
published in: Operations Research Letters
publication date: 2014-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B36
zbMATH DE Number: 6295915
zbMATH Keywords: stochastic scheduling
zbMATH Keywords: WSEPT
zbMATH Keywords: exponential distribution
MaRDI profile type: MaRDI publication profile
full work available at URL: j.orl.2013.08.001
OpenAlex ID: W2149932092
cites work: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
cites work: `` Strong '' NP-Completeness Results
cites work: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Lower Bounds for Smith’s Rule in Stochastic Machine Scheduling
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: Q4398780
cites work: Stochastic scheduling problems I — General strategies
cites work: Approximation in stochastic scheduling
cites work: Q3525911
cites work: Scheduling with Random Service Times
cites work: A PTAS for minimizing the total weighted completion time on identical parallel machines.
cites work: Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
Wikidata QID: Q130471451
DOI: 10.1016/J.ORL.2013.08.001
description: scientific article; zbMATH DE number 6295915