A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem
It is not uncommon for today’s problems to fall within the scope of the well-known class of NP-Hard problems. These problems generally do not have an analytical solution, and it is necessary to use meta-heuristics to solve them. The Job Shop Scheduling Problem (JSSP) is one of these problems, and fo...
Main Authors: | Monique Simplicio Viana, Orides Morandin Junior, Rodrigo Colnago Contreras |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-09-01
|
Series: | Sensors |
Subjects: | |
Online Access: | https://www.mdpi.com/1424-8220/20/18/5440 |
Similar Items
-
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem
by: Monique Simplicio Viana, et al.
Published: (2022-06-01) -
Job shop scheduling using genetic algorithm /
by: 175743 Ab. Rahman Ahmad, et al.
Published: (2003) -
Neural networks for job-shop scheduling /
by: 298653 Willems, T. M., et al. -
Improved Genetic Algorithm Approach Based on New Virtual Crossover Operators for Dynamic Job Shop Scheduling
by: Kaouther Ben Ali, et al.
Published: (2020-01-01) -
Necessary and Sufficient Conditions for Feasible Neighbourhood Solutions in the Local Search of the Job-Shop Scheduling Problem
by: Lin Gui, et al.
Published: (2023-08-01)