Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times

DOI10.1016/j.amc.2017.01.004zbMath1411.90154OpenAlexW2581299131MaRDI QIDQ1735381

Liang Gao, Xinyu Li, Kai-Zhou Gao, Quan-ke Pan

Publication date: 28 March 2019

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

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

zbMATH Keywords

schedulingflowshopiterated local searchartificial bee colonymigrating birds optimizationfruit fly optimization

Mathematics Subject Classification ID

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

Related Items

Optimization for integrated scheduling of intelligent handling equipment with bidirectional flows and limited buffers at automated container terminals ⋮ 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 ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ Shop scheduling in manufacturing environments: a review ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production ⋮ An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times ⋮ Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time
• A variable iterated greedy algorithm for the traveling salesman problem with time windows
• Algorithms for a realistic variant of flowshop scheduling
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Local optimization of dynamic programs with guaranteed satisfaction of path constraints
• Modeling realistic hybrid flexible flowshop scheduling problems
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
• The distributed permutation flowshop scheduling problem
• Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Scheduling flexible flow lines with sequence-dependent setup times
• Local search methods for the flowshop scheduling problem with flowtime minimization
• The hybrid flow shop scheduling problem
• Benchmarks for basic scheduling problems
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
• Metaheuristics—the metaphor exposed
• Variable neighborhood search: Principles and applications