Research of an Improved Genetic Algorithm for Job Shop Scheduling

Guo Hua Zhou

doi:10.4028/www.scientific.net/AMR.1078.417

Paper Titles

A Graph-Based Image Segmentation Algorithm
p.401

An Adaptive Image Segmentation Algorithm Based on AP Clustering
p.405

An Effective Approach to Migrate Application to Secure Cloud
p.409

The Realization of New Computing Model and System Research Related to Quantum Computer
p.413

Research of an Improved Genetic Algorithm for Job Shop Scheduling
p.417

An Application of Genetic Algorithms on the Synthesis Technique of Musical Instrument Tones
p.422

Using Particle Swarm Optimization Algorithm to Construction Detection and Node Management System in Wireless Sensor Network
p.426

Method of Data Processing Based on LaBVIEW
p.430

Data Processing with Mathematical Modeling for Research-Oriented Learning
p.435

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 1078Research of an Improved Genetic Algorithm for Job...

Research of an Improved Genetic Algorithm for Job Shop Scheduling

Abstract:

job shop scheduling is one of the most difficult NP-hard combinatorial optimize problems, in order to solve this problem, an improved Genetic Algorithm with three- dimensional coded model was put forward in this paper. In this model, the gene was coded with 3-D space, and self-adapting plot was drawn into conventional GA, then the probability of crossover and mutation can automatic adjust by fit degree. The instance shows that this algorithmic is effective to solve job shop scheduling problem.

You might also be interested in these eBooks

Advanced Research in Material Engineering, Machinery and Applied Technologies

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 1078)

Pages:

417-421

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.1078.417

Citation:

Cite this paper

Online since:

December 2014

Authors:

Guo Hua Zhou*

Keywords:

Genetic Algotithm, Job Shop Scheduling, Self-Adapting Formatting, Three-Dimensional Coded Model

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Arora JS, Huang M W, Hsieh CC. Methods for optimization of nonlinear problems with discrete variables: a review[J]. Opt., 1994, 8: 69-85.

Google Scholar

[2] Nakano R, Yamada T, Conventional genetic algorithms for job-shop problems, Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, 1991, p.477–479.

Google Scholar

[3] Yamada T, Nakano R, A genetic algorithm applicable to large-scale job shop problems, Parallel problem solving from nature: PPSN II, Elsevier Science, North-Holland, 1992, p.281–290.

Google Scholar

[4] Fang H, Ross P, Corne D, A promising genetic algorithm approach to job shop scheduling, rescheduling and open shop scheduling, Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann, San Mateo, CA, 1993, p.375.

DOI: 10.1109/icnc.2009.609

Google Scholar

[5] Gen M, Tsujimura J, Kubota E, Solving job-shop scheduling problem using genetic algorithms, Proceedings of the 16th International Conference on Computers and Industrial Engineering, Ashikaga, Japan, 1994, p.576–579.

Google Scholar

[6] Liu G R, Han X. Computational Inverse Techniques in Nondestructive Evaluation[M]. New York, CNC Press, (2003).

Google Scholar

[7] Michael Pinedo, Scheduling: theory, algorithms and systems, New Jersey, Prentice Hall, (2001).

Google Scholar

[8] Storer R H, Wu SD, Vaccari R, New search spaces for sequencing problems with applications to job-shop scheduling, Management Science 38(10), 1992, pp.1495-1509.

DOI: 10.1287/mnsc.38.10.1495

Google Scholar