Applications of discrete particle swarm optimization in solving the job-shop scheduling problems
DOI10.13413/J.CNKI.JDXBLXB.2014.03.29zbMATH Open1313.90085MaRDI QIDQ5499343FDOQ5499343
Authors: Zhi-Jun Fu, Li Feng, Weining du, Zhenbao Ling, Fengqin Yang 
Publication date: 11 February 2015
Recommendations
- A particle swarm optimization algorithm for job-shop scheduling problem
- Job-shop scheduling based on improved particle swarm
- Study on particle swarm algorithm for job shop scheduling problems
- A discrete version of particle swarm optimization for flowshop scheduling problems
- A particle swarm optimization-based algorithm for job-shop scheduling problems
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)
Cited In (10)
- A Particle Swarm Approach to Quadratic Assignment Problems
- Title not available (Why is that?)
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- A particle swarm optimization algorithm for job-shop scheduling problem
- A particle swarm optimization-based algorithm for job-shop scheduling problems
- A particle swarm optimization and differential evolution algorithms for job shop scheduling problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- An extended discrete particle swarm optimization algorithm for the dynamic facility layout problem
- Introducing dynamic diversity into a discrete particle swarm optimization
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
This page was built for publication: Applications of discrete particle swarm optimization in solving the job-shop scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5499343)
