An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem

DOI10.3390/A8010019zbMath1461.90054OpenAlexW2114921078MaRDI QIDQ1736634

Yu Bin, Wang Keming, Li Ting, Zhu Hanbing, Kong Lu, Takano Makoto

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8010019

zbMATH Keywords

local searchshuffled frog-leaping algorithmextremal optimizationflexible job shop scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping ⋮ Multi-objective bi-level programming for the energy-aware integration of flexible job shop scheduling and multi-row layout

Cites Work

• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• An improved ant colony optimization for vehicle routing problem
• A novel elitist multiobjective optimization algorithm: Multiobjective extremal optimization
• 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 support vector machine with the tabu search algorithm for freeway incident detection
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: An improved shuffled frog-leaping algorithm for flexible job shop scheduling problem