The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (Q3863680)
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 3664722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations |
scientific article; zbMATH DE number 3664722 |
Statements
The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (English)
0 references
1979
0 references
two-machine maximum flow time problem
0 references
series parallel precedence relations
0 references
polynomial bounded optimal algorithm
0 references
minimization of makespan
0 references
