A new algorithm for online uniform-machine scheduling to minimize the makespan (Q845691): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057768782 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for List Schedules on Uniform Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An On-Line Algorithm for Some Uniform Processor Scheduling / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:53, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for online uniform-machine scheduling to minimize the makespan |
scientific article |
Statements
A new algorithm for online uniform-machine scheduling to minimize the makespan (English)
0 references
29 January 2010
0 references
online algorithms
0 references
competitive ratio
0 references
multi-machine scheduling
0 references
uniform machines
0 references
