Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (Q2387249)
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: Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines |
scientific article; zbMATH DE number 2201626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines |
scientific article; zbMATH DE number 2201626 |
Statements
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines (English)
0 references
2 September 2005
0 references
Flow shop
0 references
Unrelated parallel machines
0 references
Total flow time
0 references
Simulated annealing
0 references
0 references
0 references
0.8393759727478027
0 references
0.8081912398338318
0 references
0.8075627088546753
0 references
0.8012999892234802
0 references
