A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop

Hybrid flow shop scheduling problem has been extensively considered in single factory; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP wi...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2021-09, Vol.59 (18), p.5404-5421
Main Authors: Cai, Jingcao, Lei, Deming, Li, Ming
Format: Article
Language:English
Subjects:
Algorithms
distributed scheduling
Hybrid flow shop
Industrial plants
Job shop scheduling
memeplex quality
multi-objective optimisation
Search process
shuffled frog-leaping algorithm
Citations: Items that this one cites
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-c395t-d6d26c15671dbbbbb1e0d50678925e1f6aeca6caedb94273da4affb8622cfbe73
cites cdi_FETCH-LOGICAL-c395t-d6d26c15671dbbbbb1e0d50678925e1f6aeca6caedb94273da4affb8622cfbe73
container_end_page 5421
container_issue 18
container_start_page 5404
container_title International journal of production research
container_volume 59
creator Cai, Jingcao
Lei, Deming
Li, Ming
description Hybrid flow shop scheduling problem has been extensively considered in single factory; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP with sequence-dependent setup times is considered, in which factory assignment and machine assignment of first stage are integrated together. A new shuffled frog-leaping algorithm with memeplex quality (MQSFLA) is proposed to minimise total tardiness and makespan simultaneously. Solution quality of memeplex is measured and new search process is implemented according to solution quality. Evolution quality is evaluated for each memeplex and adopted for dynamically selecting memeplexes in a novel memeplex shuffling. A number of experiments are conducted to test the new strategies and performances of MQSFLA. The computational results demonstrate the effectiveness of the new strategies and the promising advantages of MQSFLA.
doi_str_mv 10.1080/00207543.2020.1780333
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1080_00207543_2020_1780333</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2770810524</sourcerecordid><originalsourceid>FETCH-LOGICAL-c395t-d6d26c15671dbbbbb1e0d50678925e1f6aeca6caedb94273da4affb8622cfbe73</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKs_QQh43pqPTXZ7U8QvELwoeAvZfLQp2c022bX235ul9eocZubwzjPwAHCN0QKjGt0iRFDFSrogeVngqkaU0hMww5TzgtX11ymYTZliCp2Di5Q2KBeryxlI9zCtR2u90dDGsCq8kb3rVlD6VYhuWLdwlztsTWt6b37gdpTeDXtoQ4SNK0KzMWpw3wZql4bomnHIpKTWRo9-4rgOrvdNdBnvwy4_C_0lOLPSJ3N1nHPw-fT48fBSvL0_vz7cvxWKLtlQaK4JV5jxCutmKmyQZohX9ZIwgy2XRkmupNHNsiQV1bKU1jY1J0TZxlR0Dm4O3D6G7WjSIDZhjF1-KUhVoRojRsqcYoeUiiGlaKzoo2tl3AuMxORX_PkVk19x9Jvv7g53rssuWrkL0WsxyL0P0UbZKZcE_R_xCxSrhM0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2770810524</pqid></control><display><type>article</type><title>A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop</title><source>Business Source Ultimate【Trial: -2024/12/31】【Remote access available】</source><source>Taylor and Francis Science and Technology Collection</source><creator>Cai, Jingcao ; Lei, Deming ; Li, Ming</creator><creatorcontrib>Cai, Jingcao ; Lei, Deming ; Li, Ming</creatorcontrib><description>Hybrid flow shop scheduling problem has been extensively considered in single factory; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP with sequence-dependent setup times is considered, in which factory assignment and machine assignment of first stage are integrated together. A new shuffled frog-leaping algorithm with memeplex quality (MQSFLA) is proposed to minimise total tardiness and makespan simultaneously. Solution quality of memeplex is measured and new search process is implemented according to solution quality. Evolution quality is evaluated for each memeplex and adopted for dynamically selecting memeplexes in a novel memeplex shuffling. A number of experiments are conducted to test the new strategies and performances of MQSFLA. The computational results demonstrate the effectiveness of the new strategies and the promising advantages of MQSFLA.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207543.2020.1780333</identifier><language>eng</language><publisher>London: Taylor &amp; Francis</publisher><subject>Algorithms ; distributed scheduling ; Hybrid flow shop ; Industrial plants ; Job shop scheduling ; memeplex quality ; multi-objective optimisation ; Search process ; shuffled frog-leaping algorithm</subject><ispartof>International journal of production research, 2021-09, Vol.59 (18), p.5404-5421</ispartof><rights>2020 Informa UK Limited, trading as Taylor &amp; Francis Group 2020</rights><rights>2020 Informa UK Limited, trading as Taylor &amp; Francis Group</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c395t-d6d26c15671dbbbbb1e0d50678925e1f6aeca6caedb94273da4affb8622cfbe73</citedby><cites>FETCH-LOGICAL-c395t-d6d26c15671dbbbbb1e0d50678925e1f6aeca6caedb94273da4affb8622cfbe73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Cai, Jingcao</creatorcontrib><creatorcontrib>Lei, Deming</creatorcontrib><creatorcontrib>Li, Ming</creatorcontrib><title>A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop</title><title>International journal of production research</title><description>Hybrid flow shop scheduling problem has been extensively considered in single factory; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP with sequence-dependent setup times is considered, in which factory assignment and machine assignment of first stage are integrated together. A new shuffled frog-leaping algorithm with memeplex quality (MQSFLA) is proposed to minimise total tardiness and makespan simultaneously. Solution quality of memeplex is measured and new search process is implemented according to solution quality. Evolution quality is evaluated for each memeplex and adopted for dynamically selecting memeplexes in a novel memeplex shuffling. A number of experiments are conducted to test the new strategies and performances of MQSFLA. The computational results demonstrate the effectiveness of the new strategies and the promising advantages of MQSFLA.</description><subject>Algorithms</subject><subject>distributed scheduling</subject><subject>Hybrid flow shop</subject><subject>Industrial plants</subject><subject>Job shop scheduling</subject><subject>memeplex quality</subject><subject>multi-objective optimisation</subject><subject>Search process</subject><subject>shuffled frog-leaping algorithm</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKs_QQh43pqPTXZ7U8QvELwoeAvZfLQp2c022bX235ul9eocZubwzjPwAHCN0QKjGt0iRFDFSrogeVngqkaU0hMww5TzgtX11ymYTZliCp2Di5Q2KBeryxlI9zCtR2u90dDGsCq8kb3rVlD6VYhuWLdwlztsTWt6b37gdpTeDXtoQ4SNK0KzMWpw3wZql4bomnHIpKTWRo9-4rgOrvdNdBnvwy4_C_0lOLPSJ3N1nHPw-fT48fBSvL0_vz7cvxWKLtlQaK4JV5jxCutmKmyQZohX9ZIwgy2XRkmupNHNsiQV1bKU1jY1J0TZxlR0Dm4O3D6G7WjSIDZhjF1-KUhVoRojRsqcYoeUiiGlaKzoo2tl3AuMxORX_PkVk19x9Jvv7g53rssuWrkL0WsxyL0P0UbZKZcE_R_xCxSrhM0</recordid><startdate>20210917</startdate><enddate>20210917</enddate><creator>Cai, Jingcao</creator><creator>Lei, Deming</creator><creator>Li, Ming</creator><general>Taylor &amp; Francis</general><general>Taylor &amp; Francis LLC</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20210917</creationdate><title>A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop</title><author>Cai, Jingcao ; Lei, Deming ; Li, Ming</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c395t-d6d26c15671dbbbbb1e0d50678925e1f6aeca6caedb94273da4affb8622cfbe73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>distributed scheduling</topic><topic>Hybrid flow shop</topic><topic>Industrial plants</topic><topic>Job shop scheduling</topic><topic>memeplex quality</topic><topic>multi-objective optimisation</topic><topic>Search process</topic><topic>shuffled frog-leaping algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cai, Jingcao</creatorcontrib><creatorcontrib>Lei, Deming</creatorcontrib><creatorcontrib>Li, Ming</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of production research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cai, Jingcao</au><au>Lei, Deming</au><au>Li, Ming</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop</atitle><jtitle>International journal of production research</jtitle><date>2021-09-17</date><risdate>2021</risdate><volume>59</volume><issue>18</issue><spage>5404</spage><epage>5421</epage><pages>5404-5421</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><abstract>Hybrid flow shop scheduling problem has been extensively considered in single factory; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP with sequence-dependent setup times is considered, in which factory assignment and machine assignment of first stage are integrated together. A new shuffled frog-leaping algorithm with memeplex quality (MQSFLA) is proposed to minimise total tardiness and makespan simultaneously. Solution quality of memeplex is measured and new search process is implemented according to solution quality. Evolution quality is evaluated for each memeplex and adopted for dynamically selecting memeplexes in a novel memeplex shuffling. A number of experiments are conducted to test the new strategies and performances of MQSFLA. The computational results demonstrate the effectiveness of the new strategies and the promising advantages of MQSFLA.</abstract><cop>London</cop><pub>Taylor &amp; Francis</pub><doi>10.1080/00207543.2020.1780333</doi><tpages>18</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0020-7543
ispartof International journal of production research, 2021-09, Vol.59 (18), p.5404-5421
issn 0020-7543
1366-588X
language eng
recordid cdi_crossref_primary_10_1080_00207543_2020_1780333
source Business Source Ultimate【Trial: -2024/12/31】【Remote access available】; Taylor and Francis Science and Technology Collection
subjects Algorithms
distributed scheduling
Hybrid flow shop
Industrial plants
Job shop scheduling
memeplex quality
multi-objective optimisation
Search process
shuffled frog-leaping algorithm
title A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T12%3A32%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20shuffled%20frog-leaping%20algorithm%20with%20memeplex%20quality%20for%20bi-objective%20distributed%20scheduling%20in%20hybrid%20flow%20shop&rft.jtitle=International%20journal%20of%20production%20research&rft.au=Cai,%20Jingcao&rft.date=2021-09-17&rft.volume=59&rft.issue=18&rft.spage=5404&rft.epage=5421&rft.pages=5404-5421&rft.issn=0020-7543&rft.eissn=1366-588X&rft_id=info:doi/10.1080/00207543.2020.1780333&rft_dat=%3Cproquest_cross%3E2770810524%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c395t-d6d26c15671dbbbbb1e0d50678925e1f6aeca6caedb94273da4affb8622cfbe73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2770810524&rft_id=info:pmid/&rfr_iscdi=true