Skip to content
Open access

Research on Flexible Job Shop Scheduling Optimization Based on Improved Genetic Algorithm

Jul 2026 · International Journal of Education and Social Development · Vol 7, pp. 57-62 · 0 citations · 8 references

TL;DR

An improved genetic algorithm with the goal of minimizing the maximum completion time has been designed and by improving coding, crossover, and introducing roulette wheel selection methods, the overall algorithm's global optimization capability is enhanced.

Abstract

Aiming at the engineering pain points of difficult solving in practical production, slow convergence of traditional genetic algorithms, and easy getting stuck in local optima, an improved genetic algorithm with the goal of minimizing the maximum completion time has been designed. By improving coding, crossover, and introducing roulette wheel selection methods, the overall algorithm's global optimization capability is enhanced. The comparison of experimental results shows that the improved genetic algorithm is superior to the traditional genetic algorithm in optimizing the target solution.

Read PDF

Similar papers

Conference Open access 2026

Job Shop Scheduling Problem Based on an Improved Genetic Algorithm

Experimental results show that the improved algorithm achieves an optimal Makespan value of 190 in dynamic disturbance scenarios and exhibits strong robustness, providing an efficient and feasible solution for job shop scheduling in complex production environments.

Jianguo Du, Chengkun Li, Zijie Tang · 0 citations
Open access Aug 2026

AFSO-JSSP: Artificial Fish Swarm Optimization for Efficient Job Shop Scheduling

Artificial Fish Swarm Optimization (AFSO) algorithm is used to optimize the JSSP in minimizing makespan, total work load and maximum work load in machines and proves that AFSO is a useful and promising method of solving complex problems in production system scheduling.

Shunmuga Priya Subramanian, Muthiah Athi, P. Pandian et al. · 0 citations
Conference Sep 2026

A Pool-Based Hybrid Genetic Algorithm with Local Search for Electric Vehicle Charging Scheduling

The electric vehicle charging scheduling problem aims to minimize total delay while satisfying capacity constraints and improving the efficient utilization of charging infrastructure. In this study, a NEH-like heuristic is proposed to generate high-quality initial solutions, and a pool-based hybrid genetic algorithm is...

Nermin Kartli · 0 citations
2024

Multi-Objective Optimization of Accurate Production and Maintenance Planning Using PSO Algorithm, in Order to Reduce Production and Warehousing Costs

Production planning is one of the main factors affecting real productivity and efficiency. Effective scheduling programs greatly improve the performance of production systems. In this research, an extended multi-objective optimization model is defined. The proposed model includes minimizing service time, production cos...

Mahdi Hatami, M. K. Naeini · 0 citations
Open access Sep 2026

Enhanced Ant Colony Optimization for Cloud Scheduling with Local Search and Elitist

Cloud computing allows the execution of various types of jobs with diverse resource requirements, so an efficient scheduling mechanism is needed to minimize processing time and improve resource utilization. The Ant Colony Optimization (ACO) algorithm is one of the metaheuristic methods widely used for job scheduling op...

I. M. A. D. Putra · 0 citations
Conference Open access 2026

Combination of Ant Algorithms and Simulated Annealing in solving Flow Shop Scheduling Problem

In this article, a common production scheduling task is presented and solved. This problem is the Flow Shop Scheduling. During the problem, given n jobs and m machines. All jobs must be processed in the same machine order. A job can only be started on a given machine if the processing on the previous machine has alread...

Anita Agárdi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.