Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays (Q2434252): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-010-0220-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089181700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic multiple-robot scheduling with time-window constraints using a critical path approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource-constrained project scheduling: Notation, classification, models, and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the cyclic scheduling problem on parallel processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retiming synchronous circuitry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric critical path problem and an application for cyclic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840372 / rank
 
Normal rank

Latest revision as of 07:30, 7 July 2024

scientific article
Language Label Description Also known as
English
Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays
scientific article

    Statements

    Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays (English)
    0 references
    0 references
    0 references
    5 February 2014
    0 references
    scheduling
    0 references
    cyclic scheduling
    0 references
    software pipelining
    0 references
    time-lags
    0 references
    precedence delays
    0 references
    resource constrained scheduling problem
    0 references
    approximated algorithm
    0 references
    list algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references