Skip to Content

2 Results Found

  • Article
  • Open Access
13 Citations
5,465 Views
34 Pages

Chaotic Multi-Objective Simulated Annealing and Threshold Accepting for Job Shop Scheduling Problem

  • Juan Frausto-Solis,
  • Leonor Hernández-Ramírez,
  • Guadalupe Castilla-Valdez,
  • Juan J. González-Barbosa and
  • Juan P. Sánchez-Hernández

The Job Shop Scheduling Problem (JSSP) has enormous industrial applicability. This problem refers to a set of jobs that should be processed in a specific order using a set of machines. For the single-objective optimization JSSP problem, Simulated Ann...

(This article belongs to the Special Issue Numerical and Evolutionary Optimization 2020)
  • Article
  • Open Access
8 Citations
5,321 Views
27 Pages

Three Hybrid Scatter Search Algorithms for Multi-Objective Job Shop Scheduling Problem

  • Leo Hernández-Ramírez,
  • Juan Frausto-Solís,
  • Guadalupe Castilla-Valdez,
  • Javier González-Barbosa and
  • Juan-Paulo Sánchez Hernández

31 January 2022

The Job Shop Scheduling Problem (JSSP) consists of finding the best scheduling for a set of jobs that should be processed in a specific order using a set of machines. This problem belongs to the NP-hard class problems and has enormous industrial appl...

(This article belongs to the Special Issue Softcomputing: Theories and Applications II)