On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640)
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 5599880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs |
scientific article; zbMATH DE number 5599880 |
Statements
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (English)
0 references
28 August 2009
0 references
on-line scheduling
0 references
batch machine
0 references
job families
0 references
competitive ratio
0 references
0 references
0.9192343950271606
0 references
0.9093652367591858
0 references
0.9057102799415588
0 references
0.9044541716575624
0 references
