Parallel Machine Scheduling with Uncertain Communication Delays
From MaRDI portal
Publication:4809662
DOI10.1051/ro:2003011zbMath1062.90028OpenAlexW2148896043MaRDI QIDQ4809662
Eric Sanlaville, Aziz Moukrim, 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
list schedulingparallel computingflexibilityscheduling with communication delaysdistrubances on communication delays
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (5)
A robust approach for the single machine scheduling problem ⋮ Sensitivity bounds for machine scheduling with uncertain communication delays ⋮ On robust online scheduling algorithms ⋮ Scheduling Precedence Task Graphs with Disturbances ⋮ An upper bound on the complexity of recognizable tree languages
Cites Work
- Unnamed Item
- Unnamed Item
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
- UET scheduling with unit interprocessor communication delays
- A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
- On the calculation of the stability radius of an optimal or an approximate schedule
- List scheduling with and without communication delays
- Sensitivity analysis of list scheduling heuristics
- A heuristic for scheduling task graphs with communication delays onto multiprocessors
- Robust discrete optimization and its applications
- Performance of Coffman-Graham schedules in the presence of unit communication delays
- Optimal scheduling for two-processor systems
- A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Scheduling UET Trees with Communication Delays on two Processors
- The Complexity of Scheduling Trees with Communication Delays
- Some models for scheduling parallel programs with communication delays
This page was built for publication: Parallel Machine Scheduling with Uncertain Communication Delays