An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan |
scientific article |
Statements
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (English)
0 references
14 May 2014
0 references
online scheduling
0 references
parallel-batch machine
0 references
incompatible job families
0 references
competitive ratio
0 references
0 references
0 references
