Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
DOI10.1016/J.INS.2014.07.039zbMATH Open1355.90024OpenAlexW1970867026MaRDI QIDQ508765FDOQ508765
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 8 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10356/82059
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
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- An improved harmony search algorithm for solving optimization problems
- The Complexity of Flowshop and Jobshop Scheduling
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- Title not available (Why is that?)
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- Global-best harmony search
- Deterministic job-shop scheduling: Past, present and future
- 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
- A genetic algorithm for the flexible job-shop scheduling problem
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- A hybrid harmony search algorithm for the no-wait flow-shop scheduling problems
Cited In (7)
- 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 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
- 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
- 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)
