Pub Date : 2017-08-01DOI: 10.1109/COASE.2017.8256149
Chao-Bo Yan, Qianchuan Zhao
Series machines, i.e., machines connected in series with no buffering, are pervasive in production systems. In the analysis, design, and optimization of the series-machine system, the efficiency analysis is one of the most fundamental issues. There are not a lot of researches analyzing the efficiency of the series-machine system under the assumption of Operation-Dependent-Failures (ODF) mechanism and almost all of them assumed that machines break down in terms of ODF-I (i.e., the breakdown of a machine could make all other series machines forced down) rather than under ODF-II (i.e., the breakdown of a machine does not make any other series machines forced down). The reason that ODF-I is usually assumed in the literature is that the analysis of the series-machine system under ODF-II is much more complex than under ODF-I, although ODF-II might be more common in practice. To systematically analyze the efficiency of the series-machine system, in this paper, we propose an analytical method to investigate the efficiency under both ODF-I and ODF-II failure mechanisms. Different from under ODF-I, analytical expressions of the efficiency of series-machine systems under ODF-II are hard to obtain and thus, limit bounds of the efficiency are derived and an algorithm is developed to calculate its exact value. Results show that the series-machine system under ODF-II is more efficient than under ODF-I, which, intuitively making sense, is the reason that ODF-II are more common in the industry.
{"title":"Efficiency analysis of series machines under operation-dependent-failures","authors":"Chao-Bo Yan, Qianchuan Zhao","doi":"10.1109/COASE.2017.8256149","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256149","url":null,"abstract":"Series machines, i.e., machines connected in series with no buffering, are pervasive in production systems. In the analysis, design, and optimization of the series-machine system, the efficiency analysis is one of the most fundamental issues. There are not a lot of researches analyzing the efficiency of the series-machine system under the assumption of Operation-Dependent-Failures (ODF) mechanism and almost all of them assumed that machines break down in terms of ODF-I (i.e., the breakdown of a machine could make all other series machines forced down) rather than under ODF-II (i.e., the breakdown of a machine does not make any other series machines forced down). The reason that ODF-I is usually assumed in the literature is that the analysis of the series-machine system under ODF-II is much more complex than under ODF-I, although ODF-II might be more common in practice. To systematically analyze the efficiency of the series-machine system, in this paper, we propose an analytical method to investigate the efficiency under both ODF-I and ODF-II failure mechanisms. Different from under ODF-I, analytical expressions of the efficiency of series-machine systems under ODF-II are hard to obtain and thus, limit bounds of the efficiency are derived and an algorithm is developed to calculate its exact value. Results show that the series-machine system under ODF-II is more efficient than under ODF-I, which, intuitively making sense, is the reason that ODF-II are more common in the industry.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129297328","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256311
Hyunhwan Jeong, Bongki Kang, J. Cheong
This paper presents a new precision control algorithm for the antagonistic tendon-driven joint (TDJ) which has human-like structure. The antagonistic TDJ mechanism has the flexibility of joints by properties of the tendon and mechanical uncertainties by its complex structure, which renders it difficult to control the TDJ mechanism. In order to deal with this difficulty in control, we perform modeling of the TDJ and propose a new control method which enables high precision operation by compensating for mechanical uncertainties. We verify the effectiveness of the proposed control method by extensive experimental tests to our developed TDJ manipulator system.
{"title":"Initial experiment of practical algorithm for precision motion control of human-like tendon-driven joint mechanism","authors":"Hyunhwan Jeong, Bongki Kang, J. Cheong","doi":"10.1109/COASE.2017.8256311","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256311","url":null,"abstract":"This paper presents a new precision control algorithm for the antagonistic tendon-driven joint (TDJ) which has human-like structure. The antagonistic TDJ mechanism has the flexibility of joints by properties of the tendon and mechanical uncertainties by its complex structure, which renders it difficult to control the TDJ mechanism. In order to deal with this difficulty in control, we perform modeling of the TDJ and propose a new control method which enables high precision operation by compensating for mechanical uncertainties. We verify the effectiveness of the proposed control method by extensive experimental tests to our developed TDJ manipulator system.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125570725","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256247
Mengyi Zhang, A. Matta, A. Alfieri, Giulia Pedrielli
The Discrete Event Optimization (DEO) framework was recently proposed to formulate the simulation-optimization model of the Joint Workstation, Workload and Buffer Allocation Problem (JWWBAP) of the open flow line. However, the computational effort to solve the DEO model at optimality is quite high, because it is a mixed integer linear programming model. This work proposes a simulation cutting approach to efficiently solve the DEO model of the JWWBAP. Specifically, the DEO model is decomposed into an optimization model and a simulation model, which are the master problem and the subproblem in Benders decomposition, respectively. The optimization model is solved to find a system configuration, and the simulation model is solved to add cuts to the optimization model. An algorithm is proposed to generate cut using the simulation trajectory. Numerical analysis shows that the exact DEO model can be solved efficiently.
{"title":"A simulation-based benders' cuts generation for the joint workstation, workload and buffer allocation problem","authors":"Mengyi Zhang, A. Matta, A. Alfieri, Giulia Pedrielli","doi":"10.1109/COASE.2017.8256247","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256247","url":null,"abstract":"The Discrete Event Optimization (DEO) framework was recently proposed to formulate the simulation-optimization model of the Joint Workstation, Workload and Buffer Allocation Problem (JWWBAP) of the open flow line. However, the computational effort to solve the DEO model at optimality is quite high, because it is a mixed integer linear programming model. This work proposes a simulation cutting approach to efficiently solve the DEO model of the JWWBAP. Specifically, the DEO model is decomposed into an optimization model and a simulation model, which are the master problem and the subproblem in Benders decomposition, respectively. The optimization model is solved to find a system configuration, and the simulation model is solved to add cuts to the optimization model. An algorithm is proposed to generate cut using the simulation trajectory. Numerical analysis shows that the exact DEO model can be solved efficiently.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126425781","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256280
C. Bianco, Marina Raineri
The automatic management of kinematic singularities for trajectories planned in the operational space is a topic which is attracting a renewed interest in the scientific community. In fact, the numerical efficiency of the strategies recently proposed makes them suitable to be exploited in industrial contexts. The approach proposed in this paper can be collocated within this framework, since it allows executing trajectories in the operational space which pass through wrist singularities. It introduces several novelties w.r.t. known alternative strategies. First of all, trajectories in the operational space are planned on-the-fly, so that singularities are handled in real-time. This result is obtained by changing slightly the tool-frame orientation, while strictly preserving the assigned Cartesian paths and the time-laws. Furthermore, the approach is effective also for manipulators moving at standard operative speeds and it explicitly handles given limits on joint velocities and accelerations. Results are experimentally validated through an anthropomorphic industrial manipulator.
{"title":"An automatic system for the avoidance of wrist singularities in anthropomorphic manipulators","authors":"C. Bianco, Marina Raineri","doi":"10.1109/COASE.2017.8256280","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256280","url":null,"abstract":"The automatic management of kinematic singularities for trajectories planned in the operational space is a topic which is attracting a renewed interest in the scientific community. In fact, the numerical efficiency of the strategies recently proposed makes them suitable to be exploited in industrial contexts. The approach proposed in this paper can be collocated within this framework, since it allows executing trajectories in the operational space which pass through wrist singularities. It introduces several novelties w.r.t. known alternative strategies. First of all, trajectories in the operational space are planned on-the-fly, so that singularities are handled in real-time. This result is obtained by changing slightly the tool-frame orientation, while strictly preserving the assigned Cartesian paths and the time-laws. Furthermore, the approach is effective also for manipulators moving at standard operative speeds and it explicitly handles given limits on joint velocities and accelerations. Results are experimentally validated through an anthropomorphic industrial manipulator.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123133039","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256138
Xiang T. R. Kong, Ming Li, Ying Yu, Zhiheng Zhao, G. Huang
E-commerce logistics park is zoned and planned to achieve highly efficient order fulfilment process while adapting to the increasing demands. However, how to improve the sharing, coordination and synchronization of resources (e.g. operators, machines, spaces and tools) across multi-echelon E-commerce logistics chain is still challenging. This paper introduces a multi-layer physical internet (PI)-enabled cloud platform to enable logistics assets virtualization and real-time control, reconfigurable task coordination and execution as well as simultaneous-and-punctual process synchronization.
{"title":"Physical internet-enabled E-commerce logistics park platform","authors":"Xiang T. R. Kong, Ming Li, Ying Yu, Zhiheng Zhao, G. Huang","doi":"10.1109/COASE.2017.8256138","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256138","url":null,"abstract":"E-commerce logistics park is zoned and planned to achieve highly efficient order fulfilment process while adapting to the increasing demands. However, how to improve the sharing, coordination and synchronization of resources (e.g. operators, machines, spaces and tools) across multi-echelon E-commerce logistics chain is still challenging. This paper introduces a multi-layer physical internet (PI)-enabled cloud platform to enable logistics assets virtualization and real-time control, reconfigurable task coordination and execution as well as simultaneous-and-punctual process synchronization.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122316341","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256249
Yibing Chen, T. Ogata, T. Ueyama, Toshiyuki Takada, J. Ota
Machine vision is playing an increasingly important role in the industrial field, and the automated design of image recognition systems has been the subject of intense research. In this study, we proposed a system that is capable of automatically designing the field-of-view of an image recognition system, based on the relationship between the camera and the target objects, the illumination conditions, and the image preprocessing parameters. We reformulated the design problem as an optimization problem, and used a multi-start nearest neighbor search method to solve it. Two evaluation experiments were conducted, with different distances between the target objects. The results demonstrated that the system was able to choose an appropriate field-of-view, illumination conditions, and image pre-processing parameters, taking account of the distance between target objects and the required accuracy of recognition.
{"title":"Automated design of the field-of-view, illumination, and image pre-processing parameters of an image recognition system","authors":"Yibing Chen, T. Ogata, T. Ueyama, Toshiyuki Takada, J. Ota","doi":"10.1109/COASE.2017.8256249","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256249","url":null,"abstract":"Machine vision is playing an increasingly important role in the industrial field, and the automated design of image recognition systems has been the subject of intense research. In this study, we proposed a system that is capable of automatically designing the field-of-view of an image recognition system, based on the relationship between the camera and the target objects, the illumination conditions, and the image preprocessing parameters. We reformulated the design problem as an optimization problem, and used a multi-start nearest neighbor search method to solve it. Two evaluation experiments were conducted, with different distances between the target objects. The results demonstrated that the system was able to choose an appropriate field-of-view, illumination conditions, and image pre-processing parameters, taking account of the distance between target objects and the required accuracy of recognition.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116585811","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256322
Junqi Zhang, Yuheng Wang, Mengchu Zhou
A stochastic point location problem considers that a learning mechanism (agent, algorithm, etc.) searches the target point on a one-dimensional domain by operating a controlled random walk after receiving some direction information from a stochastic environment. A method named Adaptive Step Search has been the fastest algorithm so far for solving a stochastic point location problem, which can be applied in Particle Swarm Optimization (PSO), the establishment of epidemic models and many other scenarios. However, its application is theoretically restrained within the range of informative environment in which the probability of an environment providing a correct suggestion is strictly bigger than a half. Namely, it does not work in a deceptive environment where such a probability is less than a half. In this paper, we present a novel promotion to overcome the difficult issue facing Adaptive Step Search, by means of symmetrization and buffer techniques. The new algorithm is able to operate a controlled random walk in both informative and deceptive environments and to converge eventually without performance loss. Finally, experimental results demonstrate that the proposed scheme is efficient and feasible in dual environments.
{"title":"Fast adaptive search on the line in dual environments","authors":"Junqi Zhang, Yuheng Wang, Mengchu Zhou","doi":"10.1109/COASE.2017.8256322","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256322","url":null,"abstract":"A stochastic point location problem considers that a learning mechanism (agent, algorithm, etc.) searches the target point on a one-dimensional domain by operating a controlled random walk after receiving some direction information from a stochastic environment. A method named Adaptive Step Search has been the fastest algorithm so far for solving a stochastic point location problem, which can be applied in Particle Swarm Optimization (PSO), the establishment of epidemic models and many other scenarios. However, its application is theoretically restrained within the range of informative environment in which the probability of an environment providing a correct suggestion is strictly bigger than a half. Namely, it does not work in a deceptive environment where such a probability is less than a half. In this paper, we present a novel promotion to overcome the difficult issue facing Adaptive Step Search, by means of symmetrization and buffer techniques. The new algorithm is able to operate a controlled random walk in both informative and deceptive environments and to converge eventually without performance loss. Finally, experimental results demonstrate that the proposed scheme is efficient and feasible in dual environments.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121450035","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256194
Haifeng Han, G. Paul, Takamitsu Matsubara
Deformable Linear Object (DLO) manipulation has wide application in industry and in daily life. Conventionally, it is difficult for a robot to manipulate a DLO to achieve the target configuration due to the absence of the universal model that specifies the DLO regardless of the material and environment. Since the state variable of a DLO can be very high dimensional, identifying such a model may require a huge number of samples. Thus, model-based planning of DLO manipulation would be impractical and unreasonable. In this paper, we explore another approach based on reinforcement learning. To this end, our approach is to apply a sample-efficient model-based reinforcement learning method, so-called PILCO [1], to resolve the high dimensional planning problem of DLO manipulation with a reasonable number of samples. To investigate the effectiveness of our approach, we developed an experimental setup with a dual-arm industrial robot and multiple sensors. Then, we conducted experiments to show that our approach is efficient by performing a DLO manipulation task.
{"title":"Model-based reinforcement learning approach for deformable linear object manipulation","authors":"Haifeng Han, G. Paul, Takamitsu Matsubara","doi":"10.1109/COASE.2017.8256194","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256194","url":null,"abstract":"Deformable Linear Object (DLO) manipulation has wide application in industry and in daily life. Conventionally, it is difficult for a robot to manipulate a DLO to achieve the target configuration due to the absence of the universal model that specifies the DLO regardless of the material and environment. Since the state variable of a DLO can be very high dimensional, identifying such a model may require a huge number of samples. Thus, model-based planning of DLO manipulation would be impractical and unreasonable. In this paper, we explore another approach based on reinforcement learning. To this end, our approach is to apply a sample-efficient model-based reinforcement learning method, so-called PILCO [1], to resolve the high dimensional planning problem of DLO manipulation with a reasonable number of samples. To investigate the effectiveness of our approach, we developed an experimental setup with a dual-arm industrial robot and multiple sensors. Then, we conducted experiments to show that our approach is efficient by performing a DLO manipulation task.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114279241","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}
High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacity margin assessment (TCMA) is established to quantify the transmission security with uncertain wind generation. The basic formulation is reformulated as a two-stage non-differentiable programming model. It can be transformed into a mixed integer linear programming (MILP) by duality theory and specific linearization techniques. Furthermore, an effective procedure is developed to improve the transmission capacity margin by necessary wind curtailment. A detailed case study is performed on the IEEE 31-bus system and numerical results verify the effectiveness of this TCMA framework.
{"title":"Transmission capacity margin assessment in power systems with uncertain wind integration","authors":"Yafei Yang, Xuejiao Lei, Q. Zhai, Jiang Wu, X. Guan","doi":"10.1109/COASE.2017.8256296","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256296","url":null,"abstract":"High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacity margin assessment (TCMA) is established to quantify the transmission security with uncertain wind generation. The basic formulation is reformulated as a two-stage non-differentiable programming model. It can be transformed into a mixed integer linear programming (MILP) by duality theory and specific linearization techniques. Furthermore, an effective procedure is developed to improve the transmission capacity margin by necessary wind curtailment. A detailed case study is performed on the IEEE 31-bus system and numerical results verify the effectiveness of this TCMA framework.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125222591","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256117
Sikai Gong, Ran Huang, Zhengcai Cao
A stepper in a lithography area is the bottleneck machine of a semiconductor manufacturing process. Its effective scheduling in low-yield scenes can improve throughput and profits of a semiconductor wafer fabrication facility. This paper presents an opposition-based Symbiotic Organisms Search with a catastrophe phase algorithm (OBSOS-CA) to minimize the makespan of this scheduling problem. The opposition-based learning technique is used to increase the population diversity in the initial and parasitism phases of Symbiotic Organisms Search (SOS). Moreover, we add a catastrophe phase containing three parts. When the algorithm is trapped in a local optimum, a catastrophe judgement and an extinction operation are used to jump out of the local optimal solution. Meanwhile, variable neighborhood descent is employed in the mutualism phase and commensalism phase of SOS as the explosion operation thereby strengthening the ability of local search. Simulation results demonstrate that OBSOS-CA is effective for a low-yield stepper scheduling problem.
{"title":"An improved symbiotic organisms search algorithm for low-yield stepper scheduling problem","authors":"Sikai Gong, Ran Huang, Zhengcai Cao","doi":"10.1109/COASE.2017.8256117","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256117","url":null,"abstract":"A stepper in a lithography area is the bottleneck machine of a semiconductor manufacturing process. Its effective scheduling in low-yield scenes can improve throughput and profits of a semiconductor wafer fabrication facility. This paper presents an opposition-based Symbiotic Organisms Search with a catastrophe phase algorithm (OBSOS-CA) to minimize the makespan of this scheduling problem. The opposition-based learning technique is used to increase the population diversity in the initial and parasitism phases of Symbiotic Organisms Search (SOS). Moreover, we add a catastrophe phase containing three parts. When the algorithm is trapped in a local optimum, a catastrophe judgement and an extinction operation are used to jump out of the local optimal solution. Meanwhile, variable neighborhood descent is employed in the mutualism phase and commensalism phase of SOS as the explosion operation thereby strengthening the ability of local search. Simulation results demonstrate that OBSOS-CA is effective for a low-yield stepper scheduling problem.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125088269","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
扫码关注我们
求助内容：
应助结果提醒方式：