Pub Date : 2006-09-01DOI: 10.1109/ETFA.2006.355246
F. Hnaien, A. Dolgui
A multilevel assembly system with one type of finished product and several types of components is considered. The component lead times for components at each period are independent random variables, and the demand of finished product per period is constant. Finished products should be delivered by the end of each period. Otherwise a backlogging cost is incurred. Components necessary to assemble the same semi-finished product that are delivered in advance will cause holding cost. The objective is to find the optimal release dates (safety lead times which is measured in number of periods) for the components in order to minimize the total expected costs composed of the finished product backlogging cost and the component holding cost. We propose a model that gives the optimal release dates values for the components.
{"title":"A Supply Planning Model for Multilevel Assembly Systems Under Random Lead Times","authors":"F. Hnaien, A. Dolgui","doi":"10.1109/ETFA.2006.355246","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355246","url":null,"abstract":"A multilevel assembly system with one type of finished product and several types of components is considered. The component lead times for components at each period are independent random variables, and the demand of finished product per period is constant. Finished products should be delivered by the end of each period. Otherwise a backlogging cost is incurred. Components necessary to assemble the same semi-finished product that are delivered in advance will cause holding cost. The objective is to find the optimal release dates (safety lead times which is measured in number of periods) for the components in order to minimize the total expected costs composed of the finished product backlogging cost and the component holding cost. We propose a model that gives the optimal release dates values for the components.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132353950","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355357
Jackson Francomme, Gilles Mercier, T. Val
We propose the implementation of a wireless sensor network applied to automation control applications, when the guarantee of a delay delivery for the complete reception of messages is necessary. The 802.15.4 wireless standard network offers possibilities of management of the bandwidth. This paper presents the method to guarantee the deadline transmission of periodic messages. For external messages (crossing the network from clusters to its destination), this average latency is used as a parameter of the routing protocol decision balance between energy saving and delay transmission. In this last case, a QoS method all over the network has to be installed to maintain a bounded end to end delay transmission. This work is still in progress. A specific Matlab simulator has been developed, principles of this routing method are mentioned at the end of this paper
{"title":"A simple method for guaranteed deadline of periodic messages in 802.15.4 cluster cells for control automation applications","authors":"Jackson Francomme, Gilles Mercier, T. Val","doi":"10.1109/ETFA.2006.355357","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355357","url":null,"abstract":"We propose the implementation of a wireless sensor network applied to automation control applications, when the guarantee of a delay delivery for the complete reception of messages is necessary. The 802.15.4 wireless standard network offers possibilities of management of the bandwidth. This paper presents the method to guarantee the deadline transmission of periodic messages. For external messages (crossing the network from clusters to its destination), this average latency is used as a parameter of the routing protocol decision balance between energy saving and delay transmission. In this last case, a QoS method all over the network has to be installed to maintain a bounded end to end delay transmission. This work is still in progress. A specific Matlab simulator has been developed, principles of this routing method are mentioned at the end of this paper","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133892223","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355453
A. Lobov, C. Popescu, J. Lastra
System engineering process supported by the formal methods should improve the quality of the developed product. Here, a single step in formalization of industrial programming is highlighted together with its place in the whole framework for formal validation of industrial systems. This paper describes an algorithm of translating statement list language to the timed net condition/event systems that forms a controller model. Thus controller models can be generated for the industrial automated systems implemented in statement list.
{"title":"An Algorithm for Siemens STL representation in TNCES","authors":"A. Lobov, C. Popescu, J. Lastra","doi":"10.1109/ETFA.2006.355453","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355453","url":null,"abstract":"System engineering process supported by the formal methods should improve the quality of the developed product. Here, a single step in formalization of industrial programming is highlighted together with its place in the whole framework for formal validation of industrial systems. This paper describes an algorithm of translating statement list language to the timed net condition/event systems that forms a controller model. Thus controller models can be generated for the industrial automated systems implemented in statement list.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130296253","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355250
R. Imura
The goal of the ubiquitous computing and networking is that computers are embedded in everywhere & everything for easy access to control over the entire social infrastructure. Networked RFID technology is one of the essential key for driving the ubiquitous to realize secure and easy access from anyone, anything, anywhere and anytime, which contributes to the better quality of human life and covers the various applications and fields such as transportation, housing, food-chain, agriculture, automobile, industry FA, logistics and healthcare etc. It has been found that through some of the practical networked RFID applications, the activities and new business models are related to so many items such as service, architecture, security, even for human lifestyle and culture etc. It should be considered how can applications and business models of RFID solutions meet the customer's requirements. There are some strong potential markets for RFID to add value to the existing market situation which are the food, livestock, and drug value chain including processing, distribution, traceability, process improvement and anti-counterfeit.
{"title":"The Role of Networked RFID for Driving the Ubiquitous","authors":"R. Imura","doi":"10.1109/ETFA.2006.355250","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355250","url":null,"abstract":"The goal of the ubiquitous computing and networking is that computers are embedded in everywhere & everything for easy access to control over the entire social infrastructure. Networked RFID technology is one of the essential key for driving the ubiquitous to realize secure and easy access from anyone, anything, anywhere and anytime, which contributes to the better quality of human life and covers the various applications and fields such as transportation, housing, food-chain, agriculture, automobile, industry FA, logistics and healthcare etc. It has been found that through some of the practical networked RFID applications, the activities and new business models are related to so many items such as service, architecture, security, even for human lifestyle and culture etc. It should be considered how can applications and business models of RFID solutions meet the customer's requirements. There are some strong potential markets for RFID to add value to the existing market situation which are the food, livestock, and drug value chain including processing, distribution, traceability, process improvement and anti-counterfeit.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134382507","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355374
B. Álvarez, P. Fernández, S. M. Diaz, J. C. Rico, C. Suarez
The accessibility analysis presented in this paper is based on part discretization and the application of space partitioning techniques (kd-tree) in order to reduce the number of intersection tests between probe and part. The discretization of the part in a set of triangles (STL model) allows the developed algorithms to be applied to whatever part or environment obstacle, independently of their geometry. A recursive ray traversal algorithm has been used in order to speed up the traversal of the hierarchical structure of the kd-tree and to calculate exclusively the intersection of each probe orientation with those part triangles that potentially can interfere with it. In a further step of the analysis, the real geometry of the probe has been considered. For this, a simplified model has been developed for each probe component (column, head, touch probe, stylus and tip) using different basic geometrical shapes. Different models for each probe component have been tested to calculate their intersection with the part, and several algorithms have been implemented to accelerate the computation. Finally, collision-free probe orientations are clustered for minimizing the orientation changes during the inspection process. Furthermore, the applied algorithm allows for determining different valid combinations of clusters.
{"title":"Accessibility Analysis for Automatic Inspection Using Bounding Volume Hierarchies","authors":"B. Álvarez, P. Fernández, S. M. Diaz, J. C. Rico, C. Suarez","doi":"10.1109/ETFA.2006.355374","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355374","url":null,"abstract":"The accessibility analysis presented in this paper is based on part discretization and the application of space partitioning techniques (kd-tree) in order to reduce the number of intersection tests between probe and part. The discretization of the part in a set of triangles (STL model) allows the developed algorithms to be applied to whatever part or environment obstacle, independently of their geometry. A recursive ray traversal algorithm has been used in order to speed up the traversal of the hierarchical structure of the kd-tree and to calculate exclusively the intersection of each probe orientation with those part triangles that potentially can interfere with it. In a further step of the analysis, the real geometry of the probe has been considered. For this, a simplified model has been developed for each probe component (column, head, touch probe, stylus and tip) using different basic geometrical shapes. Different models for each probe component have been tested to calculate their intersection with the part, and several algorithms have been implemented to accelerate the computation. Finally, collision-free probe orientations are clustered for minimizing the orientation changes during the inspection process. Furthermore, the applied algorithm allows for determining different valid combinations of clusters.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"464 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131954457","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355401
P. Yomsi, Y. Sorel
Classical off-line approaches based on preemption such as RM (rate monotonic), DM (deadline monotonic), EDF (earliest deadline first), LLF (least laxity first), etc, give schedulability conditions but most of the time assuming on the one hand that all the tasks are independent, and on the other hand, that the first instances of all tasks are released at the same time. We are interested in hard real-time systems subject to precedence and strict periodicity constraints, i.e. such that for all instances of each task, the release time and start time are equal. For such systems, it is mandatory to satisfy these constraints. In this paper we give non-schedulability conditions in order to restrict the study field of all systems of tasks to only potentially schedulable systems.
{"title":"Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constraints","authors":"P. Yomsi, Y. Sorel","doi":"10.1109/ETFA.2006.355401","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355401","url":null,"abstract":"Classical off-line approaches based on preemption such as RM (rate monotonic), DM (deadline monotonic), EDF (earliest deadline first), LLF (least laxity first), etc, give schedulability conditions but most of the time assuming on the one hand that all the tasks are independent, and on the other hand, that the first instances of all tasks are released at the same time. We are interested in hard real-time systems subject to precedence and strict periodicity constraints, i.e. such that for all instances of each task, the release time and start time are equal. For such systems, it is mandatory to satisfy these constraints. In this paper we give non-schedulability conditions in order to restrict the study field of all systems of tasks to only potentially schedulable systems.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133485695","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355364
I. Calvo, L. Almeida
CORBA, in particular the real-time specification, has proven to be a reliable and mature technology that has been successfully used in a great number of industrial distributed computing applications. However, its current version does not provide specific mechanisms to support the deployment of synchronous activities in a flexible way. This fact may complicate the application of this technology to certain applications where synchronous behaviour is expected. Therefore, this paper presents a new service, built over CORBA-RT, that allows the synchronization of different activities of a distributed system in an easy way. The paper also explains how this service can be used to optimize, in general, resource utilization in a distributed system
{"title":"Adding Synchronous Scheduling to CORBA-RT","authors":"I. Calvo, L. Almeida","doi":"10.1109/ETFA.2006.355364","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355364","url":null,"abstract":"CORBA, in particular the real-time specification, has proven to be a reliable and mature technology that has been successfully used in a great number of industrial distributed computing applications. However, its current version does not provide specific mechanisms to support the deployment of synchronous activities in a flexible way. This fact may complicate the application of this technology to certain applications where synchronous behaviour is expected. Therefore, this paper presents a new service, built over CORBA-RT, that allows the synchronization of different activities of a distributed system in an easy way. The paper also explains how this service can be used to optimize, in general, resource utilization in a distributed system","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121272654","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355437
T. Chua, F. Y. Wang, T. Cai, X. Yin
This paper presents a heuristics-based advanced planning and scheduling (APS) system with bottleneck scheduling algorithm. It has been designed to solve production scheduling problems in discrete manufacturing industry. The proposed APS system can be configured to be deployed in different production environments, including make-to-stock, make-to-order, bottleneck-driven shop floor, through its forward, backward and bottleneck scheduling algorithms. It allows users to specify heuristic rules at each operation based on the scheduling policy of the operation. The embedded scheduling techniques facilitates the generation of feasible and practical schedule to achieve a fine balance among the conflicting production goals of maximizing resource utilization, minimizing work-in-process (WIP), and reduction of cycle time. In addition, the system can be easily reconfigured to address them various requirements imposed by the physical and operational constraints of the production environment. The APS system deploys two layers of heuristic algorithms intertwined within the scheduling engine. The two layers of heuristic algorithms are job prioritization (JP) rules and machine selection (MS) rules. JP heuristics rules are designed to prioritize orders at each operation, while machine selection (MS) algorithm selects the best-fit machines and other optional resources to generate the dispatching list. The modular and configurable approach adopted in the design and development of the scheduling engine allows the reconfiguration of basic core JP and MS modules for different industry-specific requirements. The proposed APS system has been successfully implemented to fulfil the daily production scheduling needs of a few semiconductor backend assembly companies.
{"title":"A Heuristics-based Advanced Planning and Scheduling System with Bottleneck Scheduling Algorithm","authors":"T. Chua, F. Y. Wang, T. Cai, X. Yin","doi":"10.1109/ETFA.2006.355437","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355437","url":null,"abstract":"This paper presents a heuristics-based advanced planning and scheduling (APS) system with bottleneck scheduling algorithm. It has been designed to solve production scheduling problems in discrete manufacturing industry. The proposed APS system can be configured to be deployed in different production environments, including make-to-stock, make-to-order, bottleneck-driven shop floor, through its forward, backward and bottleneck scheduling algorithms. It allows users to specify heuristic rules at each operation based on the scheduling policy of the operation. The embedded scheduling techniques facilitates the generation of feasible and practical schedule to achieve a fine balance among the conflicting production goals of maximizing resource utilization, minimizing work-in-process (WIP), and reduction of cycle time. In addition, the system can be easily reconfigured to address them various requirements imposed by the physical and operational constraints of the production environment. The APS system deploys two layers of heuristic algorithms intertwined within the scheduling engine. The two layers of heuristic algorithms are job prioritization (JP) rules and machine selection (MS) rules. JP heuristics rules are designed to prioritize orders at each operation, while machine selection (MS) algorithm selects the best-fit machines and other optional resources to generate the dispatching list. The modular and configurable approach adopted in the design and development of the scheduling engine allows the reconfiguration of basic core JP and MS modules for different industry-specific requirements. The proposed APS system has been successfully implemented to fulfil the daily production scheduling needs of a few semiconductor backend assembly companies.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116357238","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355350
J. Pomares, P. Gil, G. J. García, Fernando Torres Medina
This paper describes a method to detect changes in given surfaces tracked by the robot end-effector. To do so, first an approach to combine visual and force information is described. By filtering the interaction forces, a parameter which provides the probability of a change in the tracking surface is obtained. In order to obtain a more accurate determination of the change in the surface, information from a laser located at the robot end-effector is also employed. Therefore, a robust method for detecting surface discontinuities which employs force and visual information jointly with structured light is presented
{"title":"Visual - Force Control and Structured Light Fusion to Improve Recognition of Discontinuities in Surfaces","authors":"J. Pomares, P. Gil, G. J. García, Fernando Torres Medina","doi":"10.1109/ETFA.2006.355350","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355350","url":null,"abstract":"This paper describes a method to detect changes in given surfaces tracked by the robot end-effector. To do so, first an approach to combine visual and force information is described. By filtering the interaction forces, a parameter which provides the probability of a change in the tracking surface is obtained. In order to obtain a more accurate determination of the change in the surface, information from a laser located at the robot end-effector is also employed. Therefore, a robust method for detecting surface discontinuities which employs force and visual information jointly with structured light is presented","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115063239","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355232
S. Lee
This article presents a novel method for modeling swept volumes of milling tools that undergoes a translational motion by extending the basic idea behind Gauss maps. The main idea is that it 1) transforms the tool shape and the moving direction of the tool from Euclidean space into an unit sphere by means of Gauss function and gets the spherical domains which are called Tool map (T-Map) and Contact map (C-Map) respectively 2) finds an intersection region of T-Map with C-Map and 3) transforms intersected region inversely into Euclidean space to get the envelope profile of the tool at prescribed instant time. The proposed approach is intuitive to understand the cutting behavior of generalized tool shape, simple to implement the swept volume and extendible up to a piecewise C -continuous convex set following translational motion.
{"title":"An Approach to Swept Volume Generation for NC Machining using Gauss Map","authors":"S. Lee","doi":"10.1109/ETFA.2006.355232","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355232","url":null,"abstract":"This article presents a novel method for modeling swept volumes of milling tools that undergoes a translational motion by extending the basic idea behind Gauss maps. The main idea is that it 1) transforms the tool shape and the moving direction of the tool from Euclidean space into an unit sphere by means of Gauss function and gets the spherical domains which are called Tool map (T-Map) and Contact map (C-Map) respectively 2) finds an intersection region of T-Map with C-Map and 3) transforms intersected region inversely into Euclidean space to get the envelope profile of the tool at prescribed instant time. The proposed approach is intuitive to understand the cutting behavior of generalized tool shape, simple to implement the swept volume and extendible up to a piecewise C -continuous convex set following translational motion.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115667132","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
扫码关注我们
求助内容：
应助结果提醒方式：