Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
From MaRDI portal
Publication:626658
DOI10.1007/s10589-009-9244-7zbMath1209.90190OpenAlexW2047101237MaRDI QIDQ626658
Ke-Wei Yang, Ying-Wu Chen, Li-Ning Xing
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
interactivecombinatorial optimizationgenetic algorithmant colony optimizationcoevolutionaryflexible job shop schedulingmulti-population
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A priority-based genetic algorithm for a flexible job shop scheduling problem, A research survey: review of flexible job shop scheduling techniques, A Taxonomy for the Flexible Job Shop Scheduling Problem
Cites Work
- Unnamed Item
- An effective architecture for learning and evolving flexible job-shop schedules
- Job-shop scheduling with multi-purpose machines
- 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
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- A structural design of decision support systems for deteriorating repairable systems.
- Learnable evolution model: Evolutionary processes guided by machine learning
- Some new results on simulated annealing applied to the job shop scheduling problem
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- Approximation schemes for job shop scheduling problems with controllable processing times
- A hybrid genetic algorithm--neural network strategy for simulation optimization