Reducing the solution space of optimal task scheduling
DOI10.1016/J.COR.2013.09.004zbMATH Open1348.90312OpenAlexW2024749522MaRDI QIDQ336912FDOQ336912
Authors: Oliver Sinnen 
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
Recommendations
- Recent Advances in Constraints
- Reducing the feasible region to a scheduling problem
- scientific article; zbMATH DE number 1974088
- Minimizing completion time for a class of scheduling problems
- scientific article; zbMATH DE number 1018754
- Towards tight lower bounds for scheduling problems
- On number of optimal solutions in some scheduling problems
- Publication:3483072
- On the optimality of exact and approximation algorithms for scheduling problems
- Polynomial reduction of time-space scheduling to time scheduling
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Artificial intelligence. Foundations of computational agents.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Generalized best-first search strategies and the optimality of A*
- 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
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- A high performance algorithm for static task scheduling in heterogeneous distributed computing systems
- Title not available (Why is that?)
- On multiprocessor task scheduling using efficient state space search approaches
Cited In (8)
- Optimising makespan and energy consumption in task scheduling for parallel systems
- Branch-and-bound task allocation with task clustering-based pruning
- Locality-aware task scheduling for homogeneous parallel computing systems
- Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
- Title not available (Why is that?)
- Recent Advances in Constraints
- GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs
- A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays
Uses Software
This page was built for publication: Reducing the solution space of optimal task scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336912)
