Exact and heuristic algorithms for thrift cyclic scheduling

DOI10.3390/A2041449zbMath1445.90038OpenAlexW1989885343MaRDI QIDQ1662520

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

zbMATH Keywords

complexityheuristicsnon-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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on `Efficient scheduling of periodic information monitoring requests'
• Scheduling of offset free systems
• Vehicle minimization for periodic deliveries
• Efficient scheduling of periodic information monitoring requests
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies

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