An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem
The job shop scheduling problem (JSP) has consistently garnered significant attention. This paper introduces an improved genetic algorithm (IGA) with dynamic neighborhood search to tackle job shop scheduling problems with the objective of minimization the makespan. An inserted operation based on idl...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-09-01
|
Series: | Mathematical Biosciences and Engineering |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/mbe.2023774?viewType=HTML |