Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The propertie...
Gespeichert in:
Veröffentlicht in: | European journal of operational research 2010-10, Vol.206 (1), p.64-72 |
---|---|
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 | 72 |
---|---|
container_issue | 1 |
container_start_page | 64 |
container_title | European journal of operational research |
container_volume | 206 |
creator | Wang, Chuyang Li, Xiaoping Wang, Qian |
description | For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The properties reduce the time to evaluate a candidate from
O
(
nm
)
to
O(1) and simplify the implementation of the heuristics based on the basic operations by evaluating candidates before their generation. The properties also reduce from
O
(
n
3
m
)
to
O
(
n
2
)
the time complexity of well-known NEH heuristic and the complete evaluation of the insertion and exchange neighborhoods. Tabu search (TS) is applied to the considered problem, since TS tries to find the best neighbor of the current solution in each iteration and therefore can much benefit from the speedups. Three different ways to use insertion and exchange neighborhoods are compared in TS. Computational experiments show that the speedups are more helpful as job number increases and all proposed TS algorithms are more effective and robust than the existing algorithms. Although two- and single-neighborhood TS algorithms are not significantly different, two-neighborhood TS algorithms are more preferable. |
doi_str_mv | 10.1016/j.ejor.2010.02.014 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204148680</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221710001190</els_id><sourcerecordid>2004689631</sourcerecordid><originalsourceid>FETCH-LOGICAL-c454t-ce261df83198e4abd43868b4c7af04bc3ff0b4150d4e8dad70af151017a466513</originalsourceid><addsrcrecordid>eNp9UMFq3DAUFKWBbpP8QE-i0KO3T7IsO9BLCE0bCOTSnoUsP9UytuVKdrb5-7zthhwjGD0hZkajYeyTgL0Aob8Oexxi2kugC5B7EOod24mmloVuNLxnOyjrupBS1B_Yx5wHABCVqHbMXDuHIya7YsdX2248o02u5z4mPsfiYMPK_RgPuY8Lz67HbhvD_IcvKbYjTvwQ1p5P9l-YtomPZDNjztylsGIKcb5gZ96OGS9f5jn7ffv9183P4v7hx93N9X3hVKXWwqHUovNNKa4aVLbtVNnoplWuth5U60rvoVWigk5h09muBuvpAyBqq7SuRHnOPp98KdffDfNqhrilmZ40EpRQ5AZEkieSSzHnhN4sKUw2PRkB5tijGcyxR3Ps0YA01COJ7k6ihAu6VwXSIipm82hKK0HT_vT_RNLSBoIgLAStTC1Nv07k9eUlpc3Ojj7Z2YX86imlllcSSuJ9O_GQKnsMmEx2AWeHXUjoVtPF8FbkZxaqotc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204148680</pqid></control><display><type>article</type><title>Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Wang, Chuyang ; Li, Xiaoping ; Wang, Qian</creator><creatorcontrib>Wang, Chuyang ; Li, Xiaoping ; Wang, Qian</creatorcontrib><description>For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The properties reduce the time to evaluate a candidate from
O
(
nm
)
to
O(1) and simplify the implementation of the heuristics based on the basic operations by evaluating candidates before their generation. The properties also reduce from
O
(
n
3
m
)
to
O
(
n
2
)
the time complexity of well-known NEH heuristic and the complete evaluation of the insertion and exchange neighborhoods. Tabu search (TS) is applied to the considered problem, since TS tries to find the best neighbor of the current solution in each iteration and therefore can much benefit from the speedups. Three different ways to use insertion and exchange neighborhoods are compared in TS. Computational experiments show that the speedups are more helpful as job number increases and all proposed TS algorithms are more effective and robust than the existing algorithms. Although two- and single-neighborhood TS algorithms are not significantly different, two-neighborhood TS algorithms are more preferable.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2010.02.014</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Exact sciences and technology ; Flowcharts ; Heuristic ; Job shops ; Maximum lateness ; Neighborhood ; Neighborhoods ; No-wait flowshop ; Operational research and scientific management ; Operational research. Management science ; Optimization algorithms ; Production scheduling ; Scheduling ; Scheduling No-wait flowshop Maximum lateness Tabu search Neighborhood ; Scheduling, sequencing ; Studies ; Tabu search</subject><ispartof>European journal of operational research, 2010-10, Vol.206 (1), p.64-72</ispartof><rights>2010 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Oct 1, 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c454t-ce261df83198e4abd43868b4c7af04bc3ff0b4150d4e8dad70af151017a466513</citedby><cites>FETCH-LOGICAL-c454t-ce261df83198e4abd43868b4c7af04bc3ff0b4150d4e8dad70af151017a466513</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0377221710001190$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,3993,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22629203$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a206_3ay_3a2010_3ai_3a1_3ap_3a64-72.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Wang, Chuyang</creatorcontrib><creatorcontrib>Li, Xiaoping</creatorcontrib><creatorcontrib>Wang, Qian</creatorcontrib><title>Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion</title><title>European journal of operational research</title><description>For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The properties reduce the time to evaluate a candidate from
O
(
nm
)
to
O(1) and simplify the implementation of the heuristics based on the basic operations by evaluating candidates before their generation. The properties also reduce from
O
(
n
3
m
)
to
O
(
n
2
)
the time complexity of well-known NEH heuristic and the complete evaluation of the insertion and exchange neighborhoods. Tabu search (TS) is applied to the considered problem, since TS tries to find the best neighbor of the current solution in each iteration and therefore can much benefit from the speedups. Three different ways to use insertion and exchange neighborhoods are compared in TS. Computational experiments show that the speedups are more helpful as job number increases and all proposed TS algorithms are more effective and robust than the existing algorithms. Although two- and single-neighborhood TS algorithms are not significantly different, two-neighborhood TS algorithms are more preferable.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Flowcharts</subject><subject>Heuristic</subject><subject>Job shops</subject><subject>Maximum lateness</subject><subject>Neighborhood</subject><subject>Neighborhoods</subject><subject>No-wait flowshop</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization algorithms</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Scheduling No-wait flowshop Maximum lateness Tabu search Neighborhood</subject><subject>Scheduling, sequencing</subject><subject>Studies</subject><subject>Tabu search</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9UMFq3DAUFKWBbpP8QE-i0KO3T7IsO9BLCE0bCOTSnoUsP9UytuVKdrb5-7zthhwjGD0hZkajYeyTgL0Aob8Oexxi2kugC5B7EOod24mmloVuNLxnOyjrupBS1B_Yx5wHABCVqHbMXDuHIya7YsdX2248o02u5z4mPsfiYMPK_RgPuY8Lz67HbhvD_IcvKbYjTvwQ1p5P9l-YtomPZDNjztylsGIKcb5gZ96OGS9f5jn7ffv9183P4v7hx93N9X3hVKXWwqHUovNNKa4aVLbtVNnoplWuth5U60rvoVWigk5h09muBuvpAyBqq7SuRHnOPp98KdffDfNqhrilmZ40EpRQ5AZEkieSSzHnhN4sKUw2PRkB5tijGcyxR3Ps0YA01COJ7k6ihAu6VwXSIipm82hKK0HT_vT_RNLSBoIgLAStTC1Nv07k9eUlpc3Ojj7Z2YX86imlllcSSuJ9O_GQKnsMmEx2AWeHXUjoVtPF8FbkZxaqotc</recordid><startdate>20101001</startdate><enddate>20101001</enddate><creator>Wang, Chuyang</creator><creator>Li, Xiaoping</creator><creator>Wang, Qian</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20101001</creationdate><title>Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion</title><author>Wang, Chuyang ; Li, Xiaoping ; Wang, Qian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c454t-ce261df83198e4abd43868b4c7af04bc3ff0b4150d4e8dad70af151017a466513</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Flowcharts</topic><topic>Heuristic</topic><topic>Job shops</topic><topic>Maximum lateness</topic><topic>Neighborhood</topic><topic>Neighborhoods</topic><topic>No-wait flowshop</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization algorithms</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Scheduling No-wait flowshop Maximum lateness Tabu search Neighborhood</topic><topic>Scheduling, sequencing</topic><topic>Studies</topic><topic>Tabu search</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Chuyang</creatorcontrib><creatorcontrib>Li, Xiaoping</creatorcontrib><creatorcontrib>Wang, Qian</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</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>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Chuyang</au><au>Li, Xiaoping</au><au>Wang, Qian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion</atitle><jtitle>European journal of operational research</jtitle><date>2010-10-01</date><risdate>2010</risdate><volume>206</volume><issue>1</issue><spage>64</spage><epage>72</epage><pages>64-72</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The properties reduce the time to evaluate a candidate from
O
(
nm
)
to
O(1) and simplify the implementation of the heuristics based on the basic operations by evaluating candidates before their generation. The properties also reduce from
O
(
n
3
m
)
to
O
(
n
2
)
the time complexity of well-known NEH heuristic and the complete evaluation of the insertion and exchange neighborhoods. Tabu search (TS) is applied to the considered problem, since TS tries to find the best neighbor of the current solution in each iteration and therefore can much benefit from the speedups. Three different ways to use insertion and exchange neighborhoods are compared in TS. Computational experiments show that the speedups are more helpful as job number increases and all proposed TS algorithms are more effective and robust than the existing algorithms. Although two- and single-neighborhood TS algorithms are not significantly different, two-neighborhood TS algorithms are more preferable.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2010.02.014</doi><tpages>9</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0377-2217 |
ispartof | European journal of operational research, 2010-10, Vol.206 (1), p.64-72 |
issn | 0377-2217 1872-6860 |
language | eng |
recordid | cdi_proquest_journals_204148680 |
source | RePEc; Elsevier ScienceDirect Journals |
subjects | Algorithms Applied sciences Exact sciences and technology Flowcharts Heuristic Job shops Maximum lateness Neighborhood Neighborhoods No-wait flowshop Operational research and scientific management Operational research. Management science Optimization algorithms Production scheduling Scheduling Scheduling No-wait flowshop Maximum lateness Tabu search Neighborhood Scheduling, sequencing Studies Tabu search |
title | Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T13%3A18%3A22IST&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=Accelerated%20tabu%20search%20for%20no-wait%20flowshop%20scheduling%20problem%20with%20maximum%20lateness%20criterion&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Wang,%20Chuyang&rft.date=2010-10-01&rft.volume=206&rft.issue=1&rft.spage=64&rft.epage=72&rft.pages=64-72&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2010.02.014&rft_dat=%3Cproquest_cross%3E2004689631%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204148680&rft_id=info:pmid/&rft_els_id=S0377221710001190&rfr_iscdi=true |