An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns (Q1598772)
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 1746214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns |
scientific article; zbMATH DE number 1746214 |
Statements
An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns (English)
0 references
28 May 2002
0 references
scheduling
0 references
stochastic scheduling
0 references
flow-shops
0 references
expected makespan
0 references
0 references
0.8549445271492004
0 references
0.8534074425697327
0 references
0.8419328927993774
0 references
