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 the normal view instead:
scientific article; zbMATH DE number 26846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7964794039726257
0 references
0.7863802313804626
0 references
