• Home
  • Search
  • An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem.
  • Cite Icon13
  • https://doi.org/10.3934/mbe.2023774Copy DOI Icon

An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem.

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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 idle time is introduced during the decoding phase. An improved POX crossover operator is presented. A novel mutation operation is designed for searching neighborhood solutions. A new genetic recombination strategy based on a dynamic gene bank is provided. The elite retention strategy is presented. Several benchmarks are used to evaluate the algorithm's performance, and the computational results demonstrate that IGA delivers promising and competitive outcomes for the considered JSP.

Similar Papers
  • Conference Article
  • Citations12

A Single Population Genetic Programming based Ensemble Learning Approach to Job Shop Scheduling

  • Jul 11, 2015
  • John Park +3
  • Research Article
  • Citations40

A hybrid PSO-GA algorithm for job shop scheduling in machine tool production

  • Jan 03, 2015
  • International Journal of Production Research
  • Li-Lan Liu +4
  • Research Article
  • Citations14

The just-in-time job-shop scheduling problem with distinct due-dates for operations

  • Nov 03, 2020
  • Journal of Heuristics
  • Mohammad Mahdi Ahmadian +1
  • Conference Article
  • Citations1

Based on Petri Nets and Hybrid Genetic-Tabu Search Approach to Scheduling Optimization for Dual-Resource Constrained Job Shop

  • Jan 01, 2012
  • Di Liang +2
  • Conference Article
  • Citations16

Analysis of double-resource flexible job shop scheduling problem based on genetic algorithm

  • Mar 01, 2018
  • Chao Peng +3
  • Research Article
  • Citations24

Gated‐Attention Model with Reinforcement Learning for Solving Dynamic Job Shop Scheduling Problem

  • Mar 24, 2023
  • IEEJ Transactions on Electrical and Electronic Engineering
  • Goytom Gebreyesus +4
  • Research Article
  • Citations53

Ant colony system for job shop scheduling with time windows

  • Sep 15, 2007
  • The International Journal of Advanced Manufacturing Technology
  • Rong-Hwa Huang +1
  • Conference Article
  • Citations6

A Novel Artificial Immune Algorithm for Job Shop Scheduling

  • Jun 01, 2009
  • Lu Hong
  • Conference Article
  • Citations4

A Three-Dimensional Encoding Genetic Algorithm for Job Shop Scheduling

  • Dec 15, 2007
  • Hang Yin +4
  • Book Chapter
  • Citations7

A Job-Shop Scheduling Problem with Fuzzy Processing Times

  • Jan 01, 2001
  • Feng-Tse Lin
  • Research Article
  • Citations12

An approximate evaluation method for neighbourhood solutions in job shop scheduling problem

  • Sep 01, 2022
  • IET Collaborative Intelligent Manufacturing
  • Lin Gui +3
  • Conference Article
  • Citations16

A Multi-objective Fuzzy Genetic Algorithm for Job-shop Scheduling Problems

  • Nov 01, 2006
  • Y.J Xing +3
  • Conference Article
  • Citations6

Job shop scheduling problem with late work criterion

  • Jan 01, 2015
  • AIP conference proceedings
  • Hamed Piroozfard +1
  • Research Article
  • Citations3

Solving Job-Shop Scheduling Problem Using Genetic Algorithm Approach

  • Dec 22, 2022
  • Journal of the College of Basic Education
  • Wathiq N Abdullah
  • Research Article
  • Citations10

Sensitivity Analysis of Predictive Scheduling Algorithms

  • Oct 01, 2014
  • Advanced Materials Research
  • Iwona Paprocka +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.