Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962): Difference between revisions
From MaRDI portal
Latest revision as of 04:17, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Online scheduling on unbounded parallel-batch machines to minimize the makespan |
scientific article |
Statements
Online scheduling on unbounded parallel-batch machines to minimize the makespan (English)
0 references
1 September 2010
0 references
algorithms
0 references
online scheduling
0 references
parallel-batch machines
0 references
makespan
0 references
competitive ratio
0 references
0 references