An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:31, 3 February 2024
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
