Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (Q1147628)
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: Solving the resource constrained deadline scheduling problem via reduction to the network flow problem |
scientific article; zbMATH DE number 3704331
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the resource constrained deadline scheduling problem via reduction to the network flow problem |
scientific article; zbMATH DE number 3704331 |
Statements
Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (English)
0 references
1981
0 references
resource constrained deadline scheduling problem
0 references
reduction
0 references
network flow problem
0 references
maximal flow
0 references
binary network
0 references
NP-complete problems
0 references
computational complexity
0 references
0 references
