SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS (Q3022006): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank | |||
Normal rank | |||
Latest revision as of 12:46, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS |
scientific article |
Statements
SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS (English)
0 references
22 June 2005
0 references
parallel machines scheduling
0 references
max flow time minimization
0 references
approximation algorithms
0 references
on-line and off-line algorithms
0 references
0 references
