A new particle swarm optimization for multi-objective open shop scheduling

References

• Gonzalez , T. and Sahni , S. 1976 . Open shop scheduling to minimize fi nish time . Journal of the ACM , 23 : 665 – 79 .
   Web of Science ®Google Scholar
• Liaw , C.-F. 1999 . Applying simulated annealing to the open shop scheduling problem . IIE Transactions , 31 : 457 – 65 .
   Web of Science ®Google Scholar
• Liaw , C.-F. 1999 . A tabu search algorithm for the open shop scheduling problem . Computers & Operations Research , 26 : 109 – 26 .
   Web of Science ®Google Scholar
• Liaw , C.-F. 2000 . A hybrid genetic algorithm for the open shop scheduling problem . European Journal of Operational Research , 124 : 28 – 42 .
   Web of Science ®Google Scholar
• Blum , C. 2005 . Beam-ACO—Hybridizing ant colony optimization with beam search: an application to open shop scheduling . Computers & Operations Research , 32 : 1565 – 91 .
   Web of Science ®Google Scholar
• Prins , C. 2000 . Competitive genetic algorithms for the open-shop scheduling problem . Mathematical Methods of Operations Research , 52 : 389 – 411 .
   Web of Science ®Google Scholar
• Senthilkumar , P. and Shahbudeen , P. 2006 . GA based heuristic for the open job shop scheduling problem . International Journal of Advanced Manufacturing Technology , 30 : 297 – 301 .
   Web of Science ®Google Scholar
• Tang , L. and Bai , D. 2010 . A new heuristic for open shop total completion time problem . Applied Mathematical Modeling , 34 : 735 – 743 .
   Web of Science ®Google Scholar
• Liaw , C.-F. 2005 . Scheduling preemptive open shops to minimize total tardiness . European Journal of Operational Research , 162 : 173 – 183 .
   Web of Science ®Google Scholar
• Bllzewicz , J. , Pesch , E. , Sterna , M. and Werner , F. 2004 . Open shop scheduling problems with late work criteria . Discrete Applied Mathematics , 134 : 1 – 24 .
   Google Scholar
• Kennedy , J and Eberhart , R.C. “Particle swarm optimization,” . Proceedings of the 1995 IEEE International Conference on Neural Networks , pp. 1942 – 8 . New Jersey : IEEE Press .
   Google Scholar
• Giffler , J and Thompson , G.L. 1960 . Algorithms for solving production scheduling problems . Operations Research , 8 : 487 – 503 .
   Web of Science ®Google Scholar
• Zhang , H. , Li , H. and Tam , C.M. 2006 . Particle swarm optimization for resource- constrained project scheduling . International Journal of Project Management , 24 : 83 – 92 .
   Google Scholar
• Sha , D.Y. and Hsu , C.-Y. 2008 . A new particle swarm optimization for the open shop scheduling problem . Computers & Operations Research , 35 : 3243 – 3261 .
   Web of Science ®Google Scholar
• Guéret , C. and Prins , C. 1999 . A new lower bound for the open-shop problem . Annals of Operations Research , 92 : 165 – 183 .
   Web of Science ®Google Scholar