A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (Q2794678): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:58, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem |
scientific article |
Statements
A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (English)
0 references
11 March 2016
0 references
hybrid flexible flowshop
0 references
lot streaming
0 references
simulated annealing
0 references
multiple-search paths
0 references
parallel computation
0 references
