Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times

DOI10.1016/j.ejor.2017.06.027zbMath1380.90129OpenAlexW2626429397MaRDI QIDQ1694317

Aymen Sioud, Caroline Gagné

Publication date: 1 February 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.06.027

zbMATH Keywords

schedulingmakespanpermutation flowshopsequence dependent setup timesmigrating birds optimization

Mathematics Subject Classification ID

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

Related Items

An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times, 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, Solving permutation flow shop scheduling problem with sequence-independent setup time, 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, A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar, A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation, Metaheuristic algorithms for balancing robotic assembly lines with sequence-dependent robot setup times, Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• The third comprehensive survey on scheduling problems with setup times/costs
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
• Flow shop batching and scheduling with sequence-dependent setup times
• General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
• Algorithms for a realistic variant of flowshop scheduling
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An improved NEH-based heuristic for the permutation flowshop problem
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• The two-machine sequence dependent flowshop scheduling problem
• A comprehensive review and evaluation of permutation flowshop heuristics
• Local search methods for the flowshop scheduling problem with flowtime minimization
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• Benchmarks for basic scheduling problems
• The significance of reducing setup times/setup costs
• A survey of scheduling problems with setup times or costs
• 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
• A fuzzy greedy heuristic for permutation flow-shop scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey