A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272)
From MaRDI portal
!
WARNING
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 6650771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search/path relinking algorithm to solve the job shop scheduling problem |
scientific article; zbMATH DE number 6650771 |
Statements
A tabu search/path relinking algorithm to solve the job shop scheduling problem (English)
0 references
10 November 2016
0 references
scheduling
0 references
job shop
0 references
metaheuristics
0 references
tabu search
0 references
path relinking
0 references
hybrid algorithms
0 references
0 references
0 references
0 references
0 references
0.8351227641105652
0 references
0.8203265070915222
0 references
0.812666118144989
0 references
0.8048314452171326
0 references
0.7902932167053223
0 references
