The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations (Q3863680): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.27.4.782 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.27.4.782 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:08, 21 December 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
