An Anarchic Society Optimization Algorithm for a Flow-Shop Scheduling Problem with Multiple Transporters between Successive Machines

@inproceedings{AhmadiJavid2012AnAS,
  title={An Anarchic Society Optimization Algorithm for a Flow-Shop Scheduling Problem with Multiple Transporters between Successive Machines},
  author={Amir Ahmadi-Javid and Pedram Hooshangi-Tabrizi},
  year={2012}
}
This paper addresses a Permutation Flow-shop Scheduling Problem (PFSP) where there is a finite number of transporters between any two successive machines to carry jobs from one machine to the subsequent machine. In order to solve the problem, an effective Anarchic Society Optimization (ASO) algorithm is developed to find a sequence of jobs with nearly-minimum makespan. The proposed ASO algorithm is compared with a Particle Swarm Optimization (PSO) algorithm on a set of benchmark test problems… CONTINUE READING

Figures from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Anarchic Society Optimization: A human-inspired method

  • 2011 IEEE Congress of Evolutionary Computation (CEC)
  • 2011
VIEW 3 EXCERPTS