A Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling

In order to optimize makespan and total tardiness for re-entrant hybrid flow shop scheduling problems simultaneously, this paper proposes a novel Shuffled Frog Leaping Algorithm. The algorithm relies on the lexicographic method to process total tardiness and makespan. A suitable crossover operator i...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2019-10, Vol.1314 (1), p.12126
Main Authors: Wang, Kun, Xu, Lamei, Lv, Cong
Format: Article
Language:English
Subjects:
Algorithms
Job shop scheduling
Job shops
Physics
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c3286-9df8c3c28ec1167451ad89a445b59e85699846ac9baa54d6f594c6cb612eff83
cites
container_end_page
container_issue 1
container_start_page 12126
container_title Journal of physics. Conference series
container_volume 1314
creator Wang, Kun
Xu, Lamei
Lv, Cong
description In order to optimize makespan and total tardiness for re-entrant hybrid flow shop scheduling problems simultaneously, this paper proposes a novel Shuffled Frog Leaping Algorithm. The algorithm relies on the lexicographic method to process total tardiness and makespan. A suitable crossover operator is introduced. During the searching process of memeplex, instead of worst solution, multiple best solutions are used to generate new solutions. Further with that, the process of generating random solution is replaced with the neighborhood search. Then as indicated by the simulation based on a group of instances, the novel SFLA is superior in addressing hybrid flow shop scheduling problem.
doi_str_mv 10.1088/1742-6596/1314/1/012126
format article
fullrecord <record><control><sourceid>proquest_iop_j</sourceid><recordid>TN_cdi_proquest_journals_2567961160</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2567961160</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3286-9df8c3c28ec1167451ad89a445b59e85699846ac9baa54d6f594c6cb612eff83</originalsourceid><addsrcrecordid>eNqFkFFLwzAUhYMoOKe_wYBvQm2SJmnyOIZzylCxew9pmriO2tS0U_bvbalMBMH7ci_c757DPQBcYnSDkRAxTimJOJM8xgmmMY4RJpjwIzA5bI4PsxCn4KxttwglfaUTkM7go_-wFcwWqxl0PsAXG9m6C7ru4HKfh7KAi8p_wmzjG5iZjS12VVm_noMTp6vWXnz3KVgvbtfzZbR6urufz1aRSYjgkSycMIkhwhqMeUoZ1oWQmlKWM2kF41IKyrWRudaMFtwxSQ03OcfEOieSKbgaZZvg33e27dTW70LdOyrCeCp5r4p6Kh0pE3zbButUE8o3HfYKIzWEpIb31RCFGkJSWI0h9ZfX42Xpmx_ph-d59htUTeF6OPkD_s_iC5RKc-k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2567961160</pqid></control><display><type>article</type><title>A Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><source>Full-Text Journals in Chemistry (Open access)</source><creator>Wang, Kun ; Xu, Lamei ; Lv, Cong</creator><creatorcontrib>Wang, Kun ; Xu, Lamei ; Lv, Cong</creatorcontrib><description>In order to optimize makespan and total tardiness for re-entrant hybrid flow shop scheduling problems simultaneously, this paper proposes a novel Shuffled Frog Leaping Algorithm. The algorithm relies on the lexicographic method to process total tardiness and makespan. A suitable crossover operator is introduced. During the searching process of memeplex, instead of worst solution, multiple best solutions are used to generate new solutions. Further with that, the process of generating random solution is replaced with the neighborhood search. Then as indicated by the simulation based on a group of instances, the novel SFLA is superior in addressing hybrid flow shop scheduling problem.</description><identifier>ISSN: 1742-6588</identifier><identifier>EISSN: 1742-6596</identifier><identifier>DOI: 10.1088/1742-6596/1314/1/012126</identifier><language>eng</language><publisher>Bristol: IOP Publishing</publisher><subject>Algorithms ; Job shop scheduling ; Job shops ; Physics</subject><ispartof>Journal of physics. Conference series, 2019-10, Vol.1314 (1), p.12126</ispartof><rights>Published under licence by IOP Publishing Ltd</rights><rights>2019. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3286-9df8c3c28ec1167451ad89a445b59e85699846ac9baa54d6f594c6cb612eff83</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2567961160?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,25753,27924,27925,37012,44590</link.rule.ids></links><search><creatorcontrib>Wang, Kun</creatorcontrib><creatorcontrib>Xu, Lamei</creatorcontrib><creatorcontrib>Lv, Cong</creatorcontrib><title>A Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling</title><title>Journal of physics. Conference series</title><addtitle>J. Phys.: Conf. Ser</addtitle><description>In order to optimize makespan and total tardiness for re-entrant hybrid flow shop scheduling problems simultaneously, this paper proposes a novel Shuffled Frog Leaping Algorithm. The algorithm relies on the lexicographic method to process total tardiness and makespan. A suitable crossover operator is introduced. During the searching process of memeplex, instead of worst solution, multiple best solutions are used to generate new solutions. Further with that, the process of generating random solution is replaced with the neighborhood search. Then as indicated by the simulation based on a group of instances, the novel SFLA is superior in addressing hybrid flow shop scheduling problem.</description><subject>Algorithms</subject><subject>Job shop scheduling</subject><subject>Job shops</subject><subject>Physics</subject><issn>1742-6588</issn><issn>1742-6596</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqFkFFLwzAUhYMoOKe_wYBvQm2SJmnyOIZzylCxew9pmriO2tS0U_bvbalMBMH7ci_c757DPQBcYnSDkRAxTimJOJM8xgmmMY4RJpjwIzA5bI4PsxCn4KxttwglfaUTkM7go_-wFcwWqxl0PsAXG9m6C7ru4HKfh7KAi8p_wmzjG5iZjS12VVm_noMTp6vWXnz3KVgvbtfzZbR6urufz1aRSYjgkSycMIkhwhqMeUoZ1oWQmlKWM2kF41IKyrWRudaMFtwxSQ03OcfEOieSKbgaZZvg33e27dTW70LdOyrCeCp5r4p6Kh0pE3zbButUE8o3HfYKIzWEpIb31RCFGkJSWI0h9ZfX42Xpmx_ph-d59htUTeF6OPkD_s_iC5RKc-k</recordid><startdate>20191001</startdate><enddate>20191001</enddate><creator>Wang, Kun</creator><creator>Xu, Lamei</creator><creator>Lv, Cong</creator><general>IOP Publishing</general><scope>O3W</scope><scope>TSCCA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>L7M</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20191001</creationdate><title>A Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling</title><author>Wang, Kun ; Xu, Lamei ; Lv, Cong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3286-9df8c3c28ec1167451ad89a445b59e85699846ac9baa54d6f594c6cb612eff83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Job shop scheduling</topic><topic>Job shops</topic><topic>Physics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Kun</creatorcontrib><creatorcontrib>Xu, Lamei</creatorcontrib><creatorcontrib>Lv, Cong</creatorcontrib><collection>Open Access: IOP Publishing Free Content</collection><collection>IOPscience (Open Access)</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Aerospace Database</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>Journal of physics. Conference series</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Kun</au><au>Xu, Lamei</au><au>Lv, Cong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling</atitle><jtitle>Journal of physics. Conference series</jtitle><addtitle>J. Phys.: Conf. Ser</addtitle><date>2019-10-01</date><risdate>2019</risdate><volume>1314</volume><issue>1</issue><spage>12126</spage><pages>12126-</pages><issn>1742-6588</issn><eissn>1742-6596</eissn><abstract>In order to optimize makespan and total tardiness for re-entrant hybrid flow shop scheduling problems simultaneously, this paper proposes a novel Shuffled Frog Leaping Algorithm. The algorithm relies on the lexicographic method to process total tardiness and makespan. A suitable crossover operator is introduced. During the searching process of memeplex, instead of worst solution, multiple best solutions are used to generate new solutions. Further with that, the process of generating random solution is replaced with the neighborhood search. Then as indicated by the simulation based on a group of instances, the novel SFLA is superior in addressing hybrid flow shop scheduling problem.</abstract><cop>Bristol</cop><pub>IOP Publishing</pub><doi>10.1088/1742-6596/1314/1/012126</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1742-6588
ispartof Journal of physics. Conference series, 2019-10, Vol.1314 (1), p.12126
issn 1742-6588
1742-6596
language eng
recordid cdi_proquest_journals_2567961160
source Publicly Available Content Database (Proquest) (PQ_SDU_P3); Full-Text Journals in Chemistry (Open access)
subjects Algorithms
Job shop scheduling
Job shops
Physics
title A Novel SFLA for Re-entrant Hybrid Flow Shop Scheduling
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T15%3A54%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_iop_j&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Novel%20SFLA%20for%20Re-entrant%20Hybrid%20Flow%20Shop%20Scheduling&rft.jtitle=Journal%20of%20physics.%20Conference%20series&rft.au=Wang,%20Kun&rft.date=2019-10-01&rft.volume=1314&rft.issue=1&rft.spage=12126&rft.pages=12126-&rft.issn=1742-6588&rft.eissn=1742-6596&rft_id=info:doi/10.1088/1742-6596/1314/1/012126&rft_dat=%3Cproquest_iop_j%3E2567961160%3C/proquest_iop_j%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c3286-9df8c3c28ec1167451ad89a445b59e85699846ac9baa54d6f594c6cb612eff83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2567961160&rft_id=info:pmid/&rfr_iscdi=true