Exact and heuristic algorithms for thrift cyclic scheduling

DOI10.3390/A2041449MaRDI QIDQ1662520zbMATH OpenOpenAlexFDO

Authors Michael J. Short

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

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)

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

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2153624 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A note on `Efficient scheduling of periodic information monitoring requests'
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies
• Efficient scheduling of periodic information monitoring requests
• Scheduling of offset free systems
• Vehicle minimization for periodic deliveries

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)