An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems

DOI10.1016/j.amc.2012.03.018zbMath1245.90035MaRDI QIDQ440881

Shengxian Xie, Jun-Qing Li, Quan-ke Pan

Publication date: 19 August 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.03.018

zbMATH Keywords

multi-objective optimization; shuffled frog-leaping algorithm; flexbile job shop scheduling problem; Pareto archive set

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping, Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility, A diversified shuffled frog leaping: an application for parameter identification, Path-relinking tabu search for the multi-objective flexible job shop scheduling problem, Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling, A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems, A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem, Multi-stage ordinal optimization based approach for job shop scheduling problems, A research survey: review of flexible job shop scheduling techniques

Cites Work

• An effective architecture for learning and evolving flexible job-shop schedules
• An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP)
• Mathematical models for job-shop scheduling problems with routing and process plan flexibility
• A simulated annealing technique for multi-objective simulation optimization
• 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
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• 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
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• A genetic algorithm for the flexible job-shop scheduling problem
• A study of integer programming formulations for scheduling problems
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
• The Complexity of Flowshop and Jobshop Scheduling