Reducing the solution space of optimal task scheduling

DOI10.1016/J.COR.2013.09.004MaRDI QIDQ336912zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(A^\ast\)parallel computingstate space pruningtask scheduling

Mathematics Subject Classification ID

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) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

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

Cites work

• A comparison of multiprocessor task scheduling algorithms with communication costs
• A high performance algorithm for static task scheduling in heterogeneous distributed computing systems
• Artificial intelligence. Foundations of computational agents.
• Generalized best-first search strategies and the optimality of A*
• scientific article; zbMATH DE number 1756650 (Why is no real title available?)
• List scheduling with and without communication delays
• Multiprocessor scheduling with communication delays
• On multiprocessor task scheduling using efficient state space search approaches
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling for parallel processing
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• UET scheduling with unit interprocessor communication delays

Cited in

(8)

• Locality-aware task scheduling for homogeneous parallel computing systems
• Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay
• GPU implementation of a cellular genetic algorithm for scheduling dependent tasks of physical system simulation programs
• scientific article; zbMATH DE number 1974088 (Why is no real title available?)
• Recent Advances in Constraints
• Optimising makespan and energy consumption in task scheduling for parallel systems
• A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays
• Branch-and-bound task allocation with task clustering-based pruning

Describes a project that uses

Uses Software

• Hypertool

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)