An adaptive scheduling algorithm for a parallel machine problem with rework processes
The development of a scheduling methodology for a parallel machine problem with rework processes is presented in this paper. The problem is to make a schedule for parallel machines with rework probabilities, due-dates, and sequence dependent setup times. Two heuristics are developed based on a dispa...
Gespeichert in:
| Veröffentlicht in: | International journal of production research 2010-01, Vol.48 (1), p.95-115 |
|---|---|
| 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 | 115 |
|---|---|
| container_issue | 1 |
| container_start_page | 95 |
| container_title | International journal of production research |
| container_volume | 48 |
| creator | Kang, Yong Ha Shin, Hyun Joon |
| description | The development of a scheduling methodology for a parallel machine problem with rework processes is presented in this paper. The problem is to make a schedule for parallel machines with rework probabilities, due-dates, and sequence dependent setup times. Two heuristics are developed based on a dispatching algorithm and problem-space-based search method. In order to evaluate the efficacy of the proposed algorithms, six performance indicators are considered: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of tardy jobs, and the number of reworks. This paper shows how these algorithms can adaptively capture the characteristics of manufacturing facilities for enhancing the performance under changing production environments. Extensive experimental results show that the proposed algorithms give very efficient performance in terms of computational time and each objective value. |
| doi_str_mv | 10.1080/00207540802484903 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_22324073</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>753657790</sourcerecordid><originalsourceid>FETCH-LOGICAL-c466t-1727beb51957bf9755548db60584467fae7ad4bc7fc3fc064bffdc63399b5e9e3</originalsourceid><addsrcrecordid>eNqFkE1LJDEQhoOs4OzoD_AWFmRPrUnnqxu8iOyHIHhR8Baq0xWnNd09m_Ss6783zagHhTWXhMrzVBUvIYecHXNWsRPGSmaUzM9SVrJmYocsuNC6UFV1-4Us5v8iA2KPfE3pnuWjKrkgN2cDhRbWU_cXaXIrbDehG-4ohLsxdtOqp36MFOgaIoSAgfbgVt2AdB3HJmBPHzNEIz6O8WGuOUwJ0z7Z9RASHrzcS3Lz88f1-e_i8urXxfnZZeGk1lPBTWkabBSvlWl8bZRSsmobPa8mtfGABlrZOOOd8I5p2XjfOi1EXTcKaxRL8n3bN0_-s8E02b5LDkOAAcdNskYJrYzJcSzJt3fk_biJQ17OlrwyTFS8zhDfQi6OKUX0dh27HuKT5czOMdsPMWfn6KUxJAfBRxhcl97EshSlZGbmTrdcN-REe8iBhdZO8BTG-CqJ_40xn-ofLDv9m8QzlEeiEQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>218703819</pqid></control><display><type>article</type><title>An adaptive scheduling algorithm for a parallel machine problem with rework processes</title><source>EBSCO Business Source Complete</source><source>Taylor & Francis Journals Complete</source><creator>Kang, Yong Ha ; Shin, Hyun Joon</creator><creatorcontrib>Kang, Yong Ha ; Shin, Hyun Joon</creatorcontrib><description>The development of a scheduling methodology for a parallel machine problem with rework processes is presented in this paper. The problem is to make a schedule for parallel machines with rework probabilities, due-dates, and sequence dependent setup times. Two heuristics are developed based on a dispatching algorithm and problem-space-based search method. In order to evaluate the efficacy of the proposed algorithms, six performance indicators are considered: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of tardy jobs, and the number of reworks. This paper shows how these algorithms can adaptively capture the characteristics of manufacturing facilities for enhancing the performance under changing production environments. Extensive experimental results show that the proposed algorithms give very efficient performance in terms of computational time and each objective value.</description><identifier>ISSN: 0020-7543</identifier><identifier>EISSN: 1366-588X</identifier><identifier>DOI: 10.1080/00207540802484903</identifier><identifier>CODEN: IJPRB8</identifier><language>eng</language><publisher>Abingdon: Taylor & Francis Group</publisher><subject>Adaptive algorithms ; adaptive scheduling ; Algorithms ; Applied sciences ; dispatching algorithm ; Exact sciences and technology ; Heuristic ; Indicators ; Inventory control, production control. Distribution ; Job shops ; Lateness ; Operational research and scientific management ; Operational research. Management science ; parallel machines ; problem-space-based search ; Production scheduling ; rework probability ; Schedules ; Scheduling ; Scheduling algorithms ; Search methods ; Setup times ; Studies</subject><ispartof>International journal of production research, 2010-01, Vol.48 (1), p.95-115</ispartof><rights>Copyright Taylor & Francis Group, LLC 2010</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Taylor & Francis Group Jan 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c466t-1727beb51957bf9755548db60584467fae7ad4bc7fc3fc064bffdc63399b5e9e3</citedby><cites>FETCH-LOGICAL-c466t-1727beb51957bf9755548db60584467fae7ad4bc7fc3fc064bffdc63399b5e9e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.tandfonline.com/doi/pdf/10.1080/00207540802484903$$EPDF$$P50$$Ginformaworld$$H</linktopdf><linktohtml>$$Uhttps://www.tandfonline.com/doi/full/10.1080/00207540802484903$$EHTML$$P50$$Ginformaworld$$H</linktohtml><link.rule.ids>314,776,780,4010,27900,27901,27902,59620,60409</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22324073$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kang, Yong Ha</creatorcontrib><creatorcontrib>Shin, Hyun Joon</creatorcontrib><title>An adaptive scheduling algorithm for a parallel machine problem with rework processes</title><title>International journal of production research</title><description>The development of a scheduling methodology for a parallel machine problem with rework processes is presented in this paper. The problem is to make a schedule for parallel machines with rework probabilities, due-dates, and sequence dependent setup times. Two heuristics are developed based on a dispatching algorithm and problem-space-based search method. In order to evaluate the efficacy of the proposed algorithms, six performance indicators are considered: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of tardy jobs, and the number of reworks. This paper shows how these algorithms can adaptively capture the characteristics of manufacturing facilities for enhancing the performance under changing production environments. Extensive experimental results show that the proposed algorithms give very efficient performance in terms of computational time and each objective value.</description><subject>Adaptive algorithms</subject><subject>adaptive scheduling</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>dispatching algorithm</subject><subject>Exact sciences and technology</subject><subject>Heuristic</subject><subject>Indicators</subject><subject>Inventory control, production control. Distribution</subject><subject>Job shops</subject><subject>Lateness</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>parallel machines</subject><subject>problem-space-based search</subject><subject>Production scheduling</subject><subject>rework probability</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Scheduling algorithms</subject><subject>Search methods</subject><subject>Setup times</subject><subject>Studies</subject><issn>0020-7543</issn><issn>1366-588X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNqFkE1LJDEQhoOs4OzoD_AWFmRPrUnnqxu8iOyHIHhR8Baq0xWnNd09m_Ss6783zagHhTWXhMrzVBUvIYecHXNWsRPGSmaUzM9SVrJmYocsuNC6UFV1-4Us5v8iA2KPfE3pnuWjKrkgN2cDhRbWU_cXaXIrbDehG-4ohLsxdtOqp36MFOgaIoSAgfbgVt2AdB3HJmBPHzNEIz6O8WGuOUwJ0z7Z9RASHrzcS3Lz88f1-e_i8urXxfnZZeGk1lPBTWkabBSvlWl8bZRSsmobPa8mtfGABlrZOOOd8I5p2XjfOi1EXTcKaxRL8n3bN0_-s8E02b5LDkOAAcdNskYJrYzJcSzJt3fk_biJQ17OlrwyTFS8zhDfQi6OKUX0dh27HuKT5czOMdsPMWfn6KUxJAfBRxhcl97EshSlZGbmTrdcN-REe8iBhdZO8BTG-CqJ_40xn-ofLDv9m8QzlEeiEQ</recordid><startdate>20100101</startdate><enddate>20100101</enddate><creator>Kang, Yong Ha</creator><creator>Shin, Hyun Joon</creator><general>Taylor & Francis Group</general><general>Taylor & Francis</general><general>Taylor & Francis LLC</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>20100101</creationdate><title>An adaptive scheduling algorithm for a parallel machine problem with rework processes</title><author>Kang, Yong Ha ; Shin, Hyun Joon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c466t-1727beb51957bf9755548db60584467fae7ad4bc7fc3fc064bffdc63399b5e9e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Adaptive algorithms</topic><topic>adaptive scheduling</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>dispatching algorithm</topic><topic>Exact sciences and technology</topic><topic>Heuristic</topic><topic>Indicators</topic><topic>Inventory control, production control. Distribution</topic><topic>Job shops</topic><topic>Lateness</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>parallel machines</topic><topic>problem-space-based search</topic><topic>Production scheduling</topic><topic>rework probability</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Scheduling algorithms</topic><topic>Search methods</topic><topic>Setup times</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kang, Yong Ha</creatorcontrib><creatorcontrib>Shin, Hyun Joon</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 & 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>Kang, Yong Ha</au><au>Shin, Hyun Joon</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An adaptive scheduling algorithm for a parallel machine problem with rework processes</atitle><jtitle>International journal of production research</jtitle><date>2010-01-01</date><risdate>2010</risdate><volume>48</volume><issue>1</issue><spage>95</spage><epage>115</epage><pages>95-115</pages><issn>0020-7543</issn><eissn>1366-588X</eissn><coden>IJPRB8</coden><abstract>The development of a scheduling methodology for a parallel machine problem with rework processes is presented in this paper. The problem is to make a schedule for parallel machines with rework probabilities, due-dates, and sequence dependent setup times. Two heuristics are developed based on a dispatching algorithm and problem-space-based search method. In order to evaluate the efficacy of the proposed algorithms, six performance indicators are considered: total tardiness, maximum lateness, mean flow-time, mean lateness, the number of tardy jobs, and the number of reworks. This paper shows how these algorithms can adaptively capture the characteristics of manufacturing facilities for enhancing the performance under changing production environments. Extensive experimental results show that the proposed algorithms give very efficient performance in terms of computational time and each objective value.</abstract><cop>Abingdon</cop><pub>Taylor & Francis Group</pub><doi>10.1080/00207540802484903</doi><tpages>21</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-7543 |
| ispartof | International journal of production research, 2010-01, Vol.48 (1), p.95-115 |
| issn | 0020-7543 1366-588X |
| language | eng |
| recordid | cdi_pascalfrancis_primary_22324073 |
| source | EBSCO Business Source Complete; Taylor & Francis Journals Complete |
| subjects | Adaptive algorithms adaptive scheduling Algorithms Applied sciences dispatching algorithm Exact sciences and technology Heuristic Indicators Inventory control, production control. Distribution Job shops Lateness Operational research and scientific management Operational research. Management science parallel machines problem-space-based search Production scheduling rework probability Schedules Scheduling Scheduling algorithms Search methods Setup times Studies |
| title | An adaptive scheduling algorithm for a parallel machine problem with rework processes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T17%3A58%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20adaptive%20scheduling%20algorithm%20for%20a%20parallel%20machine%20problem%20with%20rework%20processes&rft.jtitle=International%20journal%20of%20production%20research&rft.au=Kang,%20Yong%20Ha&rft.date=2010-01-01&rft.volume=48&rft.issue=1&rft.spage=95&rft.epage=115&rft.pages=95-115&rft.issn=0020-7543&rft.eissn=1366-588X&rft.coden=IJPRB8&rft_id=info:doi/10.1080/00207540802484903&rft_dat=%3Cproquest_pasca%3E753657790%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=218703819&rft_id=info:pmid/&rfr_iscdi=true |