Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
From MaRDI portal
(Redirected from Publication:508765)
Recommendations
- Hybrid Pareto-based particle swarm optimization for multi-objective flexible job shop scheduling problems
- Hybrid particle-swarm optimization for the multi-objective flexible job-shop scheduling problem
- Two-stage hybrid Pareto ant colony algorithm for multi-objective flexible job shop scheduling
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- A genetic algorithm for the flexible job-shop scheduling problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- An improved harmony search algorithm for solving optimization problems
- Deterministic job-shop scheduling: Past, present and future
- Global-best harmony search
- Job-shop scheduling with multi-purpose machines
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Routing and scheduling in a flexible job shop by tabu search
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(15)- A multi-objective hot-rolling scheduling problem in the compact strip production
- A flexible job shop scheduling approach with operators for coal export terminals
- A multiobjective state transition algorithm for single machine scheduling
- An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
- Harmony search algorithm based on RUD for sloving job-shop scheduling problem
- Approximate dominance NSGA-III algorithm for solving flexible job-shop scheduling problem
- A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- Two-stage hybrid Pareto ant colony algorithm for multi-objective flexible job shop scheduling
- A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
- A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
- Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
- Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule
This page was built for publication: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508765)
