Optimizing makespan and stability risks in job shop scheduling
•Job shop scheduling under random machine breakdowns.•Multi-objective optimization of makespan, makespan risk and stability risk.•Design of two operation block-based buffering strategies.•Development of a two-stage multi-objective predictive scheduling algorithm. In real-world manufacturing environm...
Gespeichert in:
Veröffentlicht in: | Computers & operations research 2020-10, Vol.122, p.104963, Article 104963 |
---|---|
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 | |
---|---|
container_issue | |
container_start_page | 104963 |
container_title | Computers & operations research |
container_volume | 122 |
creator | Wu, Zigao Sun, Shudong Yu, Shaohua |
description | •Job shop scheduling under random machine breakdowns.•Multi-objective optimization of makespan, makespan risk and stability risk.•Design of two operation block-based buffering strategies.•Development of a two-stage multi-objective predictive scheduling algorithm.
In real-world manufacturing environments, the execution of a schedule often encounters uncertain events, which will bring the risks of performance deterioration and production system instability. This study addresses the optimization of risks both in performance and stability for the job shop scheduling under random machine breakdowns, in which three objectives: makespan, makespan risk and stability risk are considered at the same time. The buffering approach under the limited predictive makespan will be proposed and used to generate predictive schedules, which allows inserting additional idle time to control the risks. By utilizing the available information about the relationship between the risks and the random machine breakdowns, we have developed two kinds of operation-block based buffering strategies. In order to meet the decision makers with different risk preferences, a multi-objective predictive scheduling algorithm with the proposed buffering strategies is developed to generate a Pareto solution set. Extensive experimental results indicate that, compared with the existing methods, the proposed method can provide a better Pareto solution set in terms of both the diversity and the convergence. |
doi_str_mv | 10.1016/j.cor.2020.104963 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2506560364</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054820300800</els_id><sourcerecordid>2506560364</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-4481c35a4ea01868a5b213b48837aaad707dfecaec698dd4a25a6db97093b15d3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWKs_wFvA89Zk87FZBEGKX1DoRc9hNklttu1mTbZC_fWmrAdPzmXegfedGR6ErimZUULlbTszIc5KUh5nXkt2giaEEVEQwdXpH32OLlJqSa6qpBN0v-wHv_PfvvvAO9i41EOHobM4DdD4rR8OOPq0Sdh3uA0NTuvQ42TWzu63OXOJzlawTe7qt0_R-9Pj2_ylWCyfX-cPi8IwUQ0F54pmBdwBoUoqEE1JWcOVYhUA2IpUduUMOCNrZS2HUoC0TV2RmjVUWDZFN-PePobPvUuDbsM-dvmkLgWRQhImeXbR0WViSCm6le6j30E8aEr0EZNudcakj5j0iCln7saMy-9_eRd1Mt51xlkfnRm0Df6f9A8idW92</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2506560364</pqid></control><display><type>article</type><title>Optimizing makespan and stability risks in job shop scheduling</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Wu, Zigao ; Sun, Shudong ; Yu, Shaohua</creator><creatorcontrib>Wu, Zigao ; Sun, Shudong ; Yu, Shaohua</creatorcontrib><description>•Job shop scheduling under random machine breakdowns.•Multi-objective optimization of makespan, makespan risk and stability risk.•Design of two operation block-based buffering strategies.•Development of a two-stage multi-objective predictive scheduling algorithm.
In real-world manufacturing environments, the execution of a schedule often encounters uncertain events, which will bring the risks of performance deterioration and production system instability. This study addresses the optimization of risks both in performance and stability for the job shop scheduling under random machine breakdowns, in which three objectives: makespan, makespan risk and stability risk are considered at the same time. The buffering approach under the limited predictive makespan will be proposed and used to generate predictive schedules, which allows inserting additional idle time to control the risks. By utilizing the available information about the relationship between the risks and the random machine breakdowns, we have developed two kinds of operation-block based buffering strategies. In order to meet the decision makers with different risk preferences, a multi-objective predictive scheduling algorithm with the proposed buffering strategies is developed to generate a Pareto solution set. Extensive experimental results indicate that, compared with the existing methods, the proposed method can provide a better Pareto solution set in terms of both the diversity and the convergence.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2020.104963</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Algorithms ; Breakdown ; Buffers ; Job shop ; Job shop scheduling ; Job shops ; Machine breakdown ; Multi-objective ; Multiple objective analysis ; Operations research ; Optimization ; Performance degradation ; Risk ; Robustness ; Schedules ; Scheduling ; Stability</subject><ispartof>Computers & operations research, 2020-10, Vol.122, p.104963, Article 104963</ispartof><rights>2020 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Oct 2020</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-4481c35a4ea01868a5b213b48837aaad707dfecaec698dd4a25a6db97093b15d3</citedby><cites>FETCH-LOGICAL-c357t-4481c35a4ea01868a5b213b48837aaad707dfecaec698dd4a25a6db97093b15d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.cor.2020.104963$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Wu, Zigao</creatorcontrib><creatorcontrib>Sun, Shudong</creatorcontrib><creatorcontrib>Yu, Shaohua</creatorcontrib><title>Optimizing makespan and stability risks in job shop scheduling</title><title>Computers & operations research</title><description>•Job shop scheduling under random machine breakdowns.•Multi-objective optimization of makespan, makespan risk and stability risk.•Design of two operation block-based buffering strategies.•Development of a two-stage multi-objective predictive scheduling algorithm.
In real-world manufacturing environments, the execution of a schedule often encounters uncertain events, which will bring the risks of performance deterioration and production system instability. This study addresses the optimization of risks both in performance and stability for the job shop scheduling under random machine breakdowns, in which three objectives: makespan, makespan risk and stability risk are considered at the same time. The buffering approach under the limited predictive makespan will be proposed and used to generate predictive schedules, which allows inserting additional idle time to control the risks. By utilizing the available information about the relationship between the risks and the random machine breakdowns, we have developed two kinds of operation-block based buffering strategies. In order to meet the decision makers with different risk preferences, a multi-objective predictive scheduling algorithm with the proposed buffering strategies is developed to generate a Pareto solution set. Extensive experimental results indicate that, compared with the existing methods, the proposed method can provide a better Pareto solution set in terms of both the diversity and the convergence.</description><subject>Algorithms</subject><subject>Breakdown</subject><subject>Buffers</subject><subject>Job shop</subject><subject>Job shop scheduling</subject><subject>Job shops</subject><subject>Machine breakdown</subject><subject>Multi-objective</subject><subject>Multiple objective analysis</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Performance degradation</subject><subject>Risk</subject><subject>Robustness</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Stability</subject><issn>0305-0548</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWKs_wFvA89Zk87FZBEGKX1DoRc9hNklttu1mTbZC_fWmrAdPzmXegfedGR6ErimZUULlbTszIc5KUh5nXkt2giaEEVEQwdXpH32OLlJqSa6qpBN0v-wHv_PfvvvAO9i41EOHobM4DdD4rR8OOPq0Sdh3uA0NTuvQ42TWzu63OXOJzlawTe7qt0_R-9Pj2_ylWCyfX-cPi8IwUQ0F54pmBdwBoUoqEE1JWcOVYhUA2IpUduUMOCNrZS2HUoC0TV2RmjVUWDZFN-PePobPvUuDbsM-dvmkLgWRQhImeXbR0WViSCm6le6j30E8aEr0EZNudcakj5j0iCln7saMy-9_eRd1Mt51xlkfnRm0Df6f9A8idW92</recordid><startdate>20201001</startdate><enddate>20201001</enddate><creator>Wu, Zigao</creator><creator>Sun, Shudong</creator><creator>Yu, Shaohua</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20201001</creationdate><title>Optimizing makespan and stability risks in job shop scheduling</title><author>Wu, Zigao ; Sun, Shudong ; Yu, Shaohua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-4481c35a4ea01868a5b213b48837aaad707dfecaec698dd4a25a6db97093b15d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Breakdown</topic><topic>Buffers</topic><topic>Job shop</topic><topic>Job shop scheduling</topic><topic>Job shops</topic><topic>Machine breakdown</topic><topic>Multi-objective</topic><topic>Multiple objective analysis</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Performance degradation</topic><topic>Risk</topic><topic>Robustness</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Stability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Zigao</creatorcontrib><creatorcontrib>Sun, Shudong</creatorcontrib><creatorcontrib>Yu, Shaohua</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology 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>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, Zigao</au><au>Sun, Shudong</au><au>Yu, Shaohua</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimizing makespan and stability risks in job shop scheduling</atitle><jtitle>Computers & operations research</jtitle><date>2020-10-01</date><risdate>2020</risdate><volume>122</volume><spage>104963</spage><pages>104963-</pages><artnum>104963</artnum><issn>0305-0548</issn><eissn>0305-0548</eissn><abstract>•Job shop scheduling under random machine breakdowns.•Multi-objective optimization of makespan, makespan risk and stability risk.•Design of two operation block-based buffering strategies.•Development of a two-stage multi-objective predictive scheduling algorithm.
In real-world manufacturing environments, the execution of a schedule often encounters uncertain events, which will bring the risks of performance deterioration and production system instability. This study addresses the optimization of risks both in performance and stability for the job shop scheduling under random machine breakdowns, in which three objectives: makespan, makespan risk and stability risk are considered at the same time. The buffering approach under the limited predictive makespan will be proposed and used to generate predictive schedules, which allows inserting additional idle time to control the risks. By utilizing the available information about the relationship between the risks and the random machine breakdowns, we have developed two kinds of operation-block based buffering strategies. In order to meet the decision makers with different risk preferences, a multi-objective predictive scheduling algorithm with the proposed buffering strategies is developed to generate a Pareto solution set. Extensive experimental results indicate that, compared with the existing methods, the proposed method can provide a better Pareto solution set in terms of both the diversity and the convergence.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2020.104963</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0305-0548 |
ispartof | Computers & operations research, 2020-10, Vol.122, p.104963, Article 104963 |
issn | 0305-0548 0305-0548 |
language | eng |
recordid | cdi_proquest_journals_2506560364 |
source | Elsevier ScienceDirect Journals Complete |
subjects | Algorithms Breakdown Buffers Job shop Job shop scheduling Job shops Machine breakdown Multi-objective Multiple objective analysis Operations research Optimization Performance degradation Risk Robustness Schedules Scheduling Stability |
title | Optimizing makespan and stability risks in job shop scheduling |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T14%3A47%3A45IST&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=Optimizing%20makespan%20and%20stability%20risks%20in%20job%20shop%20scheduling&rft.jtitle=Computers%20&%20operations%20research&rft.au=Wu,%20Zigao&rft.date=2020-10-01&rft.volume=122&rft.spage=104963&rft.pages=104963-&rft.artnum=104963&rft.issn=0305-0548&rft.eissn=0305-0548&rft_id=info:doi/10.1016/j.cor.2020.104963&rft_dat=%3Cproquest_cross%3E2506560364%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=2506560364&rft_id=info:pmid/&rft_els_id=S0305054820300800&rfr_iscdi=true |