Periodic schedules for linear precedence constraints (Q1003670): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3820002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751390 / 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: Performance evaluation of job-shop systems using timed event-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination Properties of Generalized Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity results in cyclic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic cyclic scheduling problem with linear precedence constraints / rank
 
Normal rank

Latest revision as of 03:36, 29 June 2024

scientific article
Language Label Description Also known as
English
Periodic schedules for linear precedence constraints
scientific article

    Statements

    Periodic schedules for linear precedence constraints (English)
    0 references
    0 references
    0 references
    4 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    cyclic scheduling
    0 references
    periodic schedule
    0 references
    throughput
    0 references
    linear precedence
    0 references
    algorithm
    0 references
    complexity
    0 references
    0 references