Unbounded parallel batch scheduling with job delivery to minimize makespan (Q1003499)
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: Unbounded parallel batch scheduling with job delivery to minimize makespan |
scientific article; zbMATH DE number 5522991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unbounded parallel batch scheduling with job delivery to minimize makespan |
scientific article; zbMATH DE number 5522991 |
Statements
Unbounded parallel batch scheduling with job delivery to minimize makespan (English)
0 references
4 March 2009
0 references
parallel batch scheduling
0 references
job delivery
0 references
heuristic
0 references
worst-case performance ratio
0 references
0 references
0 references
0.8724107146263123
0 references
0.8651129603385925
0 references
0.8605578541755676
0 references
0.857444703578949
0 references
0.8536442518234253
0 references
