Makespan minimization in online scheduling with machine eligibility (Q5919997): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:23, 2 February 2024
scientific article; zbMATH DE number 6196478
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Makespan minimization in online scheduling with machine eligibility |
scientific article; zbMATH DE number 6196478 |
Statements
Makespan minimization in online scheduling with machine eligibility (English)
0 references
8 August 2013
0 references
parallel machine scheduling
0 references
eligibility constraint
0 references
tree-hierarchical and GoS processing sets
0 references
interval and nested processing sets
0 references
online and semi-online scheduling
0 references
offline scheduling
0 references
makespan
0 references
competitive ratio
0 references
