A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations (Q5292811)
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 new algorithm for minimizing makespan, Cmax, in blocking flow-shop problem through slowing down the operations |
scientific article; zbMATH DE number 5166917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations |
scientific article; zbMATH DE number 5166917 |
Statements
A new algorithm for minimizing makespan, <i>C</i><sub>max</sub>, in blocking flow-shop problem through slowing down the operations (English)
0 references
25 June 2007
0 references
production scheduling
0 references
0.91742766
0 references
0.8857148
0 references
0 references
0.87695605
0 references
0.8695918
0 references
0.86792725
0 references
0.86611253
0 references
0.86017776
0 references
