Makespan minimization in online scheduling with machine eligibility (Q5894207): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q408367 |
||
| Property / author | |||
| Property / author: Michael L. Pinedo / rank | |||
Revision as of 14:02, 14 February 2024
scientific article; zbMATH DE number 5873360
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Makespan minimization in online scheduling with machine eligibility |
scientific article; zbMATH DE number 5873360 |
Statements
Makespan minimization in online scheduling with machine eligibility (English)
0 references
1 April 2011
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
