Three, four, five, six, or the complexity of scheduling with communication delays (Q1342284): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2169878774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: C.P.M. Scheduling with Small Communication Delays and Task Duplication / 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: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Scheduling Trees with 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: UET scheduling with unit interprocessor communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor scheduling with communication delays / rank
 
Normal rank

Latest revision as of 11:22, 23 May 2024

scientific article
Language Label Description Also known as
English
Three, four, five, six, or the complexity of scheduling with communication delays
scientific article

    Statements

    Three, four, five, six, or the complexity of scheduling with communication delays (English)
    0 references
    0 references
    0 references
    0 references
    13 February 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    makespan
    0 references
    identical parallel processors
    0 references
    precedence constraints
    0 references
    communication delays
    0 references
    0 references