COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (Q3379502)
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 5017989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM |
scientific article; zbMATH DE number 5017989 |
Statements
COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM (English)
0 references
6 April 2006
0 references
no-wait flow shop
0 references
simulated annealing
0 references
genetic algorithm
0 references
cyclic scheduling problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8169003129005432
0 references
0.7987534999847412
0 references
0.7965927720069885
0 references
0.7784655690193176
0 references
