Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560433
Araz Ashouri, Yitian Hu, G. Newsham, W. Shen
Building system faults in commercial and office buildings can result in a reduced occupant comfort and increased utility bills. Energy performance-based anomaly detection helps operators efficiently identify faults. In this work, a data-driven method for anomaly detection is presented. Using a symbolic aggregate method, the weekly energy demand profiles are statistically quantised and labeled to determine normal and abnormal building behaviours. A case study with three federal office buildings has been conducted to demonstrate the proposed method. The resulting technology provides building operators with easily-interpreted and actionable information for optimised building performance.
{"title":"Energy Performance Based Anomaly Detection in Non-Residential Buildings Using Symbolic Aggregate Approximation","authors":"Araz Ashouri, Yitian Hu, G. Newsham, W. Shen","doi":"10.1109/COASE.2018.8560433","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560433","url":null,"abstract":"Building system faults in commercial and office buildings can result in a reduced occupant comfort and increased utility bills. Energy performance-based anomaly detection helps operators efficiently identify faults. In this work, a data-driven method for anomaly detection is presented. Using a symbolic aggregate method, the weekly energy demand profiles are statistically quantised and labeled to determine normal and abnormal building behaviours. A case study with three federal office buildings has been conducted to demonstrate the proposed method. The resulting technology provides building operators with easily-interpreted and actionable information for optimised building performance.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"85 5","pages":"1400-1405"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91432804","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.8560449
F. Quinton, Idir Hamaz, L. Houssin
This paper considers the cyclic jobshop problem in a flexible context where is objective is to find the minimum cycle time of a periodic schedule. The flexibility feature comes from the ability of the machines or robots to perform several kinds of tasks. Hence, the scheduling problem does not only concern starting time of tasks but also on which machines the tasks will be performed. We propose an exact method to solve this problem and two heuristics.
{"title":"Algorithms for the flexible cyclic jobshop problem","authors":"F. Quinton, Idir Hamaz, L. Houssin","doi":"10.1109/COASE.2018.8560449","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560449","url":null,"abstract":"This paper considers the cyclic jobshop problem in a flexible context where is objective is to find the minimum cycle time of a periodic schedule. The flexibility feature comes from the ability of the machines or robots to perform several kinds of tasks. Hence, the scheduling problem does not only concern starting time of tasks but also on which machines the tasks will be performed. We propose an exact method to solve this problem and two heuristics.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"48 1","pages":"945-950"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91533742","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.8560374
Carlos Franco, V. Augusto, Thierry Garaix, Edgar Alfonso-Lizarazo, M. Bourdelin, H. Bontemps
Automation in healthcare is a major challenge to improve quality of service while compressing costs. In particular, correct administration of medicines to patients is crucial to ensure quality of care during hospitalization and minimize medication errors. Mistakes are more likely to happen when medicine administration is done manually (dispensing, ordering or administrating). To reduce the risks related to medication errors, automation of the pharmacy processes appears as an appropriately tool to solve this situation. In this paper, we have proposed a new mathematical model to optimize the processes related to unit-doses management and prescriptions preparation in a network of hospitals. To model the uncertainty associated with the demand of medicines, the concept of p-robustness is included; the concept of resilience is also considered to model the risk of centralized distribution processes.
{"title":"Strategic territorial deployment of hospital pharmacy robots using a stochastic p-robust optimization approach","authors":"Carlos Franco, V. Augusto, Thierry Garaix, Edgar Alfonso-Lizarazo, M. Bourdelin, H. Bontemps","doi":"10.1109/COASE.2018.8560374","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560374","url":null,"abstract":"Automation in healthcare is a major challenge to improve quality of service while compressing costs. In particular, correct administration of medicines to patients is crucial to ensure quality of care during hospitalization and minimize medication errors. Mistakes are more likely to happen when medicine administration is done manually (dispensing, ordering or administrating). To reduce the risks related to medication errors, automation of the pharmacy processes appears as an appropriately tool to solve this situation. In this paper, we have proposed a new mathematical model to optimize the processes related to unit-doses management and prescriptions preparation in a network of hospitals. To model the uncertainty associated with the demand of medicines, the concept of p-robustness is included; the concept of resilience is also considered to model the risk of centralized distribution processes.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"18 1","pages":"390-395"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87617171","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.8560481
Xin Luo, Mengchu Zhou
Non-negativity is vital for latent factor models to preserve the important feature of most high-dimensional and sparse (HiDS) matrices, e.g., none of their entries is negative. With the consideration of non-negativity, the training process of a latent factor model should be specified to achieve constraints-incorporated learning schemes. However, such schemes are neither flexible nor extensible. This work investigates algorithms of inherently non-negative latent factor analysis, which separates non-negativity constraints from the training process. Based on a deep investigation into the learning objective of a non-negative latent factor model, we separate the desired latent factors from decision variables involved in the training process via a single-element-dependent mapping function that makes the output factors inherently non-negative. Then we theoretically prove that the resultant model is able to represent the original one effectively. As a result, we design a highly efficient algorithm to bring the Inherently Non-negative Latent Factor model into practice. Experimental results on three HiDS matrices from industrial recommender systems show that compared with state-of-the-art non-negative latent factor models, the proposed one is able to obtain advantage in prediction accuracy with comparable or higher computational efficiency. Moreover, such high performance is achieved through its unconstrained optimization process on the premise of fulfilling the non-negativity constraints. Hence, the proposed model is highly valuable for industrial applications required to handle HiDS matrices subject to non-negativity constraints.
{"title":"Unconstrained Non-negative Factorization of High-dimensional and Sparse Matrices in Recommender Systems","authors":"Xin Luo, Mengchu Zhou","doi":"10.1109/COASE.2018.8560481","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560481","url":null,"abstract":"Non-negativity is vital for latent factor models to preserve the important feature of most high-dimensional and sparse (HiDS) matrices, e.g., none of their entries is negative. With the consideration of non-negativity, the training process of a latent factor model should be specified to achieve constraints-incorporated learning schemes. However, such schemes are neither flexible nor extensible. This work investigates algorithms of inherently non-negative latent factor analysis, which separates non-negativity constraints from the training process. Based on a deep investigation into the learning objective of a non-negative latent factor model, we separate the desired latent factors from decision variables involved in the training process via a single-element-dependent mapping function that makes the output factors inherently non-negative. Then we theoretically prove that the resultant model is able to represent the original one effectively. As a result, we design a highly efficient algorithm to bring the Inherently Non-negative Latent Factor model into practice. Experimental results on three HiDS matrices from industrial recommender systems show that compared with state-of-the-art non-negative latent factor models, the proposed one is able to obtain advantage in prediction accuracy with comparable or higher computational efficiency. Moreover, such high performance is achieved through its unconstrained optimization process on the premise of fulfilling the non-negativity constraints. Hence, the proposed model is highly valuable for industrial applications required to handle HiDS matrices subject to non-negativity constraints.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"14 1","pages":"1406-1413"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87116926","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}
Implementing intelligent manufacturing services on factory-wide edge devices connected with production equipment efficiently so that those manufacturing services are pluggable, plug-and-play, and manageable through the network is a challenging task and is highly beneficial for facilitating realizing a smart factory. This paper proposes a cloud-based pluggable manufacturing service scheme (called CPMSS) by leveraging cloud computing, edge computing, and RESTful Web Service to address this issue. By using a two-layer-RESTful-service mechanism, the manufacturing services can be built in the form of pluggable application module (PAM). The proposed CPMSS allows the engineers to deploy selected PAMs from the cloud to target edge devices efficiently and to run and manage the plugged PAMs remotely through the cloud platform using Web-based GUIs for supporting intelligent manufacturing activities on target production equipment. Thereby, CPMSS can facilitate fast and factory-wide deployment of intelligent manufacturing services on edge devices for supporting smart manufacturing. Finally, an industrial case study performing predictive maintenance (PdM) on PECVD equipment of a solar cell manufacturing factory is used to demonstrate the effectiveness of the CPMSS.
在工厂范围内的边缘设备上实现与生产设备连接的智能制造服务，使这些制造服务可插拔、即插即用，并通过网络进行管理，这是一项具有挑战性的任务，对实现智能工厂非常有益。本文提出了一种基于云的可插拔制造服务方案(CPMSS)，利用云计算、边缘计算和RESTful Web service来解决这一问题。通过使用两层restful服务机制，可以以可插拔应用程序模块(PAM)的形式构建制造服务。提出的CPMSS允许工程师将选定的PAMs从云有效地部署到目标边缘设备，并通过云平台使用基于web的gui远程运行和管理插入的PAMs，以支持目标生产设备上的智能制造活动。因此，CPMSS可以促进在边缘设备上快速和工厂范围内部署智能制造服务，以支持智能制造。最后，通过对某太阳能电池制造工厂的PECVD设备进行预测性维护(PdM)的工业案例研究，验证了CPMSS的有效性。
{"title":"A Cloud-based Pluggable Manufacturing Service Scheme for Smart Factory","authors":"Yu-Yang Liu, Min-Hsiung Hung, Yu-Chuan Lin, Chao-Chun Chen, Wei-Lun Gao, F. Cheng","doi":"10.1109/COASE.2018.8560401","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560401","url":null,"abstract":"Implementing intelligent manufacturing services on factory-wide edge devices connected with production equipment efficiently so that those manufacturing services are pluggable, plug-and-play, and manageable through the network is a challenging task and is highly beneficial for facilitating realizing a smart factory. This paper proposes a cloud-based pluggable manufacturing service scheme (called CPMSS) by leveraging cloud computing, edge computing, and RESTful Web Service to address this issue. By using a two-layer-RESTful-service mechanism, the manufacturing services can be built in the form of pluggable application module (PAM). The proposed CPMSS allows the engineers to deploy selected PAMs from the cloud to target edge devices efficiently and to run and manage the plugged PAMs remotely through the cloud platform using Web-based GUIs for supporting intelligent manufacturing activities on target production equipment. Thereby, CPMSS can facilitate fast and factory-wide deployment of intelligent manufacturing services on edge devices for supporting smart manufacturing. Finally, an industrial case study performing predictive maintenance (PdM) on PECVD equipment of a solar cell manufacturing factory is used to demonstrate the effectiveness of the CPMSS.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"51 1","pages":"1040-1045"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90058232","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.8560485
L. Grech, G. Valentino, M. D. Castro, C. V. Almagro
We present a working prototype of a low-cost collision avoidance system for the retractable Radio-Protection (RP) arm, to be mounted on the Train Inspection Monorail (TIM) which is located in the European Organization for Nuclear Research (CERN)'s Large Hadron Collider (LHC) tunnel. Such a system is needed to permit the safe movement of the TIM with personnel present in the tunnel while the RP arm is extended to allow on-board sensors to take radiation measurements. The prototype used a series of eight TeraRanger One (TR1) Infrared (IR) Time-of-Flight (ToF) sensors to take distance measurements of the tunnel floor and overlying obstacles. A real-time system was then designed and deployed on the microcontroller mounted on the TeraRanger Hub (TRH). Sensor characterisation tests were also performed on the TR1 sensors to determine their performance and also allowed for calibration to be performed to improve the measurement accuracy for different materials.
我们提出了一个低成本的防撞系统的工作原型，用于可伸缩的无线电防护(RP)臂，安装在位于欧洲核子研究组织(CERN)的大型强子对撞机(LHC)隧道的列车检查单轨(TIM)上。需要这样一个系统，以便在隧道中有人员的情况下，TIM可以安全移动，同时RP臂可以扩展，以便车载传感器可以进行辐射测量。原型机使用了一系列8个TeraRanger One (TR1)红外(IR)飞行时间(ToF)传感器来测量隧道底板和上覆障碍物的距离。然后设计了一个实时系统，并将其部署在安装在TeraRanger Hub (TRH)上的微控制器上。还对TR1传感器进行了传感器特性测试，以确定其性能，并允许进行校准，以提高对不同材料的测量精度。
{"title":"Collision Avoidance System for the RP Survey and Visual Inspection Train in the CERN Large Hadron Collider","authors":"L. Grech, G. Valentino, M. D. Castro, C. V. Almagro","doi":"10.1109/COASE.2018.8560485","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560485","url":null,"abstract":"We present a working prototype of a low-cost collision avoidance system for the retractable Radio-Protection (RP) arm, to be mounted on the Train Inspection Monorail (TIM) which is located in the European Organization for Nuclear Research (CERN)'s Large Hadron Collider (LHC) tunnel. Such a system is needed to permit the safe movement of the TIM with personnel present in the tunnel while the RP arm is extended to allow on-board sensors to take radiation measurements. The prototype used a series of eight TeraRanger One (TR1) Infrared (IR) Time-of-Flight (ToF) sensors to take distance measurements of the tunnel floor and overlying obstacles. A real-time system was then designed and deployed on the microcontroller mounted on the TeraRanger Hub (TRH). Sensor characterisation tests were also performed on the TR1 sensors to determine their performance and also allowed for calibration to be performed to improve the measurement accuracy for different materials.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"42 1","pages":"817-822"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73886997","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.8560398
R. Berenstein, A. Wallach, Pelagie Elimbi Moudio, Peter Cuellar, Ken Goldberg
Mobile manipulator robots can benefit from utilizing a range of tools such as: screwdrivers, paintbrushes, hammers, drills, and sensors such thermal cameras. Proprietary tool changing systems exist for stationary robots but we are not aware of one for mobile manipulators. We design and implemented a modular tool changer with three components: robot attachment, tool attachment, and tool housing, designed with the following constrains: low-cost, backlash-free, compact, lightweight, passive, and modular. The tool changer is compatible with many robots and was evaluated with the Fetch robot for 100 repetitions of connecting and releasing the tool, of which 92 were successful. All 8 failures were due to inaccurate position of the robot arm. Changing a tool, from pickup to return, took on average of 16 seconds. This work is part of an ongoing research project on precision irrigation. The design is open-source and freely available at: https://goo.gl/zetwct.
{"title":"An Open-Access Passive Modular Tool Changing System for Mobile Manipulation Robots","authors":"R. Berenstein, A. Wallach, Pelagie Elimbi Moudio, Peter Cuellar, Ken Goldberg","doi":"10.1109/COASE.2018.8560398","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560398","url":null,"abstract":"Mobile manipulator robots can benefit from utilizing a range of tools such as: screwdrivers, paintbrushes, hammers, drills, and sensors such thermal cameras. Proprietary tool changing systems exist for stationary robots but we are not aware of one for mobile manipulators. We design and implemented a modular tool changer with three components: robot attachment, tool attachment, and tool housing, designed with the following constrains: low-cost, backlash-free, compact, lightweight, passive, and modular. The tool changer is compatible with many robots and was evaluated with the Fetch robot for 100 repetitions of connecting and releasing the tool, of which 92 were successful. All 8 failures were due to inaccurate position of the robot arm. Changing a tool, from pickup to return, took on average of 16 seconds. This work is part of an ongoing research project on precision irrigation. The design is open-source and freely available at: https://goo.gl/zetwct.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"353 1","pages":"592-598"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78093290","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.8560521
Dong-Hyun Roh, Tae-Eog Lee
Cluster tools are widely used manufacturing equipment in semiconductor manufacturing systems and consist of several process chambers, loadlock modules, and a wafer transport robot. The operation of the cluster tool relies on decision making about the robot operations. Generally, a robot iteratively determines its next task according to a given task sequence. This tool schedule is called a cyclic schedule. If the same timing pattern repeats every $K$ work cycles in a cyclic schedule, the schedule is called a $K$ -cyclic schedule. In a cluster tool with a $K$ -cyclic schedule, wafer delay, which is the time that a processed wafer is stored in the process chamber, becomes an important issue. In this study, we identify the worst-case wafer delay, which is the maximum value of wafer delay among all the $K$ -cyclic schedules a cluster tool can have. To do this, we present timed event graph models for dual-armed and single-armed cluster tools and briefly explain the previous research on closed-form formulae of token delays in timed event graphs with K-cyclic schedules suggested by Lee et al. [1]. Finally, we propose a method for deriving a closed-form formula for the worst-case wafer delay in a cluster tool, which can be applied to arbitrary wafer flow patterns and time parameters.
{"title":"Characterizing the Worst-Case Wafer Delay in a Cluster Tool Operated in a $K$-Cyclic Schedule","authors":"Dong-Hyun Roh, Tae-Eog Lee","doi":"10.1109/COASE.2018.8560521","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560521","url":null,"abstract":"Cluster tools are widely used manufacturing equipment in semiconductor manufacturing systems and consist of several process chambers, loadlock modules, and a wafer transport robot. The operation of the cluster tool relies on decision making about the robot operations. Generally, a robot iteratively determines its next task according to a given task sequence. This tool schedule is called a cyclic schedule. If the same timing pattern repeats every $K$ work cycles in a cyclic schedule, the schedule is called a $K$ -cyclic schedule. In a cluster tool with a $K$ -cyclic schedule, wafer delay, which is the time that a processed wafer is stored in the process chamber, becomes an important issue. In this study, we identify the worst-case wafer delay, which is the maximum value of wafer delay among all the $K$ -cyclic schedules a cluster tool can have. To do this, we present timed event graph models for dual-armed and single-armed cluster tools and briefly explain the previous research on closed-form formulae of token delays in timed event graphs with K-cyclic schedules suggested by Lee et al. [1]. Finally, we propose a method for deriving a closed-form formula for the worst-case wafer delay in a cluster tool, which can be applied to arbitrary wafer flow patterns and time parameters.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"25 1","pages":"1562-1567"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81074389","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.8560516
Tadeu K. Zubaran, M. Ritt
In this work we consider a job shop scheduling problem with the objective of minimizing the makespan. As in the standard job shop problem, the operations of each job have to be processed on different stages in a given order, but in the problem variant studied here each stage disposes of parallel machines. The number of parallel machines may vary from stage to stage, yet if all stages have a single machine we have the standard job shop problem. We propose a tabu search to solve this problem, which searches for good job-stage assignments, and combine it with an effective heuristic rule to derive a complete schedule from them.
{"title":"An effective tabu search for job shop scheduling with parallel machines","authors":"Tadeu K. Zubaran, M. Ritt","doi":"10.1109/COASE.2018.8560516","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560516","url":null,"abstract":"In this work we consider a job shop scheduling problem with the objective of minimizing the makespan. As in the standard job shop problem, the operations of each job have to be processed on different stages in a given order, but in the problem variant studied here each stage disposes of parallel machines. The number of parallel machines may vary from stage to stage, yet if all stages have a single machine we have the standard job shop problem. We propose a tabu search to solve this problem, which searches for good job-stage assignments, and combine it with an effective heuristic rule to derive a complete schedule from them.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"62 1","pages":"913-919"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81348210","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.8560603
Ping Yang, S. Hsu
In this paper we consider the Laplacian controllability problem of combining two special threshold graphs. We form this combination by connecting two identical and connected threshold graphs which have exactly one repeated degree. With appropriate selection of connecting vertices for combination we show how to use the minimum number of inputs to render the combined graph Laplacian controllable. Numerical examples are provided to demonstrate our work.
{"title":"On a class of multi-input laplacian controllable graphs","authors":"Ping Yang, S. Hsu","doi":"10.1109/COASE.2018.8560603","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560603","url":null,"abstract":"In this paper we consider the Laplacian controllability problem of combining two special threshold graphs. We form this combination by connecting two identical and connected threshold graphs which have exactly one repeated degree. With appropriate selection of connecting vertices for combination we show how to use the minimum number of inputs to render the combined graph Laplacian controllable. Numerical examples are provided to demonstrate our work.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"54 1","pages":"310-315"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86521644","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
扫码关注我们
求助内容：
应助结果提醒方式：