Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
DOI10.1007/s10951-010-0220-yzbMath1280.68071OpenAlexW2089181700MaRDI QIDQ2434252
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
schedulingtime-lagscyclic schedulingsoftware pipeliningresource constrained scheduling problemapproximated algorithmprecedence delayslist algorithm
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)
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