Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548)
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: Scheduling jobs with equal processing times subject to machine eligibility constraints |
scientific article; zbMATH DE number 5873382
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling jobs with equal processing times subject to machine eligibility constraints |
scientific article; zbMATH DE number 5873382 |
Statements
Scheduling jobs with equal processing times subject to machine eligibility constraints (English)
0 references
1 April 2011
0 references
parallel machine scheduling
0 references
eligibility constraint
0 references
nested and inclusive eligible sets
0 references
equal-processing-time jobs
0 references
online and offline scheduling
0 references
makespan
0 references
competitive ratio
0 references
worst-case ratio
0 references
0 references
0 references
