Complexity Results for Scheduling Tasks in Fixed Intervals on Two Types of Machines (Q3947109): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997710729 / rank | |||
Normal rank | |||
Latest revision as of 19:25, 19 March 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
