General scheduling non-approximability results in presence of hierarchical communications (Q2384613): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.11.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049916336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / 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: Q4338954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q3840371 / 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: A Heuristic for a Scheduling Problem with Communication Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT / rank
 
Normal rank

Latest revision as of 09:43, 27 June 2024

scientific article
Language Label Description Also known as
English
General scheduling non-approximability results in presence of hierarchical communications
scientific article

    Statements

    Identifiers