An efficient job-shop scheduling algorithm based on particle swarm optimization

doi:10.1016/j.eswa.2009.08.015

An efficient job-shop scheduling algorithm based on particle swarm optimization

2010-03-15

158

PRE

AI

DOI：10.1016/j.eswa.2009.08.015

原文链接

原文求助

摘要

En 中文

The job-shop scheduling problem has attracted many researchers' attention in the past few decades, and many algorithms based on heuristic algorithms, genetic algorithms, and particle swarm optimization algorithms have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. In this paper, a new hybrid swarm intelligence algorithm consists of particle swarm optimization, simulated annealing technique and multi-type individual enhancement scheme is presented to solve the job-shop scheduling problem. The experimental results show that the new proposed job-shop scheduling algorithm is more robust and efficient than the existing algorithms. (C) 2009 Elsevier Ltd. All rights reserved.

Keyword:

Job-shop scheduling problem

Particle swarm optimization

Multi-type individual enhancement scheme

Random-key encoding scheme

Simulated annealing

An efficient job-shop scheduling algorithm based on particle swarm optimization

摘要

AI总结

期刊

机构

引用论文