Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993)
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: Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines |
scientific article; zbMATH DE number 5118516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines |
scientific article; zbMATH DE number 5118516 |
Statements
Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (English)
0 references
25 January 2007
0 references
0 references
0.9676522
0 references
0.9547133
0 references
0.9455212
0 references
0.94257545
0 references
0.93928266
0 references
0.93426454
0 references
0.9328642
0 references
0.9310321
0 references
0.9256917
0 references
