A Distributed Particle Swarm Optimization Zlgorithmfor Flexible Job-hop Scheduling Problem
According to the characteristics of the Flexible job shop scheduling problem the minimum makespan as measures we proposed a distributed particle swarm optimization algorithm aiming to solve flexible job shop scheduling problem. The algorithm adopts the method of distributed ideas to solve problems a...
Main Authors: | LIU Sheng--hui, REN Juan, ZHANG Shu-Li |
---|---|
Format: | Article |
Language: | zho |
Published: |
Harbin University of Science and Technology Publications
2017-06-01
|
Series: | Journal of Harbin University of Science and Technology |
Subjects: |
Similar Items
-
Hybrid Salp Swarm Algorithm for Solving the Green Scheduling Problem in a Double-Flexible Job Shop
by: Changping Liu, et al.
Published: (2021-12-01) -
A MILP model for flexible job shop scheduling problem considering low flexibility
by: Liu, Minzheng
Published: (2024) -
An Efficient Artificial Fish Swarm Model with Estimation of Distribution for Flexible Job Shop Scheduling
by: Hongwei Ge, et al.
Published: (2016-09-01) -
Stochastic job-shop scheduling: A hybrid approach combining pseudo particle swarm optimization and the Monte Carlo method
by: Kenta ARAKI, et al.
Published: (2016-07-01) -
Flexible job-shop scheduling with learning and forgetting effect by Multi-Agent System
by: Paolo Renna
Published: (2019-05-01)