Sensitivity bounds for machine scheduling with uncertain communication delays
type: Item
instance of: scholarly article
title: Sensitivity bounds for machine scheduling with uncertain communication delays
zbMATH Open document ID: 1123.90034
author: Eric Sanlaville
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 5153344
zbMATH Keywords: machine scheduling
zbMATH Keywords: uncertainty
zbMATH Keywords: sensitivity analysis
zbMATH Keywords: communication delays
zbMATH Keywords: transportation delays
MaRDI profile type: Publication
full work available at URL: s10951-005-2864-6
OpenAlex ID: W1968711453
cites work: Robust scheduling of metaprograms
cites work: A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
cites work: A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
cites work: Q4895239
cites work: Scheduling UET Trees with Communication Delays on two Processors
cites work: Scheduling Precedence Task Graphs with Disturbances
cites work: Project scheduling under uncertainty: survey and research potentials
cites work: Robust discrete optimization and its applications
cites work: Parallel Machine Scheduling with Uncertain Communication Delays
cites work: Towards an Architecture-Independent Analysis of Parallel Algorithms
cites work: Sensitivity analysis of scheduling algorithms
cites work: On the calculation of the stability radius of an optimal or an approximate schedule
cites work: List scheduling with and without communication delays
DOI: 10.1007/S10951-005-2864-6
Recommended article: Parallel Machine Scheduling with Uncertain Communication Delays
Recommended article: On the complexity of scheduling with large communication delays
Recommended article: Scheduling jobs with communication delays: Using infeasible solutions for approximation
Recommended article: Q4354348
Recommended article: Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
Recommended article: Parallel Machine Scheduling under Uncertainty
Recommended article: Task scheduling with and without communication delays: A unified approach
Recommended article: Sensitivity Analysis for Stochastic Scheduling Problems
Recommended article: Scheduling chains on uniform processors with communication delays
Recommended article: Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays
description: scientific article; zbMATH DE number 5153344