Exact and heuristic algorithms for thrift cyclic scheduling

DOI10.3390/A2041449zbMATH Open1445.90038OpenAlexW1989885343MaRDI QIDQ1662520FDOQ1662520

Authors: Michael J. Short 

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a2041449

Recommendations

• Scheduling of offset free systems
• Scheduling Periodic Tasks
• Scheduling cyclic tasks with binary periods
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• A new algorithm for scheduling periodic, real-time tasks

zbMATH Keywords

heuristicscomplexitynon-preemptive schedulingoffset-assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds on Multiprocessing Timing Anomalies
• Scheduling of offset free systems
• An Application of Bin-Packing to Multiprocessor Scheduling
• Vehicle minimization for periodic deliveries
• Title not available (Why is that?)
• Efficient scheduling of periodic information monitoring requests
• A note on `Efficient scheduling of periodic information monitoring requests'

Cited In (2)

• On fixed priority scheduling, offsets and co-prime task periods
• Scheduling of offset free systems

This page was built for publication: Exact and heuristic algorithms for thrift cyclic scheduling

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