A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem

This publication has 27 references indexed in Scilit:

• An efficient job-shop scheduling algorithm based on particle swarm optimization☆
  Expert Systems with Applications, 2010
• Multi-objective scheduling of dynamic job shop using variable neighborhood search
  Expert Systems with Applications, 2010
• Ant colony optimization combined with taboo search for the job shop scheduling problem
  Computers & Operations Research, 2008
• A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan
  Applied Mathematics and Computation, 2006
• Using mixed graph coloring to minimize total completion time in job shop scheduling
  Applied Mathematics and Computation, 2006
• A novel threshold accepting meta-heuristic for the job-shop scheduling problem
  Computers & Operations Research, 2004
• Job-shop scheduling with processing alternatives
  European Journal of Operational Research, 2003
• A fast and elitist multiobjective genetic algorithm: NSGA-II
  IEEE Transactions on Evolutionary Computation, 2002
• Scheduling in job shops with machine breakdowns: an experimental study
  Computers & Industrial Engineering, 1999
• Optimal schedule on a single machine using various due date determination methods
  Computers in Industry, 1990