A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length (Q796444)
From MaRDI portal
!
WARNING
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 3864976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length |
scientific article; zbMATH DE number 3864976 |
Statements
A stochastic permutation-flowshop scheduling problem minimizing in distribution the schedule length (English)
0 references
1984
0 references
minimization of schedule length
0 references
stochastic scheduling
0 references
stochastic permutation-flowshop
0 references
0.895197868347168
0 references
0.8822796940803528
0 references
0.8713757395744324
0 references
0.8630266785621643
0 references
