On-line approximation algorithms for scheduling tasks on identical machines with extendable working time (Q1290163)
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: On-line approximation algorithms for scheduling tasks on identical machines with extendable working time |
scientific article; zbMATH DE number 1299361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line approximation algorithms for scheduling tasks on identical machines with extendable working time |
scientific article; zbMATH DE number 1299361 |
Statements
On-line approximation algorithms for scheduling tasks on identical machines with extendable working time (English)
0 references
10 June 1999
0 references
on-line problem
0 references
assigning tasks to identical machines
0 references
completion time
0 references
bin packing
0 references
worst-case relative error
0 references
list scheduling heuristic
0 references
0.8843360543251038
0 references
0.7921410202980042
0 references
0.7902846336364746
0 references
0.7866266965866089
0 references
0.7836019992828369
0 references
