Line search method for solving a non-preemptive strictly periodic scheduling problem

DOI10.1007/S10951-014-0389-6zbMath1347.90048OpenAlexW2026964676MaRDI QIDQ310329

Clément Pira, Christian Artigues

Publication date: 8 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0389-6

zbMATH Keywords

equilibriumperiodic schedulingpropagation mechanism

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) General equilibrium theory (91B50)

Related Items (4)

Schedulability analysis of non-preemptive strictly periodic tasks in multi-core real-time systems ⋮ Line search method for solving a non-preemptive strictly periodic scheduling problem ⋮ Large-scale periodic scheduling in time-sensitive networks ⋮ An efficient bicriteria algorithm for stable robotic flow shop scheduling

Uses Software

• PESPLib

Cites Work

• Unnamed Item
• Line search method for solving a non-preemptive strictly periodic scheduling problem
• Strictly periodic scheduling in IMA-based architectures
• Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
• Scheduling Periodic Tasks in a Hard Real-Time Environment
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On cyclic sequence types for constructing cyclic schedules
• A Mathematical Model for Periodic Scheduling Problems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Minimizing Service and Operation Costs of Periodic Scheduling

This page was built for publication: Line search method for solving a non-preemptive strictly periodic scheduling problem