Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines (Q439457): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Rafal Rózycki / rank
Normal rank
 
Property / author
 
Property / author: Jan Weglarz / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6066825 / rank
 
Normal rank
Property / zbMATH Keywords
 
power-aware computing
Property / zbMATH Keywords: power-aware computing / rank
 
Normal rank
Property / zbMATH Keywords
 
preemptable jobs
Property / zbMATH Keywords: preemptable jobs / rank
 
Normal rank
Property / zbMATH Keywords
 
ready times
Property / zbMATH Keywords: ready times / rank
 
Normal rank
Property / zbMATH Keywords
 
deadlines
Property / zbMATH Keywords: deadlines / rank
 
Normal rank
Property / zbMATH Keywords
 
non-linear programming
Property / zbMATH Keywords: non-linear programming / rank
 
Normal rank
Property / author
 
Property / author: Rafal Rózycki / rank
 
Normal rank
Property / author
 
Property / author: Jan Weglarz / rank
 
Normal rank
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.1016/j.ejor.2011.10.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093424995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling for Speed Bounded Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project Scheduling with Continuously-Divisible, Doubly Constrained Resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling with finite or infinite number of activity processing modes -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:14, 5 July 2024

scientific article
Language Label Description Also known as
English
Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
scientific article

    Statements

    Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines (English)
    0 references
    16 August 2012
    0 references
    power-aware computing
    0 references
    preemptable jobs
    0 references
    ready times
    0 references
    deadlines
    0 references
    non-linear programming
    0 references
    0 references
    0 references

    Identifiers