Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling

DOI10.1080/0305215X.2022.2106477MaRDI QIDQ6191890

Li-Pei Wong, Unnamed Author, Unnamed Author

Publication date: 12 February 2024

Published in: Engineering Optimization (Search for Journal in Brave)

zbMATH Keywords

manufacturingmachine schedulingproduction schedulingheuristic selectionheuristic scheme

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Multiscale medalist learning algorithm and its application in engineering

Cites Work

• Optimization by Simulated Annealing
• Solving urban transit route design problem using selection hyper-heuristics
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• Recent advances in selection hyper-heuristics
• Routing and scheduling in a flexible job shop by tabu search
• Exploring Hyper-heuristic Methodologies with Genetic Programming
• Differential evolution algorithm with dynamic multi-population applied to flexible job shop schedule
• A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time

This page was built for publication: Simulated-annealing-based hyper-heuristic for flexible job-shop scheduling