A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints |
scientific article; zbMATH DE number 6093062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints |
scientific article; zbMATH DE number 6093062 |
Statements
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (English)
0 references
11 October 2012
0 references
online algorithm
0 references
parallel-machine scheduling
0 references
equal-length jobs
0 references
chain precedence constraints
0 references
competitive ratio
0 references
0 references
0 references
