Research and Applications of Shop Scheduling Based on Genetic Algorithms
ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Instituto de Tecnologia do Paraná (Tecpar)
|
| Series: | Brazilian Archives of Biology and Technology |
| Subjects: | |
| Online Access: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132016000200601&lng=en&tlng=en |
| _version_ | 1817979487479922688 |
|---|---|
| author | Hang ZHAO Fansen KONG |
| author_facet | Hang ZHAO Fansen KONG |
| author_sort | Hang ZHAO |
| collection | DOAJ |
| description | ABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence. |
| first_indexed | 2024-04-13T22:43:23Z |
| format | Article |
| id | doaj.art-16f504ece891470f9f558caeb399af0e |
| institution | Directory Open Access Journal |
| issn | 1678-4324 |
| language | English |
| last_indexed | 2024-04-13T22:43:23Z |
| publisher | Instituto de Tecnologia do Paraná (Tecpar) |
| record_format | Article |
| series | Brazilian Archives of Biology and Technology |
| spelling | doaj.art-16f504ece891470f9f558caeb399af0e2022-12-22T02:26:31ZengInstituto de Tecnologia do Paraná (Tecpar)Brazilian Archives of Biology and Technology1678-432459spe10.1590/1678-4324-2016160545S1516-89132016000200601Research and Applications of Shop Scheduling Based on Genetic AlgorithmsHang ZHAOFansen KONGABSTRACT Shop Scheduling is an important factor affecting the efficiency of production, efficient scheduling method and a research and application for optimization technology play an important role for manufacturing enterprises to improve production efficiency, reduce production costs and many other aspects. Existing studies have shown that improved genetic algorithm has solved the limitations that existed in the genetic algorithm, the objective function is able to meet customers' needs for shop scheduling, and the future research should focus on the combination of genetic algorithm with other optimized algorithms. In this paper, in order to overcome the shortcomings of early convergence of genetic algorithm and resolve local minimization problem in search process,aiming at mixed flow shop scheduling problem, an improved cyclic search genetic algorithm is put forward, and chromosome coding method and corresponding operation are given.The operation has the nature of inheriting the optimal individual ofthe previous generation and is able to avoid the emergence of local minimum, and cyclic and crossover operation and mutation operation can enhance the diversity of the population and then quickly get the optimal individual, and the effectiveness of the algorithm is validated. Experimental results show that the improved algorithm can well avoid the emergency of local minimum and is rapid in convergence.http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132016000200601&lng=en&tlng=enshop schedulinggenetic algorithmlocal minimizationcyclic search |
| spellingShingle | Hang ZHAO Fansen KONG Research and Applications of Shop Scheduling Based on Genetic Algorithms Brazilian Archives of Biology and Technology shop scheduling genetic algorithm local minimization cyclic search |
| title | Research and Applications of Shop Scheduling Based on Genetic Algorithms |
| title_full | Research and Applications of Shop Scheduling Based on Genetic Algorithms |
| title_fullStr | Research and Applications of Shop Scheduling Based on Genetic Algorithms |
| title_full_unstemmed | Research and Applications of Shop Scheduling Based on Genetic Algorithms |
| title_short | Research and Applications of Shop Scheduling Based on Genetic Algorithms |
| title_sort | research and applications of shop scheduling based on genetic algorithms |
| topic | shop scheduling genetic algorithm local minimization cyclic search |
| url | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132016000200601&lng=en&tlng=en |
| work_keys_str_mv | AT hangzhao researchandapplicationsofshopschedulingbasedongeneticalgorithms AT fansenkong researchandapplicationsofshopschedulingbasedongeneticalgorithms |