Simulation and optimisation based approach for job shop scheduling problems

2016 ◽  
Author(s):  
Pooja Kulkarni ◽  
Jayendran Venkateswaran
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling

scholarly journals Improved Differential Evolution Algorithm for Flexible Job Shop Scheduling Problems

2019 ◽  
Vol 24 (3) ◽  
pp. 80 ◽  
Author(s):  
Prasert Sriboonchandr ◽  
Nuchsara Kriengkorakot ◽  
Preecha Kriengkorakot
Keyword(s):  
Differential Evolution ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Differential Evolution Algorithm ◽  
Flexible Job Shop ◽  
Scheduling Problems ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling ◽  
Relative Errors ◽  
Improved Differential Evolution Algorithm

This research project aims to study and develop the differential evolution (DE) for use in solving the flexible job shop scheduling problem (FJSP). The development of algorithms were evaluated to find the solution and the best answer, and this was subsequently compared to the meta-heuristics from the literature review. For FJSP, by comparing the problem group with the makespan and the mean relative errors (MREs), it was found that for small-sized Kacem problems, value adjusting with “DE/rand/1” and exponential crossover at position 2. Moreover, value adjusting with “DE/best/2” and exponential crossover at position 2 gave an MRE of 3.25. For medium-sized Brandimarte problems, value adjusting with “DE/best/2” and exponential crossover at position 2 gave a mean relative error of 7.11. For large-sized Dauzere-Peres and Paulli problems, value adjusting with “DE/best/2” and exponential crossover at position 2 gave an MRE of 4.20. From the comparison of the DE results with other methods, it was found that the MRE was lower than that found by Girish and Jawahar with the particle swarm optimization (PSO) method (7.75), which the improved DE was 7.11. For large-sized problems, it was found that the MRE was lower than that found by Warisa (1ST-DE) method (5.08), for which the improved DE was 4.20. The results further showed that basic DE and improved DE with jump search are effective methods compared to the other meta-heuristic methods. Hence, they can be used to solve the FJSP.

Multiobjective Optimization for Complex Flexible Job-Shop Scheduling Problems

2021 ◽  
Author(s):  
Karim Tamssaouet ◽  
Stéphane Dauzère-Pérès ◽  
Sebastian Knopp ◽  
Abdel Bitar ◽  
Claude Yugma
Keyword(s):  
Multiobjective Optimization ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flexible Job Shop ◽  
Scheduling Problems ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling

Systematische Navigation für die Reihenfolgeplanung/Systematic solution space navigation for job shop scheduling problems

2020 ◽  
Vol 110 (07-08) ◽  
pp. 563-571
Author(s):  
Edzard Weber ◽  
Eduard Schenke ◽  
Luka Dorotic ◽  
Norbert Gronau
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Solution Space ◽  
Comparative Test ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Space Navigation ◽  
Systematic Solution

Dieser Beitrag stellt einen Algorithmus für das Job-shop-Scheduling-Problem vor, welcher den Lösungsraum indexiert und eine systematische Navigation zur Lösungssuche durchführt. Durch diese problemadäquate Aufbereitung wird der Lösungsraum nach bestimmten Kriterien vorzustrukturiert. Diese Problemrepräsentation wird formal beschrieben, sodass ihre Anwendung als Grundlage für ein navigationsorientiertes Suchverfahren dienen kann. Ein vergleichender Test mit anderen Optimierungsansätzen zeigt die Effizienz dieser Lösungsraumnavigation.   This paper presents an algorithm for the job-shop scheduling problem indexing the solution space and performing systematic navigation to find good solutions. By this problem-adequate preparation of the solution space, the solution space is pre-structured according to certain criteria. This problem representation is formally described so that its application can serve as a basis for a navigation-oriented search procedure. A comparative test with other optimization approaches shows the efficiency of this solution space navigation.

Sign in / Sign up

Export Citation Format

Share Document