Two-stage flow-open shop scheduling problem to minimize makespan (Q1990330)
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 6964981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-stage flow-open shop scheduling problem to minimize makespan |
scientific article; zbMATH DE number 6964981 |
Statements
Two-stage flow-open shop scheduling problem to minimize makespan (English)
0 references
25 October 2018
0 references
flow-open shop
0 references
makespan
0 references
asymptotic analysis
0 references
discrete differential evolution
0 references
0.8614605665206909
0 references
0.8501532673835754
0 references
0.8207518458366394
0 references
0.8176781535148621
0 references
0.8160588145256042
0 references
