Reducing the solution space of optimal task scheduling
From MaRDI portal
Publication:336912
DOI10.1016/j.cor.2013.09.004zbMath1348.90312OpenAlexW2024749522MaRDI QIDQ336912
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.09.004
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Locality-aware task scheduling for homogeneous parallel computing systems ⋮ Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems ⋮ GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs
Uses Software
Cites Work
- Unnamed Item
- A high performance algorithm for static task scheduling in heterogeneous distributed computing systems
- On multiprocessor task scheduling using efficient state space search approaches
- Multiprocessor scheduling with communication delays
- Scheduling for parallel processing
- UET scheduling with unit interprocessor communication delays
- List scheduling with and without communication delays
- A comparison of multiprocessor task scheduling algorithms with communication costs
- Artificial Intelligence
- Generalized best-first search strategies and the optimality of A*
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Reducing the solution space of optimal task scheduling
