Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions

This article deals with the no-wait flowshop problem with sequence dependent set-ups and ready times solved by an evolutionary approach. The hybrid genetic algorithm presented here addresses a new hierarchically organized complete ternary tree to represent the population that put together with a rec...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2006-03, Vol.44 (5), p.939-957
Main Authors: FranÇa, P. M., Tin, G., Buriol, L. S.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Flowshop problem
Genetic algorithms
Heuristics
Machine scheduling
Memetic algorithms
No-wait flowshop
Operational research and scientific management
Operational research. Management science
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-c407t-85cfbda092130d9af81f017fd52b4327b4cf71609079c86abb2e9446457dc0663
cites cdi_FETCH-LOGICAL-c407t-85cfbda092130d9af81f017fd52b4327b4cf71609079c86abb2e9446457dc0663
container_end_page 957
container_issue 5
container_start_page 939
container_title International journal of production research
container_volume 44
creator FranÇa, P. M.
Tin, G.
Buriol, L. S.
description This article deals with the no-wait flowshop problem with sequence dependent set-ups and ready times solved by an evolutionary approach. The hybrid genetic algorithm presented here addresses a new hierarchically organized complete ternary tree to represent the population that put together with a recombination plan resembles a parallel processing scheme for solving combinatorial optimization problems. Embedded in the hybrid approach, a novel recursive local search scheme, recursive arc insertion (RAI), is also proposed. The effectiveness of the local search phase is crucial given that it is responsible for about 90% of the total processing time of the algorithm. Instances with known optimal solution are used to test the new algorithm and compare it to a previously proposed heuristic approach.
doi_str_mv 10.1080/00207540500282914
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1080_00207540500282914</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29294503</sourcerecordid><originalsourceid>FETCH-LOGICAL-c407t-85cfbda092130d9af81f017fd52b4327b4cf71609079c86abb2e9446457dc0663</originalsourceid><addsrcrecordid>eNqFkEFLAzEQhYMoWKs_wFsueludZLObXfAiolUoeLHgbclmkzaS3dQkpfbfm9KKhyLOJQN53-PNQ-iSwA2BCm4BKPCCQZGWitaEHaERycsyK6rq_RiNtv9ZEuSn6CyED0hTVGyEZhM1qGgkFnbuvImLPmDtPI4LhQeXrYWJWFu3Dgu3xEF9rtQgzTDHS-9aq3q8TgiOplfYqxC9kdG4IZyjEy1sUBf7d4xmT49vD8_Z9HXy8nA_zSQDHrOqkLrtBNSU5NDVQldEA-G6K2jLcspbJjUnJdTAa1mVom2pqhkrWcE7CWWZj9H1zjfFSdFCbHoTpLJWDMqtQkNrWrMC8iQkO6H0LgSvdLP0phd-0xBotgU2BwUm5mpvLoIUVnuRTg-_IGclZzlPOr7TmSE114u187ZrothY53-gA_cmfsVE3v1L5n8H_AZDo5XX</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29294503</pqid></control><display><type>article</type><title>Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions</title><source>EBSCOhost Business Source Ultimate</source><source>Taylor and Francis Science and Technology Collection</source><creator>FranÇa, P. M. ; Tin, G. ; Buriol, L. S.</creator><creatorcontrib>FranÇa, P. M. ; Tin, G. ; Buriol, L. S.</creatorcontrib><description>This article deals with the no-wait flowshop problem with sequence dependent set-ups and ready times solved by an evolutionary approach. The hybrid genetic algorithm presented here addresses a new hierarchically organized complete ternary tree to represent the population that put together with a recombination plan resembles a parallel processing scheme for solving combinatorial optimization problems. Embedded in the hybrid approach, a novel recursive local search scheme, recursive arc insertion (RAI), is also proposed. The effectiveness of the local search phase is crucial given that it is responsible for about 90% of the total processing time of the algorithm. Instances with known optimal solution are used to test the new algorithm and compare it to a previously proposed heuristic approach.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207540500282914</identifier><identifier>CODEN: IJPRB8</identifier><language>eng</language><publisher>London: Taylor &amp; Francis Group</publisher><subject>Applied sciences ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Flowshop problem ; Genetic algorithms ; Heuristics ; Machine scheduling ; Memetic algorithms ; No-wait flowshop ; Operational research and scientific management ; Operational research. Management science</subject><ispartof>International journal of production research, 2006-03, Vol.44 (5), p.939-957</ispartof><rights>Copyright Taylor &amp; Francis Group, LLC 2006</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c407t-85cfbda092130d9af81f017fd52b4327b4cf71609079c86abb2e9446457dc0663</citedby><cites>FETCH-LOGICAL-c407t-85cfbda092130d9af81f017fd52b4327b4cf71609079c86abb2e9446457dc0663</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><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=17467437$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>FranÇa, P. M.</creatorcontrib><creatorcontrib>Tin, G.</creatorcontrib><creatorcontrib>Buriol, L. S.</creatorcontrib><title>Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions</title><title>International journal of production research</title><description>This article deals with the no-wait flowshop problem with sequence dependent set-ups and ready times solved by an evolutionary approach. The hybrid genetic algorithm presented here addresses a new hierarchically organized complete ternary tree to represent the population that put together with a recombination plan resembles a parallel processing scheme for solving combinatorial optimization problems. Embedded in the hybrid approach, a novel recursive local search scheme, recursive arc insertion (RAI), is also proposed. The effectiveness of the local search phase is crucial given that it is responsible for about 90% of the total processing time of the algorithm. Instances with known optimal solution are used to test the new algorithm and compare it to a previously proposed heuristic approach.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Flowshop problem</subject><subject>Genetic algorithms</subject><subject>Heuristics</subject><subject>Machine scheduling</subject><subject>Memetic algorithms</subject><subject>No-wait flowshop</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNqFkEFLAzEQhYMoWKs_wFsueludZLObXfAiolUoeLHgbclmkzaS3dQkpfbfm9KKhyLOJQN53-PNQ-iSwA2BCm4BKPCCQZGWitaEHaERycsyK6rq_RiNtv9ZEuSn6CyED0hTVGyEZhM1qGgkFnbuvImLPmDtPI4LhQeXrYWJWFu3Dgu3xEF9rtQgzTDHS-9aq3q8TgiOplfYqxC9kdG4IZyjEy1sUBf7d4xmT49vD8_Z9HXy8nA_zSQDHrOqkLrtBNSU5NDVQldEA-G6K2jLcspbJjUnJdTAa1mVom2pqhkrWcE7CWWZj9H1zjfFSdFCbHoTpLJWDMqtQkNrWrMC8iQkO6H0LgSvdLP0phd-0xBotgU2BwUm5mpvLoIUVnuRTg-_IGclZzlPOr7TmSE114u187ZrothY53-gA_cmfsVE3v1L5n8H_AZDo5XX</recordid><startdate>20060301</startdate><enddate>20060301</enddate><creator>FranÇa, P. M.</creator><creator>Tin, G.</creator><creator>Buriol, L. S.</creator><general>Taylor &amp; Francis Group</general><general>Taylor &amp; Francis</general><scope>IQODW</scope><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>20060301</creationdate><title>Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions</title><author>FranÇa, P. M. ; Tin, G. ; Buriol, L. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c407t-85cfbda092130d9af81f017fd52b4327b4cf71609079c86abb2e9446457dc0663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Flowshop problem</topic><topic>Genetic algorithms</topic><topic>Heuristics</topic><topic>Machine scheduling</topic><topic>Memetic algorithms</topic><topic>No-wait flowshop</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>FranÇa, P. M.</creatorcontrib><creatorcontrib>Tin, G.</creatorcontrib><creatorcontrib>Buriol, L. S.</creatorcontrib><collection>Pascal-Francis</collection><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>FranÇa, P. M.</au><au>Tin, G.</au><au>Buriol, L. S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions</atitle><jtitle>International journal of production research</jtitle><date>2006-03-01</date><risdate>2006</risdate><volume>44</volume><issue>5</issue><spage>939</spage><epage>957</epage><pages>939-957</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><coden>IJPRB8</coden><abstract>This article deals with the no-wait flowshop problem with sequence dependent set-ups and ready times solved by an evolutionary approach. The hybrid genetic algorithm presented here addresses a new hierarchically organized complete ternary tree to represent the population that put together with a recombination plan resembles a parallel processing scheme for solving combinatorial optimization problems. Embedded in the hybrid approach, a novel recursive local search scheme, recursive arc insertion (RAI), is also proposed. The effectiveness of the local search phase is crucial given that it is responsible for about 90% of the total processing time of the algorithm. Instances with known optimal solution are used to test the new algorithm and compare it to a previously proposed heuristic approach.</abstract><cop>London</cop><cop>Washington, DC</cop><pub>Taylor &amp; Francis Group</pub><doi>10.1080/00207540500282914</doi><tpages>19</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0020-7543
ispartof International journal of production research, 2006-03, Vol.44 (5), p.939-957
issn 0020-7543
1366-588X
language eng
recordid cdi_crossref_primary_10_1080_00207540500282914
source EBSCOhost Business Source Ultimate; Taylor and Francis Science and Technology Collection
subjects Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Flowshop problem
Genetic algorithms
Heuristics
Machine scheduling
Memetic algorithms
No-wait flowshop
Operational research and scientific management
Operational research. Management science
title Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T22%3A50%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=Genetic%20algorithms%20for%20the%20no-wait%20flowshop%20sequencing%20problem%20with%20time%20restrictions&rft.jtitle=International%20journal%20of%20production%20research&rft.au=Fran%C3%87a,%20P.%20M.&rft.date=2006-03-01&rft.volume=44&rft.issue=5&rft.spage=939&rft.epage=957&rft.pages=939-957&rft.issn=0020-7543&rft.eissn=1366-588X&rft.coden=IJPRB8&rft_id=info:doi/10.1080/00207540500282914&rft_dat=%3Cproquest_cross%3E29294503%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c407t-85cfbda092130d9af81f017fd52b4327b4cf71609079c86abb2e9446457dc0663%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=29294503&rft_id=info:pmid/&rfr_iscdi=true