A Hybrid Genetic Algorithm for Solving a Type of Scheduling Problem

Meng Lan Wang

doi:10.4028/www.scientific.net/AMM.380-384.1710

Paper Titles

Research on Ramanujan-FMT Modulation and the Efficient Implementation Algorithm
p.1693

A Clustering Method Based on K-Means Algorithm
p.1697

A Frequent Item Sets Computing Algorithm Based on MapReduce
p.1701

A New Image Segmentation Method Based on FCM and Ant Colony Algorithm
p.1705

A Hybrid Genetic Algorithm for Solving a Type of Scheduling Problem
p.1710

CFD-Based Calculation of Regular Transverse Wave Force in the Maneuvering Mathematical Modeling Group (MMG) Model
p.1716

Dynamic-Performance-Improved Algorithm for 14 Bits 200MHz Current-Steering DAC
p.1721

Research on Propagation Numerical Simulation of Blast Shock Waves in Subway Station
p.1725

Model of a Traffic Circle
p.1729

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 380-384A Hybrid Genetic Algorithm for Solving a Type of...

A Hybrid Genetic Algorithm for Solving a Type of Scheduling Problem

Abstract:

Genetic algorithm is the most widely used and successful bionic optimization algorithm. In this paper we will discuss the tasks scheduling problem on equipments, establish a general mathematical model and put forward a hybrid genetic algorithm to solve this problem. The simulation results show the effectiveness of the hybrid genetic algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 380-384)

Pages:

1710-1715

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.380-384.1710

Citation:

Cite this paper

Online since:

August 2013

Authors:

Meng Lan Wang

Keywords:

GA, Hybrid Genetic Algorithm, Sequencing Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Holland J. H, Adaptation in Nature and Artificial Systems. MIT Press, (1992).

Google Scholar

[2] Mitchell, M, An Introduction to Genetic Algorithms. Cambridge, MA: The MIT Press, (1991).

Google Scholar

[3] Srinivas. M and Patnaik. L, Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE Transactions on System, Man and Cybernetics, 1994, vol. 24, no. 4, p.656–667.

DOI: 10.1109/21.286385

Google Scholar

[4] A. H. G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague, (1976).

Google Scholar

[5] E Falkenauer, S Buffouix, A genetic algorithm for Job Shop, Proc. of the 1991 IEEE Int. Conf. on Robotics and Automation, 1991, p.824–829.

DOI: 10.1109/robot.1991.131689

Google Scholar

[6] Conway R W, Theory of Scheduling. Reading Mass. Addison—Wesley, (1967).

Google Scholar

[7] French S, Sequencing and Scheduling: An introduction to the mathematics of the Job—Shop. New York: Wisley, (1982).

Google Scholar

[8] Huang, DeCai, The general model for a type of sequencing problem and its optimal solution, " System Engineer, s theory and Practice, volume 9, pp.27-30, (1997).

Google Scholar