Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:25, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan |
scientific article |
Statements
Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (English)
0 references
19 July 2019
0 references
online scheduling
0 references
uniform parallel-batch machines
0 references
makespan
0 references
competitive ratio
0 references
