Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004)
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: Path-relinking tabu search for the multi-objective flexible job shop scheduling problem |
scientific article; zbMATH DE number 6650660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path-relinking tabu search for the multi-objective flexible job shop scheduling problem |
scientific article; zbMATH DE number 6650660 |
Statements
Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (English)
0 references
10 November 2016
0 references
flexible job shop scheduling
0 references
multi-objective optimization
0 references
tabu search
0 references
path-relinking
0 references
0 references
0 references
0 references
0.8062572479248047
0 references
0.8058387637138367
0 references
0.8048314452171326
0 references
0.8031102418899536
0 references
0.8009134531021118
0 references
