A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times (Q1762161)
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: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times |
scientific article; zbMATH DE number 6107601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times |
scientific article; zbMATH DE number 6107601 |
Statements
A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times (English)
0 references
15 November 2012
0 references
flexible job shop scheduling problem with transportation
0 references
bounded processing times
0 references
genetic algorithm
0 references
tabu search
0 references
flexible manufacturing system
0 references
robotic cell
0 references
surface treatment facility
0 references
disjunctive graph
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8140642642974854
0 references
0.8130888938903809
0 references
0.8087772130966187
0 references
0.8084956407546997
0 references
0.8026906847953796
0 references
