The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (Q3863680): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:02, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations |
scientific article |
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
