Scheduling groups of tasks with precedence constraints on three dedicated processors. (Q1421466): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonpreemptive scheduling of independent tasks with prespecified processor allocations / 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: Efficiency and effectiveness of normal schedules on three dedicated processors / 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: Multiprocessor scheduling with communication delays / rank | |||
Normal rank | |||
Latest revision as of 14:18, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling groups of tasks with precedence constraints on three dedicated processors. |
scientific article |
Statements
Scheduling groups of tasks with precedence constraints on three dedicated processors. (English)
0 references
26 January 2004
0 references
Scheduling
0 references
Normal schedule
0 references
Comparability graph
0 references
Maximum clique weight
0 references
Approximation algorithm
0 references
