Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling

DOI10.1016/J.INS.2014.07.039zbMath1355.90024OpenAlexW1970867026MaRDI QIDQ508765

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

zbMATH Keywords

multi-objective optimizationlocal searchharmony search algorithmflexible job shop scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

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 ⋮ Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule ⋮ Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem ⋮ A flexible job shop scheduling approach with operators for coal export terminals ⋮ A multi-objective hot-rolling scheduling problem in the compact strip production ⋮ A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem

Cites Work

• Unnamed Item
• An improved harmony search algorithm for solving optimization problems
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• Job-shop scheduling with multi-purpose machines
• 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 hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A genetic algorithm for the flexible job-shop scheduling problem
• Global-best harmony search
• A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling