Optimal non-preemptive semi-online scheduling on two related machines (Q5704856): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jalgor.2004.11.002 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jalgor.2004.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969305723 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JALGOR.2004.11.002 / rank | |||
Normal rank | |||
Latest revision as of 17:23, 30 December 2024
scientific article; zbMATH DE number 2229456
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal non-preemptive semi-online scheduling on two related machines |
scientific article; zbMATH DE number 2229456 |
Statements
Optimal non-preemptive semi-online scheduling on two related machines (English)
0 references
16 November 2005
0 references
Scheduling
0 references
Makespan
0 references
Semi-online
0 references
Competitive ratio
0 references
LPT
0 references
