A priority-based genetic algorithm for a flexible job shop scheduling problem
From MaRDI portal
Publication:2358304
DOI10.3934/jimo.2016.12.1391zbMath1364.90152OpenAlexW2524959988MaRDI QIDQ2358304
Didem Cinar, José António Oliveira, Panos M. Pardalos, Y. İlker Topcu
Publication date: 14 June 2017
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.1391
genetic algorithmsiterated local searchpermutation codingflexible job shop scheduling problempriority-based coding
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking, Metaheuristics for the online printing shop scheduling problem, A hybrid chaos firefly algorithm for three-dimensional irregular packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An integrated search heuristic for large-scale flexible job shop scheduling problems
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- An effective architecture for learning and evolving flexible job-shop schedules
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- Job-shop scheduling with multi-purpose machines
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Deterministic job-shop scheduling: Past, present and future
- 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
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
- Routing and scheduling in a flexible job shop by tabu search
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- Iterated local search for the quadratic assignment problem
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
- Locating Benefit Posts in Brazil
- Algorithms for Solving Production-Scheduling Problems
