A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem |
scientific article; zbMATH DE number 550259
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem |
scientific article; zbMATH DE number 550259 |
Statements
A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (English)
0 references
12 April 1994
0 references
open shop problem
0 references
polynomial algorithm
0 references
latin rectangles
0 references
0.93220305
0 references
0.88964957
0 references
0.88778687
0 references
0.8720187
0 references
0.8707813
0 references
0.86980903
0 references
0.86695486
0 references
0.86690325
0 references
