A Multi-objective PSO for job-shop scheduling problems

@article{Sha2009AMP,
  title={A Multi-objective PSO for job-shop scheduling problems},
  author={D. Y. Sha and Hsing-Hung Lin},
  journal={2009 International Conference on Computers & Industrial Engineering},
  year={2009},
  pages={489-494}
}
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most production systems requires multi-objective optimization. The aim of this paper is to construct a particle swarm optimization (PSO) for an elaborate multi-objective job-shop scheduling problem. The original PSO was used to solve continuous optimization problems. Due to the discrete solution spaces of scheduling… CONTINUE READING
28 Citations
28 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Crowding - measure - based multi - objective evolutionary algorithm for job shop scheduling

  • D. Lei, Z. Wu
  • International Journal of Advanced Manufacturing…
  • 2006
Highly Influential
3 Excerpts

Pareto archived simulated annealing for job shop scheduling with multiple objectives

  • E. D. Taillard
  • International Journal of Advanced Manufacturing…
  • 2006

A new particle swarm optimization for the open shop scheduling problem

  • D. Sun, R. Batta, L. Lin
  • Computers & Operations Research
  • 2005

Particle swarm optimization - based schemes for resource - constrained project scheduling

  • H. Li, F. Hang
  • Automation in Construction
  • 2005

Similar Papers

Loading similar papers…