Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Rodolphe Giroudeau / rank
 
Normal rank
Property / author
 
Property / author: Jean-Claude Konig / 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.1007/s10288-010-0127-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076173115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of scheduling with large communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation for precedence constrained scheduling problems with large communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three, four, five, six, or the complexity of scheduling with communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic for a Scheduling Problem with Communication Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Architecture-Independent Analysis of Parallel Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UET scheduling with unit interprocessor communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286651 / rank
 
Normal rank

Latest revision as of 02:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Scheduling \(UET\)-tasks on a star network: complexity and approximation
scientific article

    Statements

    Scheduling \(UET\)-tasks on a star network: complexity and approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    non-approximability
    0 references
    approximation
    0 references
    0 references