Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant

DOI10.1016/j.cor.2020.105044zbMath1458.90265OpenAlexW3040258592MaRDI QIDQ2664430

Mujgan Sagir, Fehmi Burcin Ozsoydan

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105044

zbMATH Keywords

metaheuristicshyper-heuristicsiterated greedy searchhybrid flexible flowshop scheduling

Mathematics Subject Classification ID

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

Related Items (10)

Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Selection hyper-heuristics for the multi and many-objective quadratic assignment problem ⋮ Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility ⋮ Stochastic local search and parameters recommendation: a case study on flowshop problems ⋮ Intelligent optimization under the makespan constraint: rapid evaluation mechanisms based on the critical machine for the distributed flowshop group scheduling problem ⋮ Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• The third comprehensive survey on scheduling problems with setup times/costs
• Algorithms for a realistic variant of flowshop scheduling
• Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An improved NEH-based heuristic for the permutation flowshop problem
• Modeling realistic hybrid flexible flowshop scheduling problems
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
• A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Group technology in a hybrid flowshop environment: a case study
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
• Optimal two- and three-stage production schedules with setup times included
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant