Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
DOI10.1007/S10589-009-9244-7zbMATH Open1209.90190OpenAlexW2047101237MaRDI QIDQ626658FDOQ626658
Authors: Lining Xing, Yingwu Chen, Ke-Wei Yang 
Publication date: 18 February 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9244-7
Recommendations
- Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule
- A new coevolutionary genetic algorithm for job-shop scheduling problems
- Research on flexible job shop scheduling problem based on improved multi-population genetic algorithm
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- Two-stage hybrid Pareto ant colony algorithm for multi-objective flexible job shop scheduling
ant colony optimizationcombinatorial optimizationgenetic algorithmflexible job shop schedulingmulti-populationinteractivecoevolutionary
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- 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
- Routing and scheduling in a flexible job shop by tabu search
- An effective architecture for learning and evolving flexible job-shop schedules
- Some new results on simulated annealing applied to the job shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
- A hybrid genetic algorithm--neural network strategy for simulation optimization
- Learnable evolution model: Evolutionary processes guided by machine learning
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Approximation schemes for job shop scheduling problems with controllable processing times
- A structural design of decision support systems for deteriorating repairable systems.
Cited In (9)
- Multipopulation genetic algorithms with different interaction structures to solve flexible job-shop scheduling problems: a network science perspective
- A Taxonomy for the Flexible Job Shop Scheduling Problem
- A research survey: review of flexible job shop scheduling techniques
- A memory based Lamarckian evolutionary algorithm for job shop scheduling problems
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- An effective architecture for learning and evolving flexible job-shop schedules
- Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop
- Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule
This page was built for publication: Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626658)
