Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem

DOI10.1155/2017/3630869zbMath1426.90118OpenAlexW2588154196WikidataQ59147493 ScholiaQ59147493MaRDI QIDQ1992647

Chien-Che Huang, Jeanne Chen, Li-Chiu Chen, Tung-Shou Chen, Rong-Chang Chen

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/3630869

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
• New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• An improved NEH-based heuristic for the permutation flowshop problem
• Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
• A new heuristic method for the flow shop sequencing problem
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• Modified simulated annealing algorithms for the flow shop sequencing problem
• A fast tabu search algorithm for the permutation flow-shop problem
• Multiobjective order assignment optimization in a global multiple-factory environment
• A comprehensive review and evaluation of permutation flowshop heuristics
• Future paths for integer programming and links to artificial intelligence
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Benchmarks for basic scheduling problems
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Optimal two- and three-stage production schedules with setup times included
• Network Models and Optimization
• Tabu Search—Part I
• Tabu Search—Part II
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Equation of State Calculations by Fast Computing Machines
• Flowshop-scheduling problems with makespan criterion: a review
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Variable neighborhood search: Principles and applications