A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem
From MaRDI portal
Publication:2669530
DOI10.1016/j.cor.2021.105431OpenAlexW3179097139MaRDI QIDQ2669530
Junlong Wang, Hongyan Chu, Guozhi Ding, Caixia Zhang, Zhi-Feng Liu, Lu Zhang
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105431
evolutionary computationshybrid genetic algorithmflexible job shop scheduling problemvariable neighbourhood descentmultilevel neighbourhood structure
Related Items (2)
Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting
Cites Work
- Unnamed Item
- Genetic tabu search for the fuzzy flexible job shop problem
- An effective new island model genetic algorithm for job shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Effective neighbourhood functions for the flexible job shop problem
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- Routing and scheduling in a flexible job shop by tabu search
- Applying tabu search to the job-shop scheduling problem
- A MILP model for an extended version of the flexible job shop problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- A research survey: review of flexible job shop scheduling techniques
- Combining Constraint Programming and Local Search for Job-Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
This page was built for publication: A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem