Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines (Q3947109)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines |
scientific article |
Statements
Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines (English)
0 references
1982
0 references
parallel machines
0 references
release dates
0 references
deadlines
0 references
NP-hardness
0 references
polynomial algorithm
0 references
