Reactive scheduling of complex system maintenance in a cooperative environment with communication times

This paper focuses on the problem of complex system maintenance in a cooperative environment composed of several decision centers, taking into account communication times. Maintenance activities generate a specific issue for the scheduling of tasks since they identify, dynamically, new tasks, or mod...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on human-machine systems 2003-05, Vol.33 (2), p.225-234
Hauptverfasser: Le Quere, Y., Sevaux, M., Tahon, C., Trentesaux, D.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 234
container_issue 2
container_start_page 225
container_title IEEE transactions on human-machine systems
container_volume 33
creator Le Quere, Y.
Sevaux, M.
Tahon, C.
Trentesaux, D.
description This paper focuses on the problem of complex system maintenance in a cooperative environment composed of several decision centers, taking into account communication times. Maintenance activities generate a specific issue for the scheduling of tasks since they identify, dynamically, new tasks, or modify the duration of planned tasks. In addition, when an unexpected event is detected by a decision center, some modifications of the schedule required by this decision center may have consequences on tasks under the control of other decision centers. In fact, some constraints exist between the jobs under the control of different decision centers. Each modification of the execution of a job should be submitted to the approval of each concerned decision center, implying a communication time between all these decision centers. Nevertheless, these communication times may not be compatible with desired modifications. This is why we present an algorithm to ensure rescheduling feasibility, including communication times between decision centers for the maintenance of complex systems in a coordinated environment. Finally, we implement our algorithm on the industrial context of the TGV maintenance in the French railway company.
doi_str_mv 10.1109/TSMCC.2003.813344
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_29024854</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1211130</ieee_id><sourcerecordid>901679660</sourcerecordid><originalsourceid>FETCH-LOGICAL-c418t-924250d10ddba568d5db78d9dd68ee392b11f50be80d155be87434ecb64a45b83</originalsourceid><addsrcrecordid>eNqFkU1v1DAQhiNEJcqWH4C4RBxAHLKMP2Mfq1U_kBYhQTlbjjPbdZXYS5xs6b-v0yCQOMBprJnnHcnzFMVrAmtCQH-8-fZ5s1lTALZWhDHOnxWnRAhVUc7p8_wGzSup6_pF8TKlOwDCuWanxe1XtG70RyyT22M7dT7clnFXutgfOvxZpoc0Yl_21ocRgw0OSx9Km-fxgIN9SmI4-iGGHsNY3vtxP4f7KXiXxzGUo-8xnRUnO9slfPWrrorvlxc3m-tq--Xq0-Z8WzlO1FhpyqmAlkDbNlZI1Yq2qVWr21YqRKZpQ8hOQIMqQ0LkWnPG0TWSWy4axVbFh2Xv3nbmMPjeDg8mWm-uz7dm7gGA1Bz0kWT2_cIehvhjwjSa3ieHXWcDxikZDUTWWkrI5Lt_klQD5Urw_4NKyHoWtCre_gXexWkI-TRGqXwDXQuZIbJAbogpDbj7_SMCZtZunrSbWbtZtOfMmyXjEfEPTwkhDNgjL5KpRw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884259756</pqid></control><display><type>article</type><title>Reactive scheduling of complex system maintenance in a cooperative environment with communication times</title><source>IEEE Electronic Library (IEL)</source><creator>Le Quere, Y. ; Sevaux, M. ; Tahon, C. ; Trentesaux, D.</creator><creatorcontrib>Le Quere, Y. ; Sevaux, M. ; Tahon, C. ; Trentesaux, D.</creatorcontrib><description>This paper focuses on the problem of complex system maintenance in a cooperative environment composed of several decision centers, taking into account communication times. Maintenance activities generate a specific issue for the scheduling of tasks since they identify, dynamically, new tasks, or modify the duration of planned tasks. In addition, when an unexpected event is detected by a decision center, some modifications of the schedule required by this decision center may have consequences on tasks under the control of other decision centers. In fact, some constraints exist between the jobs under the control of different decision centers. Each modification of the execution of a job should be submitted to the approval of each concerned decision center, implying a communication time between all these decision centers. Nevertheless, these communication times may not be compatible with desired modifications. This is why we present an algorithm to ensure rescheduling feasibility, including communication times between decision centers for the maintenance of complex systems in a coordinated environment. Finally, we implement our algorithm on the industrial context of the TGV maintenance in the French railway company.</description><identifier>ISSN: 1094-6977</identifier><identifier>ISSN: 2168-2291</identifier><identifier>EISSN: 1558-2442</identifier><identifier>EISSN: 2168-2305</identifier><identifier>DOI: 10.1109/TSMCC.2003.813344</identifier><identifier>CODEN: ITCRFH</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Air transportation ; Algorithms ; Automatic ; Communication system control ; Communication systems ; Complex systems ; Context ; Cybernetics ; Dynamic scheduling ; Dynamical systems ; Engineering Sciences ; Event detection ; Job shop scheduling ; Maintenance ; Mechanical factors ; Rail transportation ; Scheduling ; Studies ; Tasks ; Thermodynamics</subject><ispartof>IEEE transactions on human-machine systems, 2003-05, Vol.33 (2), p.225-234</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2003</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c418t-924250d10ddba568d5db78d9dd68ee392b11f50be80d155be87434ecb64a45b83</citedby><cites>FETCH-LOGICAL-c418t-924250d10ddba568d5db78d9dd68ee392b11f50be80d155be87434ecb64a45b83</cites><orcidid>0000-0003-3855-9072 ; 0000-0003-2489-6203</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1211130$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,781,785,797,886,27929,27930,54763</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1211130$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://hal.science/hal-00069409$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Le Quere, Y.</creatorcontrib><creatorcontrib>Sevaux, M.</creatorcontrib><creatorcontrib>Tahon, C.</creatorcontrib><creatorcontrib>Trentesaux, D.</creatorcontrib><title>Reactive scheduling of complex system maintenance in a cooperative environment with communication times</title><title>IEEE transactions on human-machine systems</title><addtitle>TSMCC</addtitle><description>This paper focuses on the problem of complex system maintenance in a cooperative environment composed of several decision centers, taking into account communication times. Maintenance activities generate a specific issue for the scheduling of tasks since they identify, dynamically, new tasks, or modify the duration of planned tasks. In addition, when an unexpected event is detected by a decision center, some modifications of the schedule required by this decision center may have consequences on tasks under the control of other decision centers. In fact, some constraints exist between the jobs under the control of different decision centers. Each modification of the execution of a job should be submitted to the approval of each concerned decision center, implying a communication time between all these decision centers. Nevertheless, these communication times may not be compatible with desired modifications. This is why we present an algorithm to ensure rescheduling feasibility, including communication times between decision centers for the maintenance of complex systems in a coordinated environment. Finally, we implement our algorithm on the industrial context of the TGV maintenance in the French railway company.</description><subject>Air transportation</subject><subject>Algorithms</subject><subject>Automatic</subject><subject>Communication system control</subject><subject>Communication systems</subject><subject>Complex systems</subject><subject>Context</subject><subject>Cybernetics</subject><subject>Dynamic scheduling</subject><subject>Dynamical systems</subject><subject>Engineering Sciences</subject><subject>Event detection</subject><subject>Job shop scheduling</subject><subject>Maintenance</subject><subject>Mechanical factors</subject><subject>Rail transportation</subject><subject>Scheduling</subject><subject>Studies</subject><subject>Tasks</subject><subject>Thermodynamics</subject><issn>1094-6977</issn><issn>2168-2291</issn><issn>1558-2442</issn><issn>2168-2305</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqFkU1v1DAQhiNEJcqWH4C4RBxAHLKMP2Mfq1U_kBYhQTlbjjPbdZXYS5xs6b-v0yCQOMBprJnnHcnzFMVrAmtCQH-8-fZ5s1lTALZWhDHOnxWnRAhVUc7p8_wGzSup6_pF8TKlOwDCuWanxe1XtG70RyyT22M7dT7clnFXutgfOvxZpoc0Yl_21ocRgw0OSx9Km-fxgIN9SmI4-iGGHsNY3vtxP4f7KXiXxzGUo-8xnRUnO9slfPWrrorvlxc3m-tq--Xq0-Z8WzlO1FhpyqmAlkDbNlZI1Yq2qVWr21YqRKZpQ8hOQIMqQ0LkWnPG0TWSWy4axVbFh2Xv3nbmMPjeDg8mWm-uz7dm7gGA1Bz0kWT2_cIehvhjwjSa3ieHXWcDxikZDUTWWkrI5Lt_klQD5Urw_4NKyHoWtCre_gXexWkI-TRGqXwDXQuZIbJAbogpDbj7_SMCZtZunrSbWbtZtOfMmyXjEfEPTwkhDNgjL5KpRw</recordid><startdate>20030501</startdate><enddate>20030501</enddate><creator>Le Quere, Y.</creator><creator>Sevaux, M.</creator><creator>Tahon, C.</creator><creator>Trentesaux, D.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>H8D</scope><scope>F28</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0003-3855-9072</orcidid><orcidid>https://orcid.org/0000-0003-2489-6203</orcidid></search><sort><creationdate>20030501</creationdate><title>Reactive scheduling of complex system maintenance in a cooperative environment with communication times</title><author>Le Quere, Y. ; Sevaux, M. ; Tahon, C. ; Trentesaux, D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c418t-924250d10ddba568d5db78d9dd68ee392b11f50be80d155be87434ecb64a45b83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Air transportation</topic><topic>Algorithms</topic><topic>Automatic</topic><topic>Communication system control</topic><topic>Communication systems</topic><topic>Complex systems</topic><topic>Context</topic><topic>Cybernetics</topic><topic>Dynamic scheduling</topic><topic>Dynamical systems</topic><topic>Engineering Sciences</topic><topic>Event detection</topic><topic>Job shop scheduling</topic><topic>Maintenance</topic><topic>Mechanical factors</topic><topic>Rail transportation</topic><topic>Scheduling</topic><topic>Studies</topic><topic>Tasks</topic><topic>Thermodynamics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Le Quere, Y.</creatorcontrib><creatorcontrib>Sevaux, M.</creatorcontrib><creatorcontrib>Tahon, C.</creatorcontrib><creatorcontrib>Trentesaux, D.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Mechanical &amp; 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><collection>Aerospace Database</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>IEEE transactions on human-machine systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Le Quere, Y.</au><au>Sevaux, M.</au><au>Tahon, C.</au><au>Trentesaux, D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reactive scheduling of complex system maintenance in a cooperative environment with communication times</atitle><jtitle>IEEE transactions on human-machine systems</jtitle><stitle>TSMCC</stitle><date>2003-05-01</date><risdate>2003</risdate><volume>33</volume><issue>2</issue><spage>225</spage><epage>234</epage><pages>225-234</pages><issn>1094-6977</issn><issn>2168-2291</issn><eissn>1558-2442</eissn><eissn>2168-2305</eissn><coden>ITCRFH</coden><abstract>This paper focuses on the problem of complex system maintenance in a cooperative environment composed of several decision centers, taking into account communication times. Maintenance activities generate a specific issue for the scheduling of tasks since they identify, dynamically, new tasks, or modify the duration of planned tasks. In addition, when an unexpected event is detected by a decision center, some modifications of the schedule required by this decision center may have consequences on tasks under the control of other decision centers. In fact, some constraints exist between the jobs under the control of different decision centers. Each modification of the execution of a job should be submitted to the approval of each concerned decision center, implying a communication time between all these decision centers. Nevertheless, these communication times may not be compatible with desired modifications. This is why we present an algorithm to ensure rescheduling feasibility, including communication times between decision centers for the maintenance of complex systems in a coordinated environment. Finally, we implement our algorithm on the industrial context of the TGV maintenance in the French railway company.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TSMCC.2003.813344</doi><tpages>10</tpages><orcidid>https://orcid.org/0000-0003-3855-9072</orcidid><orcidid>https://orcid.org/0000-0003-2489-6203</orcidid></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1094-6977
ispartof IEEE transactions on human-machine systems, 2003-05, Vol.33 (2), p.225-234
issn 1094-6977
2168-2291
1558-2442
2168-2305
language eng
recordid cdi_proquest_miscellaneous_29024854
source IEEE Electronic Library (IEL)
subjects Air transportation
Algorithms
Automatic
Communication system control
Communication systems
Complex systems
Context
Cybernetics
Dynamic scheduling
Dynamical systems
Engineering Sciences
Event detection
Job shop scheduling
Maintenance
Mechanical factors
Rail transportation
Scheduling
Studies
Tasks
Thermodynamics
title Reactive scheduling of complex system maintenance in a cooperative environment with communication times
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T07%3A06%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reactive%20scheduling%20of%20complex%20system%20maintenance%20in%20a%20cooperative%20environment%20with%20communication%20times&rft.jtitle=IEEE%20transactions%20on%20human-machine%20systems&rft.au=Le%20Quere,%20Y.&rft.date=2003-05-01&rft.volume=33&rft.issue=2&rft.spage=225&rft.epage=234&rft.pages=225-234&rft.issn=1094-6977&rft.eissn=1558-2442&rft.coden=ITCRFH&rft_id=info:doi/10.1109/TSMCC.2003.813344&rft_dat=%3Cproquest_RIE%3E901679660%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884259756&rft_id=info:pmid/&rft_ieee_id=1211130&rfr_iscdi=true