Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times (Q4888150): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2209665149 / rank | |||
Normal rank | |||
Latest revision as of 22:15, 19 March 2024
scientific article; zbMATH DE number 909659
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times |
scientific article; zbMATH DE number 909659 |
Statements
Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times (English)
0 references
24 July 1996
0 references
open shop problems
0 references
unit processing times
0 references
two machines
0 references
arbitrary precedence constraints
0 references
polynomial time algorithm
0 references
minimization of the makespan
0 references
worst case complexity
0 references
intree constraints
0 references
