Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (Q1127153)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge |
scientific article; zbMATH DE number 1189538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge |
scientific article; zbMATH DE number 1189538 |
Statements
Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge (English)
0 references
5 November 1998
0 references
heuristics
0 references
simulated annealing
0 references
flow shop scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0.8838798403739929
0 references
0.8610310554504395
0 references
0.8439365029335022
0 references
0.8266636729240417
0 references
