A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem (Q2794678): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57912597, #quickstatements; #temporary_batch_1707232231678 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:32, 5 March 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
