On using priced timed automata to achieve optimal scheduling (Q853729): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Uppaal in a nutshell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking and comparison of the task graph scheduling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Aircraft Landings—The Static Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038702 / rank
 
Normal rank

Latest revision as of 23:16, 24 June 2024

scientific article
Language Label Description Also known as
English
On using priced timed automata to achieve optimal scheduling
scientific article

    Statements

    On using priced timed automata to achieve optimal scheduling (English)
    0 references
    17 November 2006
    0 references
    0 references
    Priced-timed automata
    0 references
    Real-time scheduling
    0 references
    Cost optimality
    0 references
    Linear programming
    0 references
    Zone-based
    0 references
    0 references
    0 references
    0 references
    0 references