Scatter search with path relinking for the flexible job shop scheduling problem
•Neighborhood structures for Flexible Job Shop Scheduling Problem (FJSP) are proposed.•New dissimilarity measures for solutions of the FJSP are defined.•A new Scatter Search with Path Relinking (SSPR) algorithm is proposed for the FJSP.•The experiments show that SSPR compares favorably with the stat...
Gespeichert in:
Veröffentlicht in: | European journal of operational research 2015-08, Vol.245 (1), p.35-45 |
---|---|
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 | 45 |
---|---|
container_issue | 1 |
container_start_page | 35 |
container_title | European journal of operational research |
container_volume | 245 |
creator | González, Miguel A. Vela, Camino R. Varela, Ramiro |
description | •Neighborhood structures for Flexible Job Shop Scheduling Problem (FJSP) are proposed.•New dissimilarity measures for solutions of the FJSP are defined.•A new Scatter Search with Path Relinking (SSPR) algorithm is proposed for the FJSP.•The experiments show that SSPR compares favorably with the state-of-the-art.
The flexible job shop scheduling is a challenging problem due to its high complexity and the huge number of applications it has in real production environments. In this paper, we propose effective neighborhood structures for this problem, including feasibility and non improving conditions, as well as procedures for fast estimation of the neighbors quality. These neighborhoods are embedded into a scatter search algorithm which uses tabu search and path relinking in its core. To develop these metaheuristics we define a novel dissimilarity measure, which deals with flexibility. We conducted an experimental study to analyze the proposed algorithm and to compare it with the state of the art on standard benchmarks. In this study, our algorithm compared favorably to other methods and established new upper bounds for a number of instances. |
doi_str_mv | 10.1016/j.ejor.2015.02.052 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1676468048</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221715001721</els_id><sourcerecordid>3669054051</sourcerecordid><originalsourceid>FETCH-LOGICAL-c429t-16fc4e55fe3ea61af06d72386406a840e68827a904e80113ce824cf714015af13</originalsourceid><addsrcrecordid>eNp9kEtPwzAQhC0EEqXwBzhZ4pywdhzHlbigipdUqQfgbLnOmjikSbFTHv8eR-XMZfew3-yMhpBLBjkDJq_bHNsh5BxYmQPPoeRHZMZUxTOpJByTGRRVlXHOqlNyFmMLkEhWzsj62ZpxxEAjmmAb-uXHhu5MGgE737_7_o26IdCxQeo6_PabDmk7bGhshh2NtsF6303QLgzptD0nJ850ES_-9py83t-9LB-z1frhaXm7yqzgizFj0lmBZemwQCOZcSDrihdKCpBGCUCpFK_MAgQqYKywqLiwrmIi5TaOFXNydfibfD_2GEfdDvvQJ0vNZCWFVCBUoviBsmGIMaDTu-C3JvxoBnoqTrd6Kk5PxWngOhWXRDcHEab8nx6DjtZjb7H2Ae2o68H_J_8F3G12JA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1676468048</pqid></control><display><type>article</type><title>Scatter search with path relinking for the flexible job shop scheduling problem</title><source>Elsevier ScienceDirect Journals</source><creator>González, Miguel A. ; Vela, Camino R. ; Varela, Ramiro</creator><creatorcontrib>González, Miguel A. ; Vela, Camino R. ; Varela, Ramiro</creatorcontrib><description>•Neighborhood structures for Flexible Job Shop Scheduling Problem (FJSP) are proposed.•New dissimilarity measures for solutions of the FJSP are defined.•A new Scatter Search with Path Relinking (SSPR) algorithm is proposed for the FJSP.•The experiments show that SSPR compares favorably with the state-of-the-art.
The flexible job shop scheduling is a challenging problem due to its high complexity and the huge number of applications it has in real production environments. In this paper, we propose effective neighborhood structures for this problem, including feasibility and non improving conditions, as well as procedures for fast estimation of the neighbors quality. These neighborhoods are embedded into a scatter search algorithm which uses tabu search and path relinking in its core. To develop these metaheuristics we define a novel dissimilarity measure, which deals with flexibility. We conducted an experimental study to analyze the proposed algorithm and to compare it with the state of the art on standard benchmarks. In this study, our algorithm compared favorably to other methods and established new upper bounds for a number of instances.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2015.02.052</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Comparative analysis ; Flexible job shop ; Job shops ; Neighborhood structures ; Operations research ; Optimization algorithms ; Path relinking ; Production scheduling ; Scatter search ; Scheduling ; Studies</subject><ispartof>European journal of operational research, 2015-08, Vol.245 (1), p.35-45</ispartof><rights>2015 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Aug 16, 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c429t-16fc4e55fe3ea61af06d72386406a840e68827a904e80113ce824cf714015af13</citedby><cites>FETCH-LOGICAL-c429t-16fc4e55fe3ea61af06d72386406a840e68827a904e80113ce824cf714015af13</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0377221715001721$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,65309</link.rule.ids></links><search><creatorcontrib>González, Miguel A.</creatorcontrib><creatorcontrib>Vela, Camino R.</creatorcontrib><creatorcontrib>Varela, Ramiro</creatorcontrib><title>Scatter search with path relinking for the flexible job shop scheduling problem</title><title>European journal of operational research</title><description>•Neighborhood structures for Flexible Job Shop Scheduling Problem (FJSP) are proposed.•New dissimilarity measures for solutions of the FJSP are defined.•A new Scatter Search with Path Relinking (SSPR) algorithm is proposed for the FJSP.•The experiments show that SSPR compares favorably with the state-of-the-art.
The flexible job shop scheduling is a challenging problem due to its high complexity and the huge number of applications it has in real production environments. In this paper, we propose effective neighborhood structures for this problem, including feasibility and non improving conditions, as well as procedures for fast estimation of the neighbors quality. These neighborhoods are embedded into a scatter search algorithm which uses tabu search and path relinking in its core. To develop these metaheuristics we define a novel dissimilarity measure, which deals with flexibility. We conducted an experimental study to analyze the proposed algorithm and to compare it with the state of the art on standard benchmarks. In this study, our algorithm compared favorably to other methods and established new upper bounds for a number of instances.</description><subject>Algorithms</subject><subject>Comparative analysis</subject><subject>Flexible job shop</subject><subject>Job shops</subject><subject>Neighborhood structures</subject><subject>Operations research</subject><subject>Optimization algorithms</subject><subject>Path relinking</subject><subject>Production scheduling</subject><subject>Scatter search</subject><subject>Scheduling</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNp9kEtPwzAQhC0EEqXwBzhZ4pywdhzHlbigipdUqQfgbLnOmjikSbFTHv8eR-XMZfew3-yMhpBLBjkDJq_bHNsh5BxYmQPPoeRHZMZUxTOpJByTGRRVlXHOqlNyFmMLkEhWzsj62ZpxxEAjmmAb-uXHhu5MGgE737_7_o26IdCxQeo6_PabDmk7bGhshh2NtsF6303QLgzptD0nJ850ES_-9py83t-9LB-z1frhaXm7yqzgizFj0lmBZemwQCOZcSDrihdKCpBGCUCpFK_MAgQqYKywqLiwrmIi5TaOFXNydfibfD_2GEfdDvvQJ0vNZCWFVCBUoviBsmGIMaDTu-C3JvxoBnoqTrd6Kk5PxWngOhWXRDcHEab8nx6DjtZjb7H2Ae2o68H_J_8F3G12JA</recordid><startdate>20150816</startdate><enddate>20150816</enddate><creator>González, Miguel A.</creator><creator>Vela, Camino R.</creator><creator>Varela, Ramiro</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><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>20150816</creationdate><title>Scatter search with path relinking for the flexible job shop scheduling problem</title><author>González, Miguel A. ; Vela, Camino R. ; Varela, Ramiro</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c429t-16fc4e55fe3ea61af06d72386406a840e68827a904e80113ce824cf714015af13</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Comparative analysis</topic><topic>Flexible job shop</topic><topic>Job shops</topic><topic>Neighborhood structures</topic><topic>Operations research</topic><topic>Optimization algorithms</topic><topic>Path relinking</topic><topic>Production scheduling</topic><topic>Scatter search</topic><topic>Scheduling</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>González, Miguel A.</creatorcontrib><creatorcontrib>Vela, Camino R.</creatorcontrib><creatorcontrib>Varela, Ramiro</creatorcontrib><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>González, Miguel A.</au><au>Vela, Camino R.</au><au>Varela, Ramiro</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scatter search with path relinking for the flexible job shop scheduling problem</atitle><jtitle>European journal of operational research</jtitle><date>2015-08-16</date><risdate>2015</risdate><volume>245</volume><issue>1</issue><spage>35</spage><epage>45</epage><pages>35-45</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>•Neighborhood structures for Flexible Job Shop Scheduling Problem (FJSP) are proposed.•New dissimilarity measures for solutions of the FJSP are defined.•A new Scatter Search with Path Relinking (SSPR) algorithm is proposed for the FJSP.•The experiments show that SSPR compares favorably with the state-of-the-art.
The flexible job shop scheduling is a challenging problem due to its high complexity and the huge number of applications it has in real production environments. In this paper, we propose effective neighborhood structures for this problem, including feasibility and non improving conditions, as well as procedures for fast estimation of the neighbors quality. These neighborhoods are embedded into a scatter search algorithm which uses tabu search and path relinking in its core. To develop these metaheuristics we define a novel dissimilarity measure, which deals with flexibility. We conducted an experimental study to analyze the proposed algorithm and to compare it with the state of the art on standard benchmarks. In this study, our algorithm compared favorably to other methods and established new upper bounds for a number of instances.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2015.02.052</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0377-2217 |
ispartof | European journal of operational research, 2015-08, Vol.245 (1), p.35-45 |
issn | 0377-2217 1872-6860 |
language | eng |
recordid | cdi_proquest_journals_1676468048 |
source | Elsevier ScienceDirect Journals |
subjects | Algorithms Comparative analysis Flexible job shop Job shops Neighborhood structures Operations research Optimization algorithms Path relinking Production scheduling Scatter search Scheduling Studies |
title | Scatter search with path relinking for the flexible job shop scheduling problem |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T04%3A09%3A43IST&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=Scatter%20search%20with%20path%20relinking%20for%20the%20flexible%20job%20shop%20scheduling%20problem&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Gonz%C3%A1lez,%20Miguel%C2%A0A.&rft.date=2015-08-16&rft.volume=245&rft.issue=1&rft.spage=35&rft.epage=45&rft.pages=35-45&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2015.02.052&rft_dat=%3Cproquest_cross%3E3669054051%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=1676468048&rft_id=info:pmid/&rft_els_id=S0377221715001721&rfr_iscdi=true |