Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines (Q3947109): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q1329788 |
||
| Property / author | |||
| Property / author: Jan Karel Lenstra / rank | |||
Revision as of 16:57, 27 February 2024
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
