Online scheduling with rearrangement on two related machines (Q627161)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Online scheduling with rearrangement on two related machines |
scientific article; zbMATH DE number 5853798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online scheduling with rearrangement on two related machines |
scientific article; zbMATH DE number 5853798 |
Statements
Online scheduling with rearrangement on two related machines (English)
0 references
21 February 2011
0 references
scheduling problems
0 references
competitive analysis
0 references
online non-preemptive scheduling problem
0 references
0.9145840406417848
0 references
0.8943029046058655
0 references
0.8473744988441467
0 references
0.8262532353401184
0 references
0.8114906549453735
0 references
