Chaotic Multi-Objective Simulated Annealing and Threshold Accepting for Job Shop Scheduling Problem
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 Annealing is among the best algorithms. However, in M...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-01-01
|
| Series: | Mathematical and Computational Applications |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2297-8747/26/1/8 |