A Particle Swarm Optimization Approach to Joint Location and Scheduling Decisions in A Flexible Job Shop Environment

2015 ◽  
Vol 28 (12 (C)) ◽  
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Particle Swarm ◽  
Optimization Approach ◽  
Flexible Job Shop ◽  
Swarm Optimization ◽  
Joint Location

scholarly journals Particle Swarm Optimization and Tabu Search Hybrid Algorithm for Flexible Job Shop Scheduling Problem – Analysis of Test Results

2019 ◽  
Vol 19 (4) ◽  
pp. 26-44
Author(s):  
Asen Toshev
Keyword(s):  
Particle Swarm Optimization ◽  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Particle Swarm ◽  
Flexible Job Shop ◽  
Test Results ◽  
Flexible Job Shop Scheduling ◽  
Swarm Optimization ◽  
Shop Scheduling

Abstract The paper presents a hybrid metaheuristic algorithm, including a Particle Swarm Optimization (PSO) procedure and elements of Tabu Search (TS) metaheuristic. The novel algorithm is designed to solve Flexible Job Shop Scheduling Problems (FJSSP). Twelve benchmark test examples from different reference sources are experimentaly tested to demonstrate the performance of the algorithm. The obtained mean error for the deviation from optimality is 0.044%. The obtained test results are compared to the results in the reference sources and to the results by a genetic algorithm. The comparison illustrates the good performance of the proposed algorithm. Investigations on the base of test examples with a larger dimension will be carried out with the aim of further improvement of the algorithm and the quality of the test results.

scholarly journals Applying the Particle Swarm Optimization + Hill-climbing in the Flexible Job-Shop problem

2017 ◽  
Vol 3 (2) ◽  
pp. 40
Author(s):  
João Baptista Cardia ◽  
Edilson Reis Rodrigues Kato
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Travelling Salesman Problem ◽  
Particle Swarm ◽  
Hill Climbing ◽  
Problem Solution ◽  
Flexible Job Shop ◽  
Swarm Optimization ◽  
Applied Approach ◽  
Flexible Job Shop Problem

The Flexible Job-Shop problem is a very interesting and important problem. In this paper it is studied an approach of the PSO (Particle Swarm Optimization) in the Flexible Job-Shop problem, the studied and applied approach is derived from a Travelling Salesman Problem solution with a few minor alterations, trying to reach the optimum values discovered by a series of other works. It is used only PSO and not mixed with any other auxiliary meta-heuristic.

Sign in / Sign up

Export Citation Format

Share Document