Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem
From MaRDI portal
Publication:2664300
DOI10.1016/j.cor.2020.104951zbMath1458.90283OpenAlexW3021534971MaRDI QIDQ2664300
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104951
local searchoperations researchparticle swarm optimization algorithmflexible job shop scheduling problemencoding and decoding schemes
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A survey of job shop scheduling problem: the types and models ⋮ A hybrid multi-objective approach for real-time flexible production scheduling and rescheduling under dynamic environment in Industry 4.0 context ⋮ A multi-agent system for integrated scheduling and maintenance planning of the flexible job shop ⋮ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy
Cites Work
- An effective architecture for learning and evolving flexible job-shop schedules
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Solving the flexible job shop scheduling problem with sequence-dependent setup times
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- Routing and scheduling in a flexible job shop by tabu search
- A genetic algorithm for the flexible job-shop scheduling problem
- Scheduling job shop associated with multiple routings with genetic and ant colony heuristics
- The Complexity of Flowshop and Jobshop Scheduling
- Algorithms for Solving Production-Scheduling Problems