Parallel Machine Scheduling with Uncertain Communication Delays

DOI10.1051/RO:2003011MaRDI QIDQ4809662zbMATH OpenOpenAlexFDO

Authors A. Moukrim, Eric Sanlaville, Frédéric Guinand

Publication date 30 August 2004

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2003__37_1_1_0, http://www.numdam.org/item?id=RO_2003__37_1_1_0/, https://eudml.org/doc/105277

zbMATH Keywords

parallel computingflexibilitylist schedulingscheduling with communication delaysdistrubances on communication delays

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Sensitivity bounds for machine scheduling with uncertain communication delays
• A Heuristic for a Scheduling Problem with Communication Delays
• Multiprocessor scheduling with communication delays
• Scheduling tasks with communication delays on parallel processors
• Parallel machine scheduling under uncertainty

Cites work

• scientific article; zbMATH DE number 42110 (Why is no real title available?)
• scientific article; zbMATH DE number 934540 (Why is no real title available?)
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness
• A heuristic for scheduling task graphs with communication delays onto multiprocessors
• A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• List scheduling with and without communication delays
• On the calculation of the stability radius of an optimal or an approximate schedule
• Optimal scheduling for two-processor systems
• Performance of Coffman-Graham schedules in the presence of unit communication delays
• Robust discrete optimization and its applications
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Scheduling UET Trees with Communication Delays on two Processors
• Sensitivity analysis of list scheduling heuristics
• Some models for scheduling parallel programs with communication delays
• The Complexity of Scheduling Trees with Communication Delays
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• UET scheduling with unit interprocessor communication delays

Cited in

(6)

• Scheduling with uncertainties on new computing platforms
• On robust online scheduling algorithms
• Sensitivity bounds for machine scheduling with uncertain communication delays
• An upper bound on the complexity of recognizable tree languages
• A robust approach for the single machine scheduling problem
• Scheduling Precedence Task Graphs with Disturbances

This page was built for publication: Parallel Machine Scheduling with Uncertain Communication Delays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809662)