A Pareto archive particle swarm optimization for multi-objective job shop scheduling

@article{Lei2008APA,
  title={A Pareto archive particle swarm optimization for multi-objective job shop scheduling},
  author={Deming Lei},
  journal={Computers & Industrial Engineering},
  year={2008},
  volume={54},
  pages={960-971}
}
In this paper, we present a particle swarm optimization for multi-objective job shop scheduling problem. The objective is to simultaneously minimize makespan and total tardiness of jobs. By constructing the corresponding relation between real vector and the chromosome obtained by using priority rule-based representation method, job shop scheduling is converted into a continuous optimization problem. We then design a Pareto archive particle swarm optimization, in which the global best position… CONTINUE READING
54 Citations
15 References
Similar Papers

Citations

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

References

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

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

  • D. Lei, Z. Wu
  • International Journal of Advanced Manufacturing…
  • 2006
2 Excerpts

A fast and elitist multi - objective genetic algorithms : NSGAII

  • K. Deb, A. Pratap, S. Agarwal, T. Meyarivan
  • IEEE Transactions on Evolutionary Computation
  • 2002

Similar Papers

Loading similar papers…