Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
From MaRDI portal
Publication:337004
DOI10.1016/j.cor.2014.01.010zbMath1348.90274OpenAlexW1969772048MaRDI QIDQ337004
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
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
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, Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems, Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements, Multi- and many-objective path-relinking: a taxonomy and decomposition approach, Solving the flexible job shop scheduling problem with sequence-dependent setup times, 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, A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem, 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
Cites Work
- An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
- An effective architecture for learning and evolving flexible job-shop schedules
- Discrepancy search for the flexible job shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- 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
- The development of a multi-objective tabu search algorithm for continuous optimisation problems
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- The Complexity of Flowshop and Jobshop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem