Pub Date : 2020-01-01DOI: 10.1109/CASE48305.2020.9217015
Hao Guo, K. Zhu
{"title":"Pyramid LSTM auto-encoder for tool wear monitoring","authors":"Hao Guo, K. Zhu","doi":"10.1109/CASE48305.2020.9217015","DOIUrl":"https://doi.org/10.1109/CASE48305.2020.9217015","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"44 1","pages":"190-195"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74994323","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 : 2020-01-01DOI: 10.1109/CASE48305.2020.9216890
Zuoxu Wang, Xinyu Li, Pai Zheng, Chun-Hsien Chen, L. Khoo
{"title":"Smart product-service system configuration: a novel hypergraph model-based approach","authors":"Zuoxu Wang, Xinyu Li, Pai Zheng, Chun-Hsien Chen, L. Khoo","doi":"10.1109/CASE48305.2020.9216890","DOIUrl":"https://doi.org/10.1109/CASE48305.2020.9216890","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"61 1","pages":"323-328"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76412759","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 : 2019-01-01DOI: 10.1109/COASE.2019.8842952
Wei Wu, Jianfeng Lu, Hao Zhang
{"title":"Data-driven Manufacturing Service Optimization Model in Smart Factory","authors":"Wei Wu, Jianfeng Lu, Hao Zhang","doi":"10.1109/COASE.2019.8842952","DOIUrl":"https://doi.org/10.1109/COASE.2019.8842952","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"22 1","pages":"362-367"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76512806","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-08-01DOI: 10.1109/COASE.2018.8560396
Xiuli Wu, Xiajing Liu
The single-factory manufacturing is gradually transiting to the multi-factory collaborative production under the globalization. How to schedule the collaborative production among multiple factories effectively is extremely urgent. The distributed flexible job shop scheduling problem (DFJSP) is studied. To begin with, a DFJSP mixed integer linear programming model is formulated to minimize the makespan. Then, an improved differential evolution simulated annealing algorithm (IDESAA) is proposed. Two crossover and mutation operators are designed. Simulated annealing is integrated to local search the best solution(s). The tournament selection is employed to select the offspring. Finally, the numerical experiments are conducted and the results show that the proposed algorithm can solve the DFJSP effectively and efficiently.
{"title":"An Improved Differential Evolution Algorithm for Solving a Distributed Flexible Job Shop Scheduling Problem","authors":"Xiuli Wu, Xiajing Liu","doi":"10.1109/COASE.2018.8560396","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560396","url":null,"abstract":"The single-factory manufacturing is gradually transiting to the multi-factory collaborative production under the globalization. How to schedule the collaborative production among multiple factories effectively is extremely urgent. The distributed flexible job shop scheduling problem (DFJSP) is studied. To begin with, a DFJSP mixed integer linear programming model is formulated to minimize the makespan. Then, an improved differential evolution simulated annealing algorithm (IDESAA) is proposed. Two crossover and mutation operators are designed. Simulated annealing is integrated to local search the best solution(s). The tournament selection is employed to select the offspring. Finally, the numerical experiments are conducted and the results show that the proposed algorithm can solve the DFJSP effectively and efficiently.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"985 1","pages":"968-973"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80380953","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 : 2015-08-01DOI: 10.1109/CoASE.2015.7294292
B. D. Kruif
Wafer fabrication is the major cost contributor in semiconductor manufacturing. One of the steps in the fabrication is the removal of exposed layers in an automatic wet-etch station with chemicals. In time, these chemicals get polluted and their effectiveness decreases. Therefore, the chemicals in these baths need to be renewed or maintained on a regular basis. This can be required after a fixed number of processed wafers, or after a specified period of time. It has been observed in the factory that the wet-etch station can get completely blocked when one of the baths goes into maintenance. This happens when the first batch in queue needs the bath maintained. All subsequent batches then have to wait and the tool is blocked. Placing a different batch in the load lock might have prevented this blockage. In this paper we investigate the influence of the sequence of the batches inserted on the total processing time, when time dependent maintenance is incorporated. In order to do this, a detailed model is constructed based on an actual wet-etch tool. The model parameters were tuned to the values of the actual tool and it was verified that the resulting behaviour was correct. Based on this model a (sub)optimal sequence was constructed. Three sequences were considered: i) an arbitrary sequence, ii) an optimised sequence without considering the time-dependent behaviour of the maintenance, and iii) an optimised sequence with the time-dependent behaviour. It was found that the mean processing time could decrease with about 10% when the time dependent maintenance was incorporated, in comparison with the original, arbitrary, sequence. When a (sub)optimal sequence was constructed without incorporating the time-dependent maintenance, a mean decrease of 4% was realised. This shows that the time-dependent maintenance plays an important role in the total processing time and should be incorporated in the optimisation.
{"title":"Wet-etch sequence optimisation incorporating time dependent chemical maintenance","authors":"B. D. Kruif","doi":"10.1109/CoASE.2015.7294292","DOIUrl":"https://doi.org/10.1109/CoASE.2015.7294292","url":null,"abstract":"Wafer fabrication is the major cost contributor in semiconductor manufacturing. One of the steps in the fabrication is the removal of exposed layers in an automatic wet-etch station with chemicals. In time, these chemicals get polluted and their effectiveness decreases. Therefore, the chemicals in these baths need to be renewed or maintained on a regular basis. This can be required after a fixed number of processed wafers, or after a specified period of time. It has been observed in the factory that the wet-etch station can get completely blocked when one of the baths goes into maintenance. This happens when the first batch in queue needs the bath maintained. All subsequent batches then have to wait and the tool is blocked. Placing a different batch in the load lock might have prevented this blockage. In this paper we investigate the influence of the sequence of the batches inserted on the total processing time, when time dependent maintenance is incorporated. In order to do this, a detailed model is constructed based on an actual wet-etch tool. The model parameters were tuned to the values of the actual tool and it was verified that the resulting behaviour was correct. Based on this model a (sub)optimal sequence was constructed. Three sequences were considered: i) an arbitrary sequence, ii) an optimised sequence without considering the time-dependent behaviour of the maintenance, and iii) an optimised sequence with the time-dependent behaviour. It was found that the mean processing time could decrease with about 10% when the time dependent maintenance was incorporated, in comparison with the original, arbitrary, sequence. When a (sub)optimal sequence was constructed without incorporating the time-dependent maintenance, a mean decrease of 4% was realised. This shows that the time-dependent maintenance plays an important role in the total processing time and should be incorporated in the optimisation.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"59 1","pages":"1389-1394"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75471065","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 : 2015-08-01DOI: 10.1109/CoASE.2015.7294190
X. Leng, Songsen Wu, Yanli Du, Yuehua Cheng
It is difficult for the traditional pan-tilt-zoom (PTZ) system driven by electromagnetic motor to meet the growing demand for video surveillance system. The key bottleneck problem is high positioning accuracy, high dynamic performance and miniaturization of the PTZ system. This paper presents a PTZ system driven by two degree-of-freedom obelisk-shaped ultrasonic motor with single stator, and makes research on its intelligent control algorithm. First, analyses of the structure, driving mechanism and electromechanical coupling system characteristic of the PTZ system are conducted using both the method of simulation and experiment. Then for the sake of solving the complex nonlinear factors, parameter variation and external disturbance, this paper combines the fuzzy logic algorithm and the sliding mode control strategy to improve the control performance. The results of simulation show that this algorithm proposed in this paper has faster response, higher precision and also has a good robustness to prevent the effect of interference.
{"title":"Fuzzy sliding mode control for pan-tilt-zoom system driven by ultrasonic motor","authors":"X. Leng, Songsen Wu, Yanli Du, Yuehua Cheng","doi":"10.1109/CoASE.2015.7294190","DOIUrl":"https://doi.org/10.1109/CoASE.2015.7294190","url":null,"abstract":"It is difficult for the traditional pan-tilt-zoom (PTZ) system driven by electromagnetic motor to meet the growing demand for video surveillance system. The key bottleneck problem is high positioning accuracy, high dynamic performance and miniaturization of the PTZ system. This paper presents a PTZ system driven by two degree-of-freedom obelisk-shaped ultrasonic motor with single stator, and makes research on its intelligent control algorithm. First, analyses of the structure, driving mechanism and electromechanical coupling system characteristic of the PTZ system are conducted using both the method of simulation and experiment. Then for the sake of solving the complex nonlinear factors, parameter variation and external disturbance, this paper combines the fuzzy logic algorithm and the sliding mode control strategy to improve the control performance. The results of simulation show that this algorithm proposed in this paper has faster response, higher precision and also has a good robustness to prevent the effect of interference.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"31 1","pages":"868-873"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85678766","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 : 2014-10-30DOI: 10.1109/CoASE.2014.6899456
Lei Xu, Na Li, Xin Yu, F. Mo
In this paper, we study hospital bed planning problem for a gynecological ward in China. We first proposed a mixed integer programming (MIP) model considering deterministic length of stay (LOS) to assign patients to available beds. Since statistical analysis of empirical hospitalization data reveals that variance of inpatient's LOS is significant. Therefore, based on the deterministic LOS model we further proposed a MIP model taking stochastic LOS into consideration. Both models could be solved by standard linear programming solver CPLEX. Numerical experiments of bed assignment results comparison between the two proposed models are presented. The result shows stochastic LOS model can generate better bed planning solutions with lower potential schedule conflict cost.
{"title":"A mixed integer programming model for Bed planning considering stochastic length of stay","authors":"Lei Xu, Na Li, Xin Yu, F. Mo","doi":"10.1109/CoASE.2014.6899456","DOIUrl":"https://doi.org/10.1109/CoASE.2014.6899456","url":null,"abstract":"In this paper, we study hospital bed planning problem for a gynecological ward in China. We first proposed a mixed integer programming (MIP) model considering deterministic length of stay (LOS) to assign patients to available beds. Since statistical analysis of empirical hospitalization data reveals that variance of inpatient's LOS is significant. Therefore, based on the deterministic LOS model we further proposed a MIP model taking stochastic LOS into consideration. Both models could be solved by standard linear programming solver CPLEX. Numerical experiments of bed assignment results comparison between the two proposed models are presented. The result shows stochastic LOS model can generate better bed planning solutions with lower potential schedule conflict cost.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"20 1","pages":"1069-1074"},"PeriodicalIF":0.0,"publicationDate":"2014-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77993293","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 : 2014-01-01DOI: 10.1109/CoASE.2014.6899351
Kader Ba, S. Dellagi, N. Rezg
{"title":"Green management of Spare parts for an integrated optimal maintenance and production policy","authors":"Kader Ba, S. Dellagi, N. Rezg","doi":"10.1109/CoASE.2014.6899351","DOIUrl":"https://doi.org/10.1109/CoASE.2014.6899351","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"84 1","pages":"359-364"},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76793095","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 : 2013-11-07DOI: 10.1109/CoASE.2013.6653929
X. Qian, C. Ye
This paper presents a new RANSAC based method for extracting planes from 3D range data. The generic RANSAC Plane Extranction (PE) method may over-extract a plane. It may fail in the case of a multi-step scene where the RANSAC process results in multiple inlier patches that form a slant plane straddling the steps. The CC-RANSAC algorithm overcomes the latter limitation if the inlier patches are separate. However, it fails when the inlier patches are connected. A typical scenario is a stairway with a stairwall. In this case the RANSAC plane-fitting produces inlier patches (in the tread, riser and stairwall planes) that connect together to form a plane. The proposed method, called NCC-RANSAC, performs a normal-coherence check to all data points of the inlier patches and removes those points whose normal directions are contradictory to that of the fitted plane. This procedure results in a set of separate inlier patches, each of which is then extended into a plane in its entirety by a recursive plane clustering process. The RANSAC plane-fitting and recursive plane clustering processes are repeated until no more planes are found. A probabilistic model is introduced to predict the success probability of the NCC-RANSAC method and validated with the real data of a 3D camera-SwissRanger SR4000. Experimental results demonstrate that the proposed method extracts more accurate planes with less computational time than the existing RANSAC based methods. The proposed method is intended to be used by a robotic navigational device for the visually impaired for object detection/recognition in indoor environments.
{"title":"NCC-RANSAC: A fast plane extraction method for navigating a smart cane for the visually impaired","authors":"X. Qian, C. Ye","doi":"10.1109/CoASE.2013.6653929","DOIUrl":"https://doi.org/10.1109/CoASE.2013.6653929","url":null,"abstract":"This paper presents a new RANSAC based method for extracting planes from 3D range data. The generic RANSAC Plane Extranction (PE) method may over-extract a plane. It may fail in the case of a multi-step scene where the RANSAC process results in multiple inlier patches that form a slant plane straddling the steps. The CC-RANSAC algorithm overcomes the latter limitation if the inlier patches are separate. However, it fails when the inlier patches are connected. A typical scenario is a stairway with a stairwall. In this case the RANSAC plane-fitting produces inlier patches (in the tread, riser and stairwall planes) that connect together to form a plane. The proposed method, called NCC-RANSAC, performs a normal-coherence check to all data points of the inlier patches and removes those points whose normal directions are contradictory to that of the fitted plane. This procedure results in a set of separate inlier patches, each of which is then extended into a plane in its entirety by a recursive plane clustering process. The RANSAC plane-fitting and recursive plane clustering processes are repeated until no more planes are found. A probabilistic model is introduced to predict the success probability of the NCC-RANSAC method and validated with the real data of a 3D camera-SwissRanger SR4000. Experimental results demonstrate that the proposed method extracts more accurate planes with less computational time than the existing RANSAC based methods. The proposed method is intended to be used by a robotic navigational device for the visually impaired for object detection/recognition in indoor environments.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"2 1","pages":"261-267"},"PeriodicalIF":0.0,"publicationDate":"2013-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89260558","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
扫码关注我们
求助内容：
应助结果提醒方式：