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

DOI10.1007/S10951-014-0389-6MaRDI QIDQ310329zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Scheduling Periodic Tasks
• The non-preemptive scheduling of periodic tasks upon multiprocessors
• Nonpreemptive scheduling of periodic tasks in uni- and multiprocessor systems
• Preemptive scheduling of periodic jobs in uniform multiprocessor systems
• Nonpreemptive scheduling of arbitrary machines

Cites work

• A Mathematical Model for Periodic Scheduling Problems
• scientific article; zbMATH DE number 108489 (Why is no real title available?)
• Line search method for solving a non-preemptive strictly periodic scheduling problem
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Minimizing Service and Operation Costs of Periodic Scheduling
• On cyclic sequence types for constructing cyclic schedules
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling periodic tasks in a hard real-time environment
• Solving an avionics real-time scheduling problem by advanced IP-methods
• Strictly periodic scheduling in IMA-based architectures

Cited in

(7)

• An efficient bicriteria algorithm for stable robotic flow shop scheduling
• A probe-based algorithm for piecewise linear optimization in scheduling
• Large-scale periodic scheduling in time-sensitive networks
• 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
• Periodic chains scheduling on dedicated resources -- a crucial problem in time-sensitive networks
• Linear programming based algorithms for preemptive and non-preemptive RCPSP

Describes a project that uses

Uses Software

• PESPLib

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

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