PSO in 2D-space to solve reactive scheduling problems in FMS to reduce the makespan.
Orides MorandinCarlos C. M. TumaVinicius F. CaridaEmerson Carlos PedrinoRoberto H. TsunakiPublished in: ISIE (2013)
Keyphrases
- scheduling problem
- flowshop
- processing times
- strongly np hard
- single machine
- tabu search
- setup times
- np hard
- permutation flowshop
- release dates
- graph coloring problems
- particle swarm optimization algorithm
- particle swarm optimization
- minimizing makespan
- unrelated parallel machines
- particle swarm optimization pso
- pso algorithm
- precedence constraints
- particle swarm optimisation
- search algorithm for solving
- genetic algorithm
- job shop
- greedy heuristics
- maximum lateness
- job shop scheduling
- job shop scheduling problem
- hybrid algorithm
- space time
- low dimensional
- search space
- lower bound
- particle swarm
- multistage
- parallel machine scheduling problem
- multi objective
- artificial neural networks
- search algorithm