A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 756141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for an open shop problem with unit processing times and tree constraints |
scientific article; zbMATH DE number 756141 |
Statements
A polynomial algorithm for an open shop problem with unit processing times and tree constraints (English)
0 references
17 May 1995
0 references
open shop problem
0 references
unit processing times
0 references
tree constraints
0 references
polynomial algorithm
0 references
0 references
0.9255616068840028
0 references
0.8902167677879333
0 references
0.8085124492645264
0 references
