Lower bound algorithms for multiprocessor task scheduling with ready times (Q3410325): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1111/j.1475-3995.2005.00521.x / 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.1111/j.1475-3995.2005.00521.x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121897488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent multiprocessor tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks on three dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time in two-processor task systems with prespecified processor allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency and effectiveness of normal schedules on three dedicated processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling on three dedicated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of scheduling multiprocessor tasks with prespecified processors allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of scheduling independent two-processor tasks on dedicated processors / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1111/J.1475-3995.2005.00521.X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:06, 21 December 2024

scientific article
Language Label Description Also known as
English
Lower bound algorithms for multiprocessor task scheduling with ready times
scientific article

    Statements

    Lower bound algorithms for multiprocessor task scheduling with ready times (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2006
    0 references
    algorithm
    0 references
    lower bound
    0 references
    multiprocessor task scheduling
    0 references

    Identifiers