An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: Q4247460 / 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: 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: Q5286651 / rank | |||
Normal rank | |||
Latest revision as of 08:47, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. |
scientific article |
Statements
An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (English)
0 references
17 August 2003
0 references
Scheduling
0 references
Hierarchical communications
0 references
Approximability
0 references
0 references
