Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1892204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal preemptive semi-online scheduling to minimize makespan on two related machines |
scientific article; zbMATH DE number 1892204 |
Statements
Optimal preemptive semi-online scheduling to minimize makespan on two related machines (English)
0 references
3 April 2003
0 references
Semi-online scheduling
0 references
0 references
0 references
0.9122207164764404
0 references
0.9116013050079346
0 references
0.9081562161445618
0 references
0.8926301598548889
0 references
