Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times (Q4888150): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:20, 8 February 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
