Reducing the feasible region to a scheduling problem (Q3983486)
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: Reducing the feasible region to a scheduling problem |
scientific article; zbMATH DE number 26846
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing the feasible region to a scheduling problem |
scientific article; zbMATH DE number 26846 |
Statements
Reducing the feasible region to a scheduling problem (English)
0 references
27 June 1992
0 references
project scheduling
0 references
partially ordered set of continuously divisible activities
0 references
resource constraints
0 references
project completion time
0 references
front
0 references
maximal cycle-free sets of fronts
0 references
