Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays

DOI10.1007/s10951-010-0220-yzbMath1280.68071OpenAlexW2089181700MaRDI QIDQ2434252

Abir Benabid, Claire Hanen

Publication date: 5 February 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-010-0220-y

zbMATH Keywords

schedulingtime-lagscyclic schedulingsoftware pipeliningresource constrained scheduling problemapproximated algorithmprecedence delayslist algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (3)

The resource-constrained modulo scheduling problem: an experimental study ⋮ Grouping tasks to save energy in a cyclic scheduling problem: a complexity study ⋮ The impact of core precedences in a cyclic RCPSP with precedence delays

Cites Work

• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• Retiming synchronous circuitry
• A parametric critical path problem and an application for cyclic scheduling
• A study of the cyclic scheduling problem on parallel processors
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Unnamed Item

This page was built for publication: Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays