A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives

The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding to a system’s perturbation in an intelligent way and with minimum energy consumption variation is an important matter. Fortunately, thanks to the development of artificial inte...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Sustainability 2021-12, Vol.13 (23), p.13016
Hauptverfasser: Naimi, Rami, Nouiri, Maroua, Cardin, Olivier
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 23
container_start_page 13016
container_title Sustainability
container_volume 13
creator Naimi, Rami
Nouiri, Maroua
Cardin, Olivier
description The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding to a system’s perturbation in an intelligent way and with minimum energy consumption variation is an important matter. Fortunately, thanks to the development of artificial intelligence and machine learning, a lot of researchers are using these new techniques to solve the rescheduling problem in a flexible job shop. Reinforcement learning, which is a popular approach in artificial intelligence, is often used in rescheduling. This article presents a Q-learning rescheduling approach to the flexible job shop problem combining energy and productivity objectives in a context of machine failure. First, a genetic algorithm was adopted to generate the initial predictive schedule, and then rescheduling strategies were developed to handle machine failures. As the system should be capable of reacting quickly to unexpected events, a multi-objective Q-learning algorithm is proposed and trained to select the optimal rescheduling methods that minimize the makespan and the energy consumption variation at the same time. This approach was conducted on benchmark instances to evaluate its performance.
doi_str_mv 10.3390/su132313016
format Article
fullrecord <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_03447346v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2608144726</sourcerecordid><originalsourceid>FETCH-LOGICAL-c332t-88287efe890caff139e41f120c6acc48188c6bc47bb7d2d7bcf74d35b440bccd3</originalsourceid><addsrcrecordid>eNpNkU1Lw0AQhhdRsNSe_AMLnkSi-9VkcwyltUqgfp6X3c2mSUmzcTcp5t-bWJHOZeadeXiZYQC4xuie0hg9-A5TQjFFODwDE4IiHGA0R-cn9SWYeb9DQ1CKYxxOQJPA1yA10tVlvYVvxuvCZF01iqRpnJW6gK2FbWHgqjLfpaoMfLYKvhe2gS_ODnoPF3avyl-DZW3ctoeyzsZh1um2PJRtDzdqZ8ba-CtwkcvKm9lfnoLP1fJjsQ7SzePTIkkDTSlpA84Jj0xueIy0zHNMY8NwjgnSodSaccy5DpVmkVJRRrJI6TxiGZ0rxpDSOqNTcHv0LWQlGlfupeuFlaVYJ6kYe4gyFlEWHvDA3hzZ4eCvzvhW7Gzn6mE9QULE8QCScKDujpR21ntn8n9bjMT4AXHyAfoDBg14Sg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2608144726</pqid></control><display><type>article</type><title>A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives</title><source>MDPI - Multidisciplinary Digital Publishing Institute</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Naimi, Rami ; Nouiri, Maroua ; Cardin, Olivier</creator><creatorcontrib>Naimi, Rami ; Nouiri, Maroua ; Cardin, Olivier</creatorcontrib><description>The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding to a system’s perturbation in an intelligent way and with minimum energy consumption variation is an important matter. Fortunately, thanks to the development of artificial intelligence and machine learning, a lot of researchers are using these new techniques to solve the rescheduling problem in a flexible job shop. Reinforcement learning, which is a popular approach in artificial intelligence, is often used in rescheduling. This article presents a Q-learning rescheduling approach to the flexible job shop problem combining energy and productivity objectives in a context of machine failure. First, a genetic algorithm was adopted to generate the initial predictive schedule, and then rescheduling strategies were developed to handle machine failures. As the system should be capable of reacting quickly to unexpected events, a multi-objective Q-learning algorithm is proposed and trained to select the optimal rescheduling methods that minimize the makespan and the energy consumption variation at the same time. This approach was conducted on benchmark instances to evaluate its performance.</description><identifier>ISSN: 2071-1050</identifier><identifier>EISSN: 2071-1050</identifier><identifier>DOI: 10.3390/su132313016</identifier><language>eng</language><publisher>Basel: MDPI AG</publisher><subject>Algorithms ; Artificial Intelligence ; Breakdowns ; Computer Science ; Cost control ; Decision making ; Employment ; Energy consumption ; Energy efficiency ; Genetic algorithms ; Heuristic ; Integer programming ; Job shops ; Learning algorithms ; Machine learning ; Manufacturing ; Methods ; Operations Research ; Optimization ; Process controls ; Productivity ; Rescheduling ; Researchers ; Scheduling ; Sustainability ; Systems stability</subject><ispartof>Sustainability, 2021-12, Vol.13 (23), p.13016</ispartof><rights>2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c332t-88287efe890caff139e41f120c6acc48188c6bc47bb7d2d7bcf74d35b440bccd3</citedby><cites>FETCH-LOGICAL-c332t-88287efe890caff139e41f120c6acc48188c6bc47bb7d2d7bcf74d35b440bccd3</cites><orcidid>0000-0002-9035-9660 ; 0000-0002-1664-3858</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,27924,27925</link.rule.ids><backlink>$$Uhttps://hal.science/hal-03447346$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Naimi, Rami</creatorcontrib><creatorcontrib>Nouiri, Maroua</creatorcontrib><creatorcontrib>Cardin, Olivier</creatorcontrib><title>A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives</title><title>Sustainability</title><description>The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding to a system’s perturbation in an intelligent way and with minimum energy consumption variation is an important matter. Fortunately, thanks to the development of artificial intelligence and machine learning, a lot of researchers are using these new techniques to solve the rescheduling problem in a flexible job shop. Reinforcement learning, which is a popular approach in artificial intelligence, is often used in rescheduling. This article presents a Q-learning rescheduling approach to the flexible job shop problem combining energy and productivity objectives in a context of machine failure. First, a genetic algorithm was adopted to generate the initial predictive schedule, and then rescheduling strategies were developed to handle machine failures. As the system should be capable of reacting quickly to unexpected events, a multi-objective Q-learning algorithm is proposed and trained to select the optimal rescheduling methods that minimize the makespan and the energy consumption variation at the same time. This approach was conducted on benchmark instances to evaluate its performance.</description><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Breakdowns</subject><subject>Computer Science</subject><subject>Cost control</subject><subject>Decision making</subject><subject>Employment</subject><subject>Energy consumption</subject><subject>Energy efficiency</subject><subject>Genetic algorithms</subject><subject>Heuristic</subject><subject>Integer programming</subject><subject>Job shops</subject><subject>Learning algorithms</subject><subject>Machine learning</subject><subject>Manufacturing</subject><subject>Methods</subject><subject>Operations Research</subject><subject>Optimization</subject><subject>Process controls</subject><subject>Productivity</subject><subject>Rescheduling</subject><subject>Researchers</subject><subject>Scheduling</subject><subject>Sustainability</subject><subject>Systems stability</subject><issn>2071-1050</issn><issn>2071-1050</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpNkU1Lw0AQhhdRsNSe_AMLnkSi-9VkcwyltUqgfp6X3c2mSUmzcTcp5t-bWJHOZeadeXiZYQC4xuie0hg9-A5TQjFFODwDE4IiHGA0R-cn9SWYeb9DQ1CKYxxOQJPA1yA10tVlvYVvxuvCZF01iqRpnJW6gK2FbWHgqjLfpaoMfLYKvhe2gS_ODnoPF3avyl-DZW3ctoeyzsZh1um2PJRtDzdqZ8ba-CtwkcvKm9lfnoLP1fJjsQ7SzePTIkkDTSlpA84Jj0xueIy0zHNMY8NwjgnSodSaccy5DpVmkVJRRrJI6TxiGZ0rxpDSOqNTcHv0LWQlGlfupeuFlaVYJ6kYe4gyFlEWHvDA3hzZ4eCvzvhW7Gzn6mE9QULE8QCScKDujpR21ntn8n9bjMT4AXHyAfoDBg14Sg</recordid><startdate>20211201</startdate><enddate>20211201</enddate><creator>Naimi, Rami</creator><creator>Nouiri, Maroua</creator><creator>Cardin, Olivier</creator><general>MDPI AG</general><general>MDPI</general><scope>AAYXX</scope><scope>CITATION</scope><scope>4U-</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-9035-9660</orcidid><orcidid>https://orcid.org/0000-0002-1664-3858</orcidid></search><sort><creationdate>20211201</creationdate><title>A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives</title><author>Naimi, Rami ; Nouiri, Maroua ; Cardin, Olivier</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c332t-88287efe890caff139e41f120c6acc48188c6bc47bb7d2d7bcf74d35b440bccd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Breakdowns</topic><topic>Computer Science</topic><topic>Cost control</topic><topic>Decision making</topic><topic>Employment</topic><topic>Energy consumption</topic><topic>Energy efficiency</topic><topic>Genetic algorithms</topic><topic>Heuristic</topic><topic>Integer programming</topic><topic>Job shops</topic><topic>Learning algorithms</topic><topic>Machine learning</topic><topic>Manufacturing</topic><topic>Methods</topic><topic>Operations Research</topic><topic>Optimization</topic><topic>Process controls</topic><topic>Productivity</topic><topic>Rescheduling</topic><topic>Researchers</topic><topic>Scheduling</topic><topic>Sustainability</topic><topic>Systems stability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Naimi, Rami</creatorcontrib><creatorcontrib>Nouiri, Maroua</creatorcontrib><creatorcontrib>Cardin, Olivier</creatorcontrib><collection>CrossRef</collection><collection>University Readers</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Sustainability</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Naimi, Rami</au><au>Nouiri, Maroua</au><au>Cardin, Olivier</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives</atitle><jtitle>Sustainability</jtitle><date>2021-12-01</date><risdate>2021</risdate><volume>13</volume><issue>23</issue><spage>13016</spage><pages>13016-</pages><issn>2071-1050</issn><eissn>2071-1050</eissn><abstract>The flexible job shop problem (FJSP) has been studied in recent decades due to its dynamic and uncertain nature. Responding to a system’s perturbation in an intelligent way and with minimum energy consumption variation is an important matter. Fortunately, thanks to the development of artificial intelligence and machine learning, a lot of researchers are using these new techniques to solve the rescheduling problem in a flexible job shop. Reinforcement learning, which is a popular approach in artificial intelligence, is often used in rescheduling. This article presents a Q-learning rescheduling approach to the flexible job shop problem combining energy and productivity objectives in a context of machine failure. First, a genetic algorithm was adopted to generate the initial predictive schedule, and then rescheduling strategies were developed to handle machine failures. As the system should be capable of reacting quickly to unexpected events, a multi-objective Q-learning algorithm is proposed and trained to select the optimal rescheduling methods that minimize the makespan and the energy consumption variation at the same time. This approach was conducted on benchmark instances to evaluate its performance.</abstract><cop>Basel</cop><pub>MDPI AG</pub><doi>10.3390/su132313016</doi><orcidid>https://orcid.org/0000-0002-9035-9660</orcidid><orcidid>https://orcid.org/0000-0002-1664-3858</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2071-1050
ispartof Sustainability, 2021-12, Vol.13 (23), p.13016
issn 2071-1050
2071-1050
language eng
recordid cdi_hal_primary_oai_HAL_hal_03447346v1
source MDPI - Multidisciplinary Digital Publishing Institute; EZB-FREE-00999 freely available EZB journals
subjects Algorithms
Artificial Intelligence
Breakdowns
Computer Science
Cost control
Decision making
Employment
Energy consumption
Energy efficiency
Genetic algorithms
Heuristic
Integer programming
Job shops
Learning algorithms
Machine learning
Manufacturing
Methods
Operations Research
Optimization
Process controls
Productivity
Rescheduling
Researchers
Scheduling
Sustainability
Systems stability
title A Q-Learning Rescheduling Approach to the Flexible Job Shop Problem Combining Energy and Productivity Objectives
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T02%3A04%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Q-Learning%20Rescheduling%20Approach%20to%20the%20Flexible%20Job%20Shop%20Problem%20Combining%20Energy%20and%20Productivity%20Objectives&rft.jtitle=Sustainability&rft.au=Naimi,%20Rami&rft.date=2021-12-01&rft.volume=13&rft.issue=23&rft.spage=13016&rft.pages=13016-&rft.issn=2071-1050&rft.eissn=2071-1050&rft_id=info:doi/10.3390/su132313016&rft_dat=%3Cproquest_hal_p%3E2608144726%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2608144726&rft_id=info:pmid/&rfr_iscdi=true