Line search method for solving a non-preemptive strictly periodic scheduling problem
type: Item
instance of: scholarly article
title: Line search method for solving a non-preemptive strictly periodic scheduling problem
zbMATH Open document ID: 1347.90048
author: Clément Pira
author: Christian Artigues
published in: Journal of Scheduling
publication date: 2016-09-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 91B50
zbMATH DE Number: 6625282
zbMATH Keywords: periodic scheduling
zbMATH Keywords: equilibrium
zbMATH Keywords: propagation mechanism
describes a project that uses: PESPLib
MaRDI profile type: Publication
full work available at URL: s10951-014-0389-6
OpenAlex ID: W2026964676
cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
cites work: Strictly periodic scheduling in IMA-based architectures
cites work: Minimizing Service and Operation Costs of Periodic Scheduling
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: On cyclic sequence types for constructing cyclic schedules
cites work: Scheduling Periodic Tasks in a Hard Real-Time Environment
cites work: Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
cites work: Q4023942
cites work: A Mathematical Model for Periodic Scheduling Problems
DOI: 10.1007/S10951-014-0389-6
description: scientific article; zbMATH DE number 6625282