Pub Date : 1900-01-01DOI: 10.5220/0010654900003062
David Govi, Alessandro Rizzuto, F. Schipani, Alessandro Lazzeri
: Inspired by industrial issues and demands, we define a novel version of the Flexible Job Shop Scheduling Problem with Working Center. A working center is a group of machines performing the same type of operation. The job operations of different types follow a strict sequence across the working centers, while any order is allowed among operations of the same type. This paper illustrates a genetic algorithm with a two-stage chromosome representation, adapted genetic operators, local search, and social disaster technique to deal with a real-world industrial application. The algorithm has been tested on a classical benchmark to assess its adaptability and compare its performance with state-of-the-art techniques; then, we tested different variations of the proposed algorithm on a real-case test instance showing a consistent improvement when compared with the heuristic in use at the industrial company.
{"title":"A Two-stage Genetic Algorithm for a Novel FJSP with Working Centers in a Real-world Industrial Application","authors":"David Govi, Alessandro Rizzuto, F. Schipani, Alessandro Lazzeri","doi":"10.5220/0010654900003062","DOIUrl":"https://doi.org/10.5220/0010654900003062","url":null,"abstract":": Inspired by industrial issues and demands, we define a novel version of the Flexible Job Shop Scheduling Problem with Working Center. A working center is a group of machines performing the same type of operation. The job operations of different types follow a strict sequence across the working centers, while any order is allowed among operations of the same type. This paper illustrates a genetic algorithm with a two-stage chromosome representation, adapted genetic operators, local search, and social disaster technique to deal with a real-world industrial application. The algorithm has been tested on a classical benchmark to assess its adaptability and compare its performance with state-of-the-art techniques; then, we tested different variations of the proposed algorithm on a real-case test instance showing a consistent improvement when compared with the heuristic in use at the industrial company.","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121655354","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 : 1900-01-01DOI: 10.5220/0011589900003329
Matteo De Marchi, Rafael A. Rojas, B. Mark, T. Aruväli, E. Rauch, D. Matt
{"title":"Digital Twin Architecture of a Cyber-physical Assembly Transfer System","authors":"Matteo De Marchi, Rafael A. Rojas, B. Mark, T. Aruväli, E. Rauch, D. Matt","doi":"10.5220/0011589900003329","DOIUrl":"https://doi.org/10.5220/0011589900003329","url":null,"abstract":"","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124033085","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 : 1900-01-01DOI: 10.5220/0010676800003062
Andreas Höpfner, Olaf Poenicke, C. Blobner, Andre Winge
: The paper describes research and development for dynamic 3D models and Virtual Reality (VR) applications in the context of port processes. The work described is carried out in the currently ongoing EU-funded project PortForward . The paper addresses the use of VR technologies in the context of industrial applications and describes how dynamic sensor data can be integrated into a 3D model of a Port. In addition to tracking data of moving assets, the sensor data mainly comprises 3D measurement data from LiDAR sensors. These sensors are installed in the port infrastructure to automatically record the current occupancy status of storage areas. The measurement data from the LiDAR sensors are dynamically integrated into the VR model in an abstracted form together process related meta-data to reflect the current process status in the port terminal. Based on that approach in the sense of a Virtual Twin, process flows and storage space management can be optimized. The use of VR technologies is crucial in this context in order to depict the complex spatial and dynamic process situation in an intuitive way.
{"title":"Use of a Virtual Twin for Dynamic Storage Space Monitoring in a Port Terminal","authors":"Andreas Höpfner, Olaf Poenicke, C. Blobner, Andre Winge","doi":"10.5220/0010676800003062","DOIUrl":"https://doi.org/10.5220/0010676800003062","url":null,"abstract":": The paper describes research and development for dynamic 3D models and Virtual Reality (VR) applications in the context of port processes. The work described is carried out in the currently ongoing EU-funded project PortForward . The paper addresses the use of VR technologies in the context of industrial applications and describes how dynamic sensor data can be integrated into a 3D model of a Port. In addition to tracking data of moving assets, the sensor data mainly comprises 3D measurement data from LiDAR sensors. These sensors are installed in the port infrastructure to automatically record the current occupancy status of storage areas. The measurement data from the LiDAR sensors are dynamically integrated into the VR model in an abstracted form together process related meta-data to reflect the current process status in the port terminal. Based on that approach in the sense of a Virtual Twin, process flows and storage space management can be optimized. The use of VR technologies is crucial in this context in order to depict the complex spatial and dynamic process situation in an intuitive way.","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121210703","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 : 1900-01-01DOI: 10.5220/0010738300003062
C. Markarian
: The Online Set Cover problem (OSC) and its variations are one of the most well-studied optimization problems in operations research and computer science. In OSC, we are given a universe of elements and a collection of subsets of the universe. Each subset is associated with a cost. As elements arrive over time, the algorithm purchases subsets to cover these elements. In each step, an element arrives, and the algorithm needs to ensure that at the end of the step, there is at least one purchased subset that contains the element. The goal is to minimize the total cost of purchased subsets. In this paper, we study a generalization of OSC, in which a request consisting of a number of elements arrives in each step. Each request is associated with a happiness cost. A request is served by either a single subset containing all of its elements or by a number of subsets jointly containing all of its elements. In the latter case, the algorithm needs to pay the happiness cost associated with the request. The goal is to serve all requests upon their arrival while minimizing the total cost of purchased subsets and happiness costs paid. This problem is motivated by intrinsic service-providing scenarios in which clients need not only be served but are to be satisfied with the service. Keeping clients happy by serving them with one service provider rather than many, is represented by happiness costs. We refer to this problem as Online Set Cover With Happiness Costs (OSC-HC) and design the first online algorithm, which is optimal under the competitive analysis framework. The latter is a worst-case analysis framework and the standard to measure online algorithms. It compares, for all instances of the problem, the performance of the online algorithm to that of the optimal offline algorithm that is given all the input sequence at once and is optimal.
在线集覆盖问题(Online Set Cover problem, OSC)及其变体是运筹学和计算机科学中研究最多的优化问题之一。在OSC中，我们得到一个元素的集合和这个元素的子集的集合。每个子集都与一个成本相关联。随着时间的推移，元素到达，算法购买子集来覆盖这些元素。在每一步中，都有一个元素到达，算法需要确保在步骤结束时，至少有一个已购买的子集包含该元素。目标是最小化购买子集的总成本。在本文中，我们研究了一种一般化的OSC，其中每一步都有一个由多个元素组成的请求到达。每个请求都与幸福成本相关联。请求可以由包含其所有元素的单个子集提供服务，也可以由包含其所有元素的多个子集共同提供服务。在后一种情况下，算法需要支付与请求相关的幸福成本。目标是在所有请求到达时提供服务，同时最小化购买子集的总成本和支付的幸福成本。这个问题是由内在的服务提供场景引起的，在这些场景中，客户端不仅需要服务，而且还需要对服务感到满意。通过选择一家服务提供商而不是多家，来保持客户的满意度，这是幸福成本的体现。我们将此问题称为带有幸福成本的在线集覆盖(OSC-HC)，并设计了第一个在线算法，该算法在竞争分析框架下是最优的。后者是最坏情况分析框架和衡量在线算法的标准。对于问题的所有实例，它将在线算法的性能与最优离线算法的性能进行比较，离线算法一次给定所有输入序列并且是最优的。
{"title":"Online Set Cover with Happiness Costs","authors":"C. Markarian","doi":"10.5220/0010738300003062","DOIUrl":"https://doi.org/10.5220/0010738300003062","url":null,"abstract":": The Online Set Cover problem (OSC) and its variations are one of the most well-studied optimization problems in operations research and computer science. In OSC, we are given a universe of elements and a collection of subsets of the universe. Each subset is associated with a cost. As elements arrive over time, the algorithm purchases subsets to cover these elements. In each step, an element arrives, and the algorithm needs to ensure that at the end of the step, there is at least one purchased subset that contains the element. The goal is to minimize the total cost of purchased subsets. In this paper, we study a generalization of OSC, in which a request consisting of a number of elements arrives in each step. Each request is associated with a happiness cost. A request is served by either a single subset containing all of its elements or by a number of subsets jointly containing all of its elements. In the latter case, the algorithm needs to pay the happiness cost associated with the request. The goal is to serve all requests upon their arrival while minimizing the total cost of purchased subsets and happiness costs paid. This problem is motivated by intrinsic service-providing scenarios in which clients need not only be served but are to be satisfied with the service. Keeping clients happy by serving them with one service provider rather than many, is represented by happiness costs. We refer to this problem as Online Set Cover With Happiness Costs (OSC-HC) and design the first online algorithm, which is optimal under the competitive analysis framework. The latter is a worst-case analysis framework and the standard to measure online algorithms. It compares, for all instances of the problem, the performance of the online algorithm to that of the optimal offline algorithm that is given all the input sequence at once and is optimal.","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125995071","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 : 1900-01-01DOI: 10.5220/0011527200003329
S. Schäfer, Dirk Schöttke, T. Kämpfe, O. Lachmann, Aaron Zielstorff, Bernd Tauber
{"title":"Industrial Controls and Asset Administration Shells: An Approach to the Synchronization of Plant Segments","authors":"S. Schäfer, Dirk Schöttke, T. Kämpfe, O. Lachmann, Aaron Zielstorff, Bernd Tauber","doi":"10.5220/0011527200003329","DOIUrl":"https://doi.org/10.5220/0011527200003329","url":null,"abstract":"","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114993943","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 : 1900-01-01DOI: 10.5220/0010709000003062
Y. Naudet, Alexandre Baudet, Margot Risse
: Digital Twins originally concern technical systems and do not yet integrate human elements properly. This limits their quality and usefulness when we consider systems where machines and human workers still cohabit. This paper presents the concept of Human Digital Twin (HDT), the human equivalent of a Digital Twin (DT), which aim at being coupled with DTs of technical elements in systems where humans play a role. We detail the state of the art on the subject, propose a definition for HDT and a preliminary human model, bringing foundations for handling the human factor in industry with digital twins.
{"title":"Human Digital Twin in Industry 4.0: Concept and Preliminary Model","authors":"Y. Naudet, Alexandre Baudet, Margot Risse","doi":"10.5220/0010709000003062","DOIUrl":"https://doi.org/10.5220/0010709000003062","url":null,"abstract":": Digital Twins originally concern technical systems and do not yet integrate human elements properly. This limits their quality and usefulness when we consider systems where machines and human workers still cohabit. This paper presents the concept of Human Digital Twin (HDT), the human equivalent of a Digital Twin (DT), which aim at being coupled with DTs of technical elements in systems where humans play a role. We detail the state of the art on the subject, propose a definition for HDT and a preliminary human model, bringing foundations for handling the human factor in industry with digital twins.","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127957144","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 : 1900-01-01DOI: 10.5220/0011543900003329
Petri Kannisto, David Hästbacka
{"title":"Digitalized Cross-organizational Interoperability in Industrial Business Ecosystems: Implications and Models for Process Industry","authors":"Petri Kannisto, David Hästbacka","doi":"10.5220/0011543900003329","DOIUrl":"https://doi.org/10.5220/0011543900003329","url":null,"abstract":"","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129907762","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 : 1900-01-01DOI: 10.5220/0011561400003329
Fatih Yallıç, Özlem Albayrak, Perin Ünal
{"title":"Asset Administration Shell Generation and Usage for Digital Twins: A Case Study for Non-destructive Testing","authors":"Fatih Yallıç, Özlem Albayrak, Perin Ünal","doi":"10.5220/0011561400003329","DOIUrl":"https://doi.org/10.5220/0011561400003329","url":null,"abstract":"","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130323799","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 : 1900-01-01DOI: 10.1007/978-3-031-37228-5_7
Christine Markarian, Peter Khallouf
{"title":"Online Facility Location Problems Inspired by the COVID-19 Pandemic","authors":"Christine Markarian, Peter Khallouf","doi":"10.1007/978-3-031-37228-5_7","DOIUrl":"https://doi.org/10.1007/978-3-031-37228-5_7","url":null,"abstract":"","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130707640","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 : 1900-01-01DOI: 10.5220/0010688700003062
Philip Stahmann, A. Krüger, Bodo Rieger
: Digital twins are virtual copies of production systems’ physical components. In Industrie 4.0, they represent a promising opportunity for analysing production data in real-time and contribute to improved production planning and control. However, development of digital twins is challenging for companies due to missing guidance. In this research paper, we identify four maturity levels for digital twins for real-time data analysis based on a structured literature review and a market analysis that resulted in a total of 82 analysed contributions. The results are evaluated through a qualitative interview with four experts from academia and practice. Manufacturing companies can use the maturity levels for self-assessment and as a guideline. Future research can use the maturity levels for integration into holistic maturity models.
{"title":"Digital Twins for Real-time Data Analysis in Industrie 4.0: Pathways to Maturity","authors":"Philip Stahmann, A. Krüger, Bodo Rieger","doi":"10.5220/0010688700003062","DOIUrl":"https://doi.org/10.5220/0010688700003062","url":null,"abstract":": Digital twins are virtual copies of production systems’ physical components. In Industrie 4.0, they represent a promising opportunity for analysing production data in real-time and contribute to improved production planning and control. However, development of digital twins is challenging for companies due to missing guidance. In this research paper, we identify four maturity levels for digital twins for real-time data analysis based on a structured literature review and a market analysis that resulted in a total of 82 analysed contributions. The results are evaluated through a qualitative interview with four experts from academia and practice. Manufacturing companies can use the maturity levels for self-assessment and as a guideline. Future research can use the maturity levels for integration into holistic maturity models.","PeriodicalId":380008,"journal":{"name":"International Conference on Innovative Intelligent Industrial Production and Logistics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130808137","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
扫码关注我们
求助内容：
应助结果提醒方式：