A New Hybrid Optimization Algorithm and its Application in Job Shop Scheduling

Abstract:

Article Preview

In this paper, a dual-resource constrained job shop scheduling problem was studied by designing a hybrid genetic algorithm based on Genetic Algorithm (GA) and Simulated Annealing (SA). GA is used to search for a group of better solutions to the problem of minimizing production cost and then SA is applied to searching them for the best one. The combination of GA and SA utilizes the advantages of the two algorithms and overcomes their disadvantages. The operation-based encoding and an active schedule decoding method were employed. This hybrid genetic algorithm reasonably assigns the resources of machines and workers to jobs and achieves optimum on some performance. The results of numerical simulations, which are compared with those of other well-known algorithms, show better performance of the proposed algorithm.

Info:

Periodical:

Edited by:

Qi Luo

Pages:

1789-1793

DOI:

10.4028/www.scientific.net/AMM.55-57.1789

Citation:

X. Z. Cao and Z. H. Yang, "A New Hybrid Optimization Algorithm and its Application in Job Shop Scheduling", Applied Mechanics and Materials, Vols. 55-57, pp. 1789-1793, 2011

Online since:

May 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.