Approximation algorithms for shop scheduling problems with minsum objective

2002 ◽  
Vol 5 (4) ◽  
pp. 287-305 ◽  
Author(s):  
Maurice Queyranne ◽  
Maxim Sviridenko
Keyword(s):  
Approximation Algorithms ◽  
Scheduling Problems ◽  
Shop Scheduling

scholarly journals Improved Approximation Algorithms for Shop Scheduling Problems

1994 ◽  
Vol 23 (3) ◽  
pp. 617-632 ◽  
Author(s):  
David B. Shmoys ◽  
Clifford Stein ◽  
Joel Wein
Keyword(s):  
Approximation Algorithms ◽  
Scheduling Problems ◽  
Shop Scheduling

Approximation algorithms for shop scheduling problems with minsum objective: A correction

2006 ◽  
Vol 9 (6) ◽  
pp. 569-570 ◽  
Author(s):  
Wenhua Li ◽  
Maurice Queyranne ◽  
Maxim Sviridenko ◽  
Jinjiang Yuan
Keyword(s):  
Approximation Algorithms ◽  
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
Sign in / Sign up

Export Citation Format

Share Document