Converging to periodic schedules for cyclic scheduling problems with resources and deadlines

DOI10.1016/J.COR.2014.03.004zbMath1348.90253OpenAlexW1975602757MaRDI QIDQ337140

Alix Munier Kordon, Benoît Dupont de Dinechin

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2014.03.004

zbMATH Keywords

throughput maximizationcyclic schedulingresource constrained project scheduling problemsoftware pipelining

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Grouping tasks to save energy in a cyclic scheduling problem: a complexity study

Uses Software

• MediaBench

Cites Work

• Unnamed Item
• Unnamed Item
• A cyclic scheduling problem with an undetermined number of parallel identical processors
• A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
• The basic cyclic scheduling problem with deadlines
• A general model for cyclic machine scheduling problems
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• A study of the cyclic scheduling problem on parallel processors
• Cyclic scheduling in robotic flowshops
• On scheduling cycle shops: Classification, complexity and approximation
• Resource-constrained project scheduling: Notation, classification, models, and methods

This page was built for publication: Converging to periodic schedules for cyclic scheduling problems with resources and deadlines