The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (Q3863680): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.27.4.782 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2073284889 / rank | |||
Normal rank | |||
Revision as of 21:43, 19 March 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
