Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502589
J. Hernández-Ambato, J. Rodríguez-Flores, J. Cortes-Llanganate, F. Cabrera-Aguayo
The present document describes the methodology used for the design and implementation of a temperature control system for the oven of a plastic thermoforming machine. This work departs from the utilization of graphics methods for the approximation of the transfer function of the plant using experimental data. The best-obtained model was used for the designing of a proportional-integral (PI) classic controller and classic PI no-lineal with anti-windup. The PI controller with anti-windup effect presented a suitable control action over the plant, which was combined with an AC/AC converter by integral cycle for the control of the process variable. Evaluation testing on the control system showed a temperature variation in the oven lower than ${pm 2}$ °C. Even more, the application of this work on the real plant contributed for improvement of the dimensional stability of final products in 81.82%.
{"title":"Classic Controllers Design Applied to Temperature Control for a Plastic Thermoforming Machine","authors":"J. Hernández-Ambato, J. Rodríguez-Flores, J. Cortes-Llanganate, F. Cabrera-Aguayo","doi":"10.1109/ETFA.2018.8502589","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502589","url":null,"abstract":"The present document describes the methodology used for the design and implementation of a temperature control system for the oven of a plastic thermoforming machine. This work departs from the utilization of graphics methods for the approximation of the transfer function of the plant using experimental data. The best-obtained model was used for the designing of a proportional-integral (PI) classic controller and classic PI no-lineal with anti-windup. The PI controller with anti-windup effect presented a suitable control action over the plant, which was combined with an AC/AC converter by integral cycle for the control of the process variable. Evaluation testing on the control system showed a temperature variation in the oven lower than ${pm 2}$ °C. Even more, the application of this work on the real plant contributed for improvement of the dimensional stability of final products in 81.82%.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"119 1","pages":"551-558"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74652564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502621
Zain Alabedin Haj Hammadeh, R. Ernst
Communication resources often exist in distributed real-time systems, therefore, providing guarantees on a predefined end-to-end deadline requires a timing analysis of the communication resource. Worst-case response time analysis techniques for guaranteeing the system's schedulability are not expressive enough for weakly-hard real-time systems. In weakly-hard real-time systems, the timing analysis ought to ensure that the distribution of the system deadline misses/mets is precisely bounded. In this paper, we compute weakly-hard real-time guarantees in the form of a deadline miss model using Typical Worst-Case Analysis for real-time messages with weighted round-robin scheduling. We evaluate the proposed analysis's scalability and the tightness of the computed deadline miss models. We illustrate also the applicability of our analysis in an industrial case study.
{"title":"Weakly-Hard Real-Time Guarantees for Weighted Round-Robin Scheduling of Real-Time Messages","authors":"Zain Alabedin Haj Hammadeh, R. Ernst","doi":"10.1109/ETFA.2018.8502621","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502621","url":null,"abstract":"Communication resources often exist in distributed real-time systems, therefore, providing guarantees on a predefined end-to-end deadline requires a timing analysis of the communication resource. Worst-case response time analysis techniques for guaranteeing the system's schedulability are not expressive enough for weakly-hard real-time systems. In weakly-hard real-time systems, the timing analysis ought to ensure that the distribution of the system deadline misses/mets is precisely bounded. In this paper, we compute weakly-hard real-time guarantees in the form of a deadline miss model using Typical Worst-Case Analysis for real-time messages with weighted round-robin scheduling. We evaluate the proposed analysis's scalability and the tightness of the computed deadline miss models. We illustrate also the applicability of our analysis in an industrial case study.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"65 1","pages":"384-391"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73590154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/etfa.2018.8502477
{"title":"WIP Cyber-Physical Systems and Smart Networked Systems","authors":"","doi":"10.1109/etfa.2018.8502477","DOIUrl":"https://doi.org/10.1109/etfa.2018.8502477","url":null,"abstract":"","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"30 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74558832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502640
F. Acerbi, G. Nicolao
In this paper, the calibration of the parameters of the Gordon-Ng Universal (GNU) chiller model is investigated. In its standard formulation, the GNU model is written as a linear-in-parameter model that can be calibrated by Ordinary Least Squares. It has been already observed elsewhere that, since the regressors are subject to measurement inaccuracies, the OLS approach is prone to yield biased estimates of the parameters. As a remedy, Andersen and Reddy proposed the adoption of an Errors in Variable (EIV) framework, showing that bias could be reduced or even eliminated by means of a corrected least squares algorithm. However, some questions remained open. Given that the EIV approach achieves bias reduction at the cost of increasing the variance, is it really preferable to OLS? If the final goal is not parameter estimation, but the prediction of the Coefficient of Performance (COP), how does OLS compare with EIV? And what is the most appropriate calibration method, under a statistical viewpoint? Finally, is the added complexity of a statistically rigorous approach employing Nonlinear Least Squares (NLS) really worth the potential improvements in COP prediction? In order to answer these questions, three estimation methods, OLS, EIV and NLS, are tested on two benchmarks: a public precise chiller performance dataset and an ASHRAE dataset. The results suggest, that OLS estimation, in spite of its suboptimality, may prove largely satisfactory both for parameter estimation and COP prediction, although it may be worth analyzing other more challenging COP prediction problem before the final word is said.
本文研究了Gordon-Ng通用型(GNU)制冷机模型参数的标定问题。在其标准公式中，GNU模型被写成一个参数线性模型，可以通过普通最小二乘进行校准。在其他地方已经观察到，由于回归量受到测量不准确性的影响，OLS方法容易产生有偏差的参数估计。作为补救措施，Andersen和Reddy提出采用变量误差(Errors in Variable, EIV)框架，表明通过修正的最小二乘算法可以减少甚至消除偏差。然而，一些问题仍然悬而未决。考虑到EIV方法以增加方差为代价实现了偏差减少，它真的比OLS更好吗?如果最终目标不是参数估计，而是性能系数(COP)的预测，OLS与EIV相比如何?从统计学的角度来看，什么是最合适的校准方法?最后，采用非线性最小二乘(NLS)的统计严谨方法所增加的复杂性是否真的值得COP预测的潜在改进?为了回答这些问题，三种估计方法，OLS, EIV和NLS，在两个基准上进行了测试:公共精确冷水机组性能数据集和ASHRAE数据集。结果表明，尽管OLS估计具有次优性，但在参数估计和COP预测方面可能在很大程度上令人满意，尽管在最后说之前可能值得分析其他更具挑战性的COP预测问题。
{"title":"Identification of the Gordon- Ng Chiller Model: Linear or Nonlinear Least Squares?","authors":"F. Acerbi, G. Nicolao","doi":"10.1109/ETFA.2018.8502640","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502640","url":null,"abstract":"In this paper, the calibration of the parameters of the Gordon-Ng Universal (GNU) chiller model is investigated. In its standard formulation, the GNU model is written as a linear-in-parameter model that can be calibrated by Ordinary Least Squares. It has been already observed elsewhere that, since the regressors are subject to measurement inaccuracies, the OLS approach is prone to yield biased estimates of the parameters. As a remedy, Andersen and Reddy proposed the adoption of an Errors in Variable (EIV) framework, showing that bias could be reduced or even eliminated by means of a corrected least squares algorithm. However, some questions remained open. Given that the EIV approach achieves bias reduction at the cost of increasing the variance, is it really preferable to OLS? If the final goal is not parameter estimation, but the prediction of the Coefficient of Performance (COP), how does OLS compare with EIV? And what is the most appropriate calibration method, under a statistical viewpoint? Finally, is the added complexity of a statistically rigorous approach employing Nonlinear Least Squares (NLS) really worth the potential improvements in COP prediction? In order to answer these questions, three estimation methods, OLS, EIV and NLS, are tested on two benchmarks: a public precise chiller performance dataset and an ASHRAE dataset. The results suggest, that OLS estimation, in spite of its suboptimality, may prove largely satisfactory both for parameter estimation and COP prediction, although it may be worth analyzing other more challenging COP prediction problem before the final word is said.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"11 1","pages":"1314-1321"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80217966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502595
M. Kramer, Florian Gerstmayer, Jürgen Hausladen
Over the last decades, cars have become more and more prevalent and play an important role in our modern society. With the continuously growing number of vehicles, also the probability for road accidents and traffic congestions increases. Car2X communication in traffic infrastructure is a key enabler of many technologies yet to come, such as autonomous driving. Allowing and enabling the exchange of data from various cars and their respective environment provides amongst other possibilities - increased road safety and congestion avoidance. Several standards already exist which define the structure of messages and how they have to be signed - with elliptic curve based signatures. This signature is to be verified, ensuring authenticity and integrity so no “malicious” car can i.e. impersonate an emergency vehicle or sham an accident. However, validating an elliptic curve signature in such a field of application requires appropriate performance to ensure necessary throughput. In other words, cars and roadside equipment must be up to the task to process messages fast enough to prevent any harm, like traffic lights being switched too late or cars not being informed in time of an accident ahead. This paper shall show typical performance for out of the box embedded hardware, likely to be used for such equipment. Furthermore it will compare OpenSSL and mbedTLS regarding their performance and it will give optimization advices to maximize verification throughput.
{"title":"Evaluation of Libraries and Typical Embedded Systems for ECDSA Signature Verification for Car2X Communication","authors":"M. Kramer, Florian Gerstmayer, Jürgen Hausladen","doi":"10.1109/ETFA.2018.8502595","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502595","url":null,"abstract":"Over the last decades, cars have become more and more prevalent and play an important role in our modern society. With the continuously growing number of vehicles, also the probability for road accidents and traffic congestions increases. Car2X communication in traffic infrastructure is a key enabler of many technologies yet to come, such as autonomous driving. Allowing and enabling the exchange of data from various cars and their respective environment provides amongst other possibilities - increased road safety and congestion avoidance. Several standards already exist which define the structure of messages and how they have to be signed - with elliptic curve based signatures. This signature is to be verified, ensuring authenticity and integrity so no “malicious” car can i.e. impersonate an emergency vehicle or sham an accident. However, validating an elliptic curve signature in such a field of application requires appropriate performance to ensure necessary throughput. In other words, cars and roadside equipment must be up to the task to process messages fast enough to prevent any harm, like traffic lights being switched too late or cars not being informed in time of an accident ahead. This paper shall show typical performance for out of the box embedded hardware, likely to be used for such equipment. Furthermore it will compare OpenSSL and mbedTLS regarding their performance and it will give optimization advices to maximize verification throughput.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"21 1","pages":"1123-1126"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79182298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502553
Frederick Prinz, Michael Schoeffler, A. Lechler, A. Verl
To increase the changeability of future production systems, assets have to provide a standardized representation of their capabilities. Therefore, the concept of I4.0 components was developed, which describes assets with an asset administration shell providing a self-description. Real-time I4.0 components, like safety critical systems or motion control applications, require a deterministic communication with bounded low latency. Moreover, they demand for redundant connections to achieve fault tolerance with respect to the network infrastructure and the components. The integration of redundancy mechanisms in realtime I4.0 components requires additional implementation and configuration effort, which has not been covered in detail yet. In this work, we extend the concept of asset administration shells to configure end-to-end redundancy between real-time I4.0 components. Thereby, we apply the new real-time communication technology Time-Sensitive Networking (TSN) with focus on the standard IEEE 802.1CB. Finally, we evaluate the performance of the redundancy implementation in terms of the transmission offset between the primary frame and its duplicate.
{"title":"End-to-end Redundancy between Real-time I4.0 Components based on Time-Sensitive Networking","authors":"Frederick Prinz, Michael Schoeffler, A. Lechler, A. Verl","doi":"10.1109/ETFA.2018.8502553","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502553","url":null,"abstract":"To increase the changeability of future production systems, assets have to provide a standardized representation of their capabilities. Therefore, the concept of I4.0 components was developed, which describes assets with an asset administration shell providing a self-description. Real-time I4.0 components, like safety critical systems or motion control applications, require a deterministic communication with bounded low latency. Moreover, they demand for redundant connections to achieve fault tolerance with respect to the network infrastructure and the components. The integration of redundancy mechanisms in realtime I4.0 components requires additional implementation and configuration effort, which has not been covered in detail yet. In this work, we extend the concept of asset administration shells to configure end-to-end redundancy between real-time I4.0 components. Thereby, we apply the new real-time communication technology Time-Sensitive Networking (TSN) with focus on the standard IEEE 802.1CB. Finally, we evaluate the performance of the redundancy implementation in terms of the transmission offset between the primary frame and its duplicate.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"22 1","pages":"1083-1086"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81628482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502532
F. Basile, G. Tommasi, C. Sterle, Abderraouf Boussif, M. Ghazel
Diagnosability of faults in discrete event systems modeled with Petri nets can be assessed either via graph-based techniques (also called diagnoser, verifier/twin-plant based techniques), or via the solution of optimization problems. The approaches that belong to the former class are based on the analysis of the net reachability or coverability graphs (or of a more compact version of them). The latter approach exploits the mathematical representation of the net itself to specify and solve optimization problems, which are usually expressed as integer linear programming (ILP) problems. In this paper we exploit the railway Petri net model originally proposed in [16], and extended in [14] to be used as a benchmark for diagnosability analysis, to assess the efficiency of the approach based on the solution of ILP problems proposed in [3]. In order to show the effectiveness of the proposed technique, a comparison with a graph-based approach for analyzing diagnosability is also presented.
{"title":"Efficient diagnosability assessment via ILP optimization: a railway benchmark","authors":"F. Basile, G. Tommasi, C. Sterle, Abderraouf Boussif, M. Ghazel","doi":"10.1109/ETFA.2018.8502532","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502532","url":null,"abstract":"Diagnosability of faults in discrete event systems modeled with Petri nets can be assessed either via graph-based techniques (also called diagnoser, verifier/twin-plant based techniques), or via the solution of optimization problems. The approaches that belong to the former class are based on the analysis of the net reachability or coverability graphs (or of a more compact version of them). The latter approach exploits the mathematical representation of the net itself to specify and solve optimization problems, which are usually expressed as integer linear programming (ILP) problems. In this paper we exploit the railway Petri net model originally proposed in [16], and extended in [14] to be used as a benchmark for diagnosability analysis, to assess the efficiency of the approach based on the solution of ILP problems proposed in [3]. In order to show the effectiveness of the proposed technique, a comparison with a graph-based approach for analyzing diagnosability is also presented.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"1 1","pages":"441-448"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81640299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502506
Stefan Windmann, O. Niggemann
The complexity of industrial production systems is steadily growing. Hence, the plant stuff has to search in an increasing number of documents within the daily work routine, e.g. in manuals, commissioning instructions, service notes, shift books, process data, repair instructions, data sheets, R/I flow charts, CAD drawings etc. To support the plant stuff, an intelligent search engine for industrial production environments is proposed in this paper. Characteristics of the developed search engine with respect to the domain of industrial production environments, e.g. tailored synonym replacements and document classifications, are outlined. Particularly, two methods for document classifications, a k-nearest-neighbor classifier and a Naive Bayes classifier, are evaluated with documents from industrial production environments.
{"title":"Information Retrieval in Industrial Production Environments","authors":"Stefan Windmann, O. Niggemann","doi":"10.1109/ETFA.2018.8502506","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502506","url":null,"abstract":"The complexity of industrial production systems is steadily growing. Hence, the plant stuff has to search in an increasing number of documents within the daily work routine, e.g. in manuals, commissioning instructions, service notes, shift books, process data, repair instructions, data sheets, R/I flow charts, CAD drawings etc. To support the plant stuff, an intelligent search engine for industrial production environments is proposed in this paper. Characteristics of the developed search engine with respect to the domain of industrial production environments, e.g. tailored synonym replacements and document classifications, are outlined. Particularly, two methods for document classifications, a k-nearest-neighbor classifier and a Naive Bayes classifier, are evaluated with documents from industrial production environments.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"29 1","pages":"1205-1208"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84316492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502494
Niels Hendrik Fliedner, U. Meier, T. Neugebauer
Wireless industrial environments are dominated by multipath propagation and interference. In order to handle spatial diversity, a possible approach is dividing the physical area into many small cells. The spatial diversity is turned into FDMA by utilizing different frequency bands for neighboring cells. A challenging use case with fast vehicles traveling over long distances in a short time is the packaging industry. It would require many fast handoffs for each vehicle. Thus, a small cell FDMA approach is not appropriate. Conversely, employing radiating lines eliminates FDMA-based handoff issues, and reduces multipath delay spread and signal attenuation compared to centralized approaches. Additionally, radiating lines perform well in high-speed, low-power and long-range environments. In this paper, we realize a novel radiating-line-based, high-reliable, real-time transmission system with near-field coupling. This wireless transmission method results in a frequency-flat, time-invariant radio channel for the given requirements. Employing antenna diversity results in significant improvements in the system's performance compared to single antenna solutions.
{"title":"Performance Analysis of a High-Reliable Real-Time Wireless Transmission System with Near Field Coupling","authors":"Niels Hendrik Fliedner, U. Meier, T. Neugebauer","doi":"10.1109/ETFA.2018.8502494","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502494","url":null,"abstract":"Wireless industrial environments are dominated by multipath propagation and interference. In order to handle spatial diversity, a possible approach is dividing the physical area into many small cells. The spatial diversity is turned into FDMA by utilizing different frequency bands for neighboring cells. A challenging use case with fast vehicles traveling over long distances in a short time is the packaging industry. It would require many fast handoffs for each vehicle. Thus, a small cell FDMA approach is not appropriate. Conversely, employing radiating lines eliminates FDMA-based handoff issues, and reduces multipath delay spread and signal attenuation compared to centralized approaches. Additionally, radiating lines perform well in high-speed, low-power and long-range environments. In this paper, we realize a novel radiating-line-based, high-reliable, real-time transmission system with near-field coupling. This wireless transmission method results in a frequency-flat, time-invariant radio channel for the given requirements. Employing antenna diversity results in significant improvements in the system's performance compared to single antenna solutions.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"25 1","pages":"1091-1094"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84516964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502462
A. Ladj, F. B. Tayeb, C. Varnier
We tackle in this paper the Permutation Flow-shop Scheduling Problem (PFSP) with predictive maintenance interventions. The objective is to propose an integrated model that coordinates production schedule and predictive maintenance planning so that the total time to complete the schedule after predictive maintenance insertion is minimized. Predictive maintenance interventions are scheduled based on Prognostics and Health Management (PHM) results using a new proposed heuristic. To jointly establish an integrated scheduling of production jobs and predictive maintenance actions, we propose a tailored genetic algorithm incorporating properly designed operators. Computational experiments carried out on Taillard well known benchmarks, to which we add both PHM and maintenance data, show the efficiency of the newly proposed maintenance planning heuristic and genetic algorithm.
{"title":"Tailored Genetic Algorithm for Scheduling Jobs and Predictive Maintenance in a Permutation Flowshop","authors":"A. Ladj, F. B. Tayeb, C. Varnier","doi":"10.1109/ETFA.2018.8502462","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502462","url":null,"abstract":"We tackle in this paper the Permutation Flow-shop Scheduling Problem (PFSP) with predictive maintenance interventions. The objective is to propose an integrated model that coordinates production schedule and predictive maintenance planning so that the total time to complete the schedule after predictive maintenance insertion is minimized. Predictive maintenance interventions are scheduled based on Prognostics and Health Management (PHM) results using a new proposed heuristic. To jointly establish an integrated scheduling of production jobs and predictive maintenance actions, we propose a tailored genetic algorithm incorporating properly designed operators. Computational experiments carried out on Taillard well known benchmarks, to which we add both PHM and maintenance data, show the efficiency of the newly proposed maintenance planning heuristic and genetic algorithm.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"65 2 1","pages":"524-531"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85580846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：