Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903)
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 6284949
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan |
scientific article; zbMATH DE number 6284949 |
Statements
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (English)
0 references
15 April 2014
0 references
scheduling
0 references
online algorithm
0 references
makespan
0 references
parallel batch machine
0 references
0 references
0.9249803423881532
0 references
0.9192343950271606
0 references
0.9189156889915466
0 references
0.9021316766738892
0 references
0.8973263502120972
0 references
