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...
Gespeichert in:
Veröffentlicht in: | Brazilian Archives of Biology and Technology 2016, Vol.59 (spe) |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | spe |
container_start_page | |
container_title | Brazilian Archives of Biology and Technology |
container_volume | 59 |
creator | ZHAO, Hang KONG, Fansen |
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. |
doi_str_mv | 10.1590/1678-4324-2016160545 |
format | Article |
fullrecord | <record><control><sourceid>doaj_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1590_1678_4324_2016160545</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_16f504ece891470f9f558caeb399af0e</doaj_id><sourcerecordid>oai_doaj_org_article_16f504ece891470f9f558caeb399af0e</sourcerecordid><originalsourceid>FETCH-LOGICAL-c402t-513f5975e3fe6d5b9eaa6f18d34a8b8f35aaca5e117086c7c40f70b7452df13</originalsourceid><addsrcrecordid>eNpNkN1Kw0AQRhdRsFbfwIt9gehO9ifJZS3aFgqC9X6ZbGablDQbsvHCtze1ol7NMDCH7zuM3YN4AF2IRzBZniiZqiQVYMAIrfQFm4EGk-QFyMt_-zW7ifEgBCgDasbWbxQJB1dz7Cq-6Pu2cTg2oYs8eL6rQ893rqbqo226PX_CSBUPHV9RR2Pj-KLdh6EZ62O8ZVce20h3P3POdi_P78t1sn1dbZaLbeKUSMdEg_S6yDRJT6bSZUGIxkNeSYV5mXupER1qAshEblw2fflMlJnSaeVBztnmTK0CHmw_NEccPm3Axn4fwrC3OEzBWrJgvBaKHE2tVSZ84bXOHVIpiwK9oImlziw3hBgH8r88EPbk1Z682pNX--dVfgHc5GrT</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Research and Applications of Shop Scheduling Based on Genetic Algorithms</title><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>ZHAO, Hang ; KONG, Fansen</creator><creatorcontrib>ZHAO, Hang ; KONG, Fansen</creatorcontrib><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.</description><identifier>ISSN: 1516-8913</identifier><identifier>ISSN: 1678-4324</identifier><identifier>EISSN: 1516-8913</identifier><identifier>DOI: 10.1590/1678-4324-2016160545</identifier><language>eng</language><publisher>Instituto de Tecnologia do Paraná (Tecpar)</publisher><subject>cyclic search ; genetic algorithm ; local minimization ; shop scheduling</subject><ispartof>Brazilian Archives of Biology and Technology, 2016, Vol.59 (spe)</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c402t-513f5975e3fe6d5b9eaa6f18d34a8b8f35aaca5e117086c7c40f70b7452df13</citedby><cites>FETCH-LOGICAL-c402t-513f5975e3fe6d5b9eaa6f18d34a8b8f35aaca5e117086c7c40f70b7452df13</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,861,4010,27904,27905,27906</link.rule.ids></links><search><creatorcontrib>ZHAO, Hang</creatorcontrib><creatorcontrib>KONG, Fansen</creatorcontrib><title>Research and Applications of Shop Scheduling Based on Genetic Algorithms</title><title>Brazilian Archives of Biology and Technology</title><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.</description><subject>cyclic search</subject><subject>genetic algorithm</subject><subject>local minimization</subject><subject>shop scheduling</subject><issn>1516-8913</issn><issn>1678-4324</issn><issn>1516-8913</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>DOA</sourceid><recordid>eNpNkN1Kw0AQRhdRsFbfwIt9gehO9ifJZS3aFgqC9X6ZbGablDQbsvHCtze1ol7NMDCH7zuM3YN4AF2IRzBZniiZqiQVYMAIrfQFm4EGk-QFyMt_-zW7ifEgBCgDasbWbxQJB1dz7Cq-6Pu2cTg2oYs8eL6rQ893rqbqo226PX_CSBUPHV9RR2Pj-KLdh6EZ62O8ZVce20h3P3POdi_P78t1sn1dbZaLbeKUSMdEg_S6yDRJT6bSZUGIxkNeSYV5mXupER1qAshEblw2fflMlJnSaeVBztnmTK0CHmw_NEccPm3Axn4fwrC3OEzBWrJgvBaKHE2tVSZ84bXOHVIpiwK9oImlziw3hBgH8r88EPbk1Z682pNX--dVfgHc5GrT</recordid><startdate>2016</startdate><enddate>2016</enddate><creator>ZHAO, Hang</creator><creator>KONG, Fansen</creator><general>Instituto de Tecnologia do Paraná (Tecpar)</general><scope>AAYXX</scope><scope>CITATION</scope><scope>DOA</scope></search><sort><creationdate>2016</creationdate><title>Research and Applications of Shop Scheduling Based on Genetic Algorithms</title><author>ZHAO, Hang ; KONG, Fansen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c402t-513f5975e3fe6d5b9eaa6f18d34a8b8f35aaca5e117086c7c40f70b7452df13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>cyclic search</topic><topic>genetic algorithm</topic><topic>local minimization</topic><topic>shop scheduling</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ZHAO, Hang</creatorcontrib><creatorcontrib>KONG, Fansen</creatorcontrib><collection>CrossRef</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Brazilian Archives of Biology and Technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ZHAO, Hang</au><au>KONG, Fansen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Research and Applications of Shop Scheduling Based on Genetic Algorithms</atitle><jtitle>Brazilian Archives of Biology and Technology</jtitle><date>2016</date><risdate>2016</risdate><volume>59</volume><issue>spe</issue><issn>1516-8913</issn><issn>1678-4324</issn><eissn>1516-8913</eissn><abstract>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.</abstract><pub>Instituto de Tecnologia do Paraná (Tecpar)</pub><doi>10.1590/1678-4324-2016160545</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1516-8913 |
ispartof | Brazilian Archives of Biology and Technology, 2016, Vol.59 (spe) |
issn | 1516-8913 1678-4324 1516-8913 |
language | eng |
recordid | cdi_crossref_primary_10_1590_1678_4324_2016160545 |
source | DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
subjects | cyclic search genetic algorithm local minimization shop scheduling |
title | Research and Applications of Shop Scheduling Based on Genetic Algorithms |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T09%3A26%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-doaj_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Research%20and%20Applications%20of%20Shop%20Scheduling%20Based%20on%20Genetic%20Algorithms&rft.jtitle=Brazilian%20Archives%20of%20Biology%20and%20Technology&rft.au=ZHAO,%20Hang&rft.date=2016&rft.volume=59&rft.issue=spe&rft.issn=1516-8913&rft.eissn=1516-8913&rft_id=info:doi/10.1590/1678-4324-2016160545&rft_dat=%3Cdoaj_cross%3Eoai_doaj_org_article_16f504ece891470f9f558caeb399af0e%3C/doaj_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_doaj_id=oai_doaj_org_article_16f504ece891470f9f558caeb399af0e&rfr_iscdi=true |