A GRASP algorithm for the two-machine flow-shop problem with weighted late work criterion and common due date
In this paper, a metaheuristic approach for the two-machine flow-shop problem with a common due date and the weighted late work performance measure (F2|d j = d|Y w ) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1934 |
|---|---|
| container_issue | |
| container_start_page | 1930 |
| container_title | |
| container_volume | |
| creator | Hasanzadeh, A. Afshari, H. Kianfar, K. Fathi, M. Jadid, A.O. |
| description | In this paper, a metaheuristic approach for the two-machine flow-shop problem with a common due date and the weighted late work performance measure (F2|d j = d|Y w ) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Since the problem mentioned is known to be NP-hard, a trajectory methods, namely GRASP is proposed based on the special features of the case under consideration. Then, the results of computational experiments are reported, in which the metaheuristic solution is compared with exact approach and three other heuristic methods' results. |
| doi_str_mv | 10.1109/IEEM.2009.5373211 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5373211</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5373211</ieee_id><sourcerecordid>5373211</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-557123093cdaeaf73603d16dd2ddceaffb7283e5349cce23c5937f25f3da1bc3</originalsourceid><addsrcrecordid>eNo9kE1PwkAYhNcPEgH5AcbL-weK-9Htdo-EAJJgNMrBG1l239JqlyXbmsZ_b43E00xmJs9hCLljdMoY1Q_rxeJpyinVUymU4IxdkIlWOUt5mqa5ovklGXImVSIy_n5FRuci0-r6v2BsQEa_DE1lTtUNmTTNB6WU8TzjOhsSP4PV6-ztBUx9CLFqSw9FiNCWCG0XEm9sWR0Rijp0SVOGE5xi2Nfooeu30GF1KFt0UJsWoQvxE2wPwViFI5ijAxu87637QnD95JYMClM3ODnrmGyXi-38Mdk8r9bz2SapmJJtIqViXFAtrDNoCiUyKhzLnOPO2T4o9ornAqVItbXIhZVaqILLQjjD9laMyf0ftkLE3SlW3sTv3flF8QOpq2Cv</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A GRASP algorithm for the two-machine flow-shop problem with weighted late work criterion and common due date</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hasanzadeh, A. ; Afshari, H. ; Kianfar, K. ; Fathi, M. ; Jadid, A.O.</creator><creatorcontrib>Hasanzadeh, A. ; Afshari, H. ; Kianfar, K. ; Fathi, M. ; Jadid, A.O.</creatorcontrib><description>In this paper, a metaheuristic approach for the two-machine flow-shop problem with a common due date and the weighted late work performance measure (F2|d j = d|Y w ) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Since the problem mentioned is known to be NP-hard, a trajectory methods, namely GRASP is proposed based on the special features of the case under consideration. Then, the results of computational experiments are reported, in which the metaheuristic solution is compared with exact approach and three other heuristic methods' results.</description><identifier>ISSN: 2157-3611</identifier><identifier>ISBN: 1424448697</identifier><identifier>ISBN: 9781424448692</identifier><identifier>EISSN: 2157-362X</identifier><identifier>EISBN: 9781424448708</identifier><identifier>EISBN: 1424448700</identifier><identifier>DOI: 10.1109/IEEM.2009.5373211</identifier><identifier>LCCN: 2009905807</identifier><language>eng</language><publisher>IEEE</publisher><subject>Control systems ; Delay estimation ; Environmental management ; Flow-Shop ; GRASP ; Industrial engineering ; Information management ; Job shop scheduling ; Late work criteria ; Metaheuristic ; Parallel machines ; Processor scheduling ; Production ; Real time systems ; Scheduling</subject><ispartof>2009 IEEE International Conference on Industrial Engineering and Engineering Management, 2009, p.1930-1934</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5373211$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5373211$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hasanzadeh, A.</creatorcontrib><creatorcontrib>Afshari, H.</creatorcontrib><creatorcontrib>Kianfar, K.</creatorcontrib><creatorcontrib>Fathi, M.</creatorcontrib><creatorcontrib>Jadid, A.O.</creatorcontrib><title>A GRASP algorithm for the two-machine flow-shop problem with weighted late work criterion and common due date</title><title>2009 IEEE International Conference on Industrial Engineering and Engineering Management</title><addtitle>IEEM</addtitle><description>In this paper, a metaheuristic approach for the two-machine flow-shop problem with a common due date and the weighted late work performance measure (F2|d j = d|Y w ) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Since the problem mentioned is known to be NP-hard, a trajectory methods, namely GRASP is proposed based on the special features of the case under consideration. Then, the results of computational experiments are reported, in which the metaheuristic solution is compared with exact approach and three other heuristic methods' results.</description><subject>Control systems</subject><subject>Delay estimation</subject><subject>Environmental management</subject><subject>Flow-Shop</subject><subject>GRASP</subject><subject>Industrial engineering</subject><subject>Information management</subject><subject>Job shop scheduling</subject><subject>Late work criteria</subject><subject>Metaheuristic</subject><subject>Parallel machines</subject><subject>Processor scheduling</subject><subject>Production</subject><subject>Real time systems</subject><subject>Scheduling</subject><issn>2157-3611</issn><issn>2157-362X</issn><isbn>1424448697</isbn><isbn>9781424448692</isbn><isbn>9781424448708</isbn><isbn>1424448700</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kE1PwkAYhNcPEgH5AcbL-weK-9Htdo-EAJJgNMrBG1l239JqlyXbmsZ_b43E00xmJs9hCLljdMoY1Q_rxeJpyinVUymU4IxdkIlWOUt5mqa5ovklGXImVSIy_n5FRuci0-r6v2BsQEa_DE1lTtUNmTTNB6WU8TzjOhsSP4PV6-ztBUx9CLFqSw9FiNCWCG0XEm9sWR0Rijp0SVOGE5xi2Nfooeu30GF1KFt0UJsWoQvxE2wPwViFI5ijAxu87637QnD95JYMClM3ODnrmGyXi-38Mdk8r9bz2SapmJJtIqViXFAtrDNoCiUyKhzLnOPO2T4o9ornAqVItbXIhZVaqILLQjjD9laMyf0ftkLE3SlW3sTv3flF8QOpq2Cv</recordid><startdate>200912</startdate><enddate>200912</enddate><creator>Hasanzadeh, A.</creator><creator>Afshari, H.</creator><creator>Kianfar, K.</creator><creator>Fathi, M.</creator><creator>Jadid, A.O.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200912</creationdate><title>A GRASP algorithm for the two-machine flow-shop problem with weighted late work criterion and common due date</title><author>Hasanzadeh, A. ; Afshari, H. ; Kianfar, K. ; Fathi, M. ; Jadid, A.O.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-557123093cdaeaf73603d16dd2ddceaffb7283e5349cce23c5937f25f3da1bc3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Control systems</topic><topic>Delay estimation</topic><topic>Environmental management</topic><topic>Flow-Shop</topic><topic>GRASP</topic><topic>Industrial engineering</topic><topic>Information management</topic><topic>Job shop scheduling</topic><topic>Late work criteria</topic><topic>Metaheuristic</topic><topic>Parallel machines</topic><topic>Processor scheduling</topic><topic>Production</topic><topic>Real time systems</topic><topic>Scheduling</topic><toplevel>online_resources</toplevel><creatorcontrib>Hasanzadeh, A.</creatorcontrib><creatorcontrib>Afshari, H.</creatorcontrib><creatorcontrib>Kianfar, K.</creatorcontrib><creatorcontrib>Fathi, M.</creatorcontrib><creatorcontrib>Jadid, A.O.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hasanzadeh, A.</au><au>Afshari, H.</au><au>Kianfar, K.</au><au>Fathi, M.</au><au>Jadid, A.O.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A GRASP algorithm for the two-machine flow-shop problem with weighted late work criterion and common due date</atitle><btitle>2009 IEEE International Conference on Industrial Engineering and Engineering Management</btitle><stitle>IEEM</stitle><date>2009-12</date><risdate>2009</risdate><spage>1930</spage><epage>1934</epage><pages>1930-1934</pages><issn>2157-3611</issn><eissn>2157-362X</eissn><isbn>1424448697</isbn><isbn>9781424448692</isbn><eisbn>9781424448708</eisbn><eisbn>1424448700</eisbn><abstract>In this paper, a metaheuristic approach for the two-machine flow-shop problem with a common due date and the weighted late work performance measure (F2|d j = d|Y w ) are presented. The late work criterion estimates the quality of a solution with regard to the duration of the late parts of jobs, not taking into account the quantity of the delay for the fully late activities. Since the problem mentioned is known to be NP-hard, a trajectory methods, namely GRASP is proposed based on the special features of the case under consideration. Then, the results of computational experiments are reported, in which the metaheuristic solution is compared with exact approach and three other heuristic methods' results.</abstract><pub>IEEE</pub><doi>10.1109/IEEM.2009.5373211</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2157-3611 |
| ispartof | 2009 IEEE International Conference on Industrial Engineering and Engineering Management, 2009, p.1930-1934 |
| issn | 2157-3611 2157-362X |
| language | eng |
| recordid | cdi_ieee_primary_5373211 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Control systems Delay estimation Environmental management Flow-Shop GRASP Industrial engineering Information management Job shop scheduling Late work criteria Metaheuristic Parallel machines Processor scheduling Production Real time systems Scheduling |
| title | A GRASP algorithm for the two-machine flow-shop problem with weighted late work criterion and common due date |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T15%3A54%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20GRASP%20algorithm%20for%20the%20two-machine%20flow-shop%20problem%20with%20weighted%20late%20work%20criterion%20and%20common%20due%20date&rft.btitle=2009%20IEEE%20International%20Conference%20on%20Industrial%20Engineering%20and%20Engineering%20Management&rft.au=Hasanzadeh,%20A.&rft.date=2009-12&rft.spage=1930&rft.epage=1934&rft.pages=1930-1934&rft.issn=2157-3611&rft.eissn=2157-362X&rft.isbn=1424448697&rft.isbn_list=9781424448692&rft_id=info:doi/10.1109/IEEM.2009.5373211&rft_dat=%3Cieee_6IE%3E5373211%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424448708&rft.eisbn_list=1424448700&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5373211&rfr_iscdi=true |