Path-relinking tabu search for the multi-objective flexible job shop scheduling problem

DOI10.1016/J.COR.2014.01.010zbMATH Open1348.90274OpenAlexW1969772048MaRDI QIDQ337004FDOQ337004

Authors: Shuai Jia, Zhi-Hua Hu 

Publication date: 10 November 2016

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

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

Recommendations

• Hybrid particle-swarm optimization for the multi-objective flexible job-shop scheduling problem
• Two-stage hybrid Pareto ant colony algorithm for multi-objective flexible job shop scheduling
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
• Scatter search with path relinking for the flexible job shop scheduling problem

zbMATH Keywords

multi-objective optimizationtabu searchflexible job shop schedulingpath-relinking

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• The Complexity of Flowshop and Jobshop Scheduling
• An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
• The job shop scheduling problem: Conventional and new solution techniques
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• A genetic algorithm for the flexible job-shop scheduling problem
• An effective architecture for learning and evolving flexible job-shop schedules
• Job-shop scheduling with multi-purpose machines
• The development of a multi-objective tabu search algorithm for continuous optimisation problems
• Discrepancy search for the flexible job shop scheduling problem

Cited In (11)

• Solving the flexible job shop scheduling problem with sequence-dependent setup times
• An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
• A research survey: review of flexible job shop scheduling techniques
• Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems
• A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
• A priority-based genetic algorithm for a flexible job shop scheduling problem
• Scatter search with path relinking for the job shop with time lags and setup times
• Multi- and many-objective path-relinking: a taxonomy and decomposition approach
• Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
• Lexicographic optimization‐based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem
• A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems

This page was built for publication: Path-relinking tabu search for the multi-objective flexible job shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337004)