Analysis of flexible shop scheduling problem based on a genetic simulated annealing algorithm

2020 ◽  
Author(s):  
Min Wang ◽  
Liming Liu ◽  
Kaiyu Song
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Genetic Simulated Annealing Algorithm ◽  
Annealing Algorithm ◽  
Flexible Shop Scheduling

Hybrid Method for Solving Flexible Open Shop Scheduling Problem with Simulated Annealing Algorithm and Multi-Agent Approach

2011 ◽  
Vol 383-390 ◽  
pp. 4612-4619 ◽  
Author(s):  
Tadeusz Witkowski ◽  
Paweł Antczak ◽  
Arkadiusz Antczak
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
The Other ◽  
Scheduling Problem ◽  
Open Shop Scheduling ◽  
Hand Search ◽  
Shop Scheduling ◽  
Multi Agent ◽  
Annealing Algorithm ◽  
Metaheuristic Optimization Algorithm

In this study we propose metaheuristic optimization algorithm, in which simulated annealing, multi agent approach with fuzzy logic are used. On the first level of solution search the multi agent approach is used, and on the second level – the simulated annealing. Two types of routing were considered: a serial and a parallel one. The multi-agent approach emphasizes flexibility rather than the optimality of solutions. On the other hand, search approaches such as simulated annealing, which focus more on the optimality of solutions.

Sign in / Sign up

Export Citation Format

Share Document