Pub Date : 2005-09-12DOI: 10.1109/COASE.2005.1506769
T. Chiang, L. Fu
This paper addresses the general job shop scheduling problem with the objective as how to increase the meet-due-date rate. An iterative schedule refining mechanism is proposed, which iteratively adjusts the estimation of the remaining processing times of jobs in a dynamic and stage-specific manner. The refining mechanism is applied to a recently proposed sequencing heuristic and the integrated approach shows satisfactory performance through a comprehensive simulation study. Besides, we also show that the proposed refining mechanism can bring much improvement to several conventional rules.
{"title":"An iterative refining mechanism for general job shop scheduling problems","authors":"T. Chiang, L. Fu","doi":"10.1109/COASE.2005.1506769","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506769","url":null,"abstract":"This paper addresses the general job shop scheduling problem with the objective as how to increase the meet-due-date rate. An iterative schedule refining mechanism is proposed, which iteratively adjusts the estimation of the remaining processing times of jobs in a dynamic and stage-specific manner. The refining mechanism is applied to a recently proposed sequencing heuristic and the integrated approach shows satisfactory performance through a comprehensive simulation study. Besides, we also show that the proposed refining mechanism can bring much improvement to several conventional rules.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131836021","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506747
K. Zhu, Hang Zheng, J. Lavanya
It is a known fact that postoperative hypertension is common in cardiac patients and untreated hypertension may result in severe complications. The aim of an automatic drug delivery controller is to quickly reduce the oscillatory change in mean blood pressure through infusion of sodium nitroprusside (SNP). This paper presents an adaptive PI control of mean blood pressure using vasoactive drugs like SNP. A new algorithm updating variations in time delay and sensitivity of the system is proposed and its effectiveness is discussed. For demonstration, simulations under clinical conditions are carried out and the results show that the adaptive control system can effectively handle the changes in patient's dynamics and provide satisfactory performance in regulation of blood pressure of hypertension patients.
{"title":"An adaptive PI controller for regulation of pressure of hypertension patients","authors":"K. Zhu, Hang Zheng, J. Lavanya","doi":"10.1109/COASE.2005.1506747","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506747","url":null,"abstract":"It is a known fact that postoperative hypertension is common in cardiac patients and untreated hypertension may result in severe complications. The aim of an automatic drug delivery controller is to quickly reduce the oscillatory change in mean blood pressure through infusion of sodium nitroprusside (SNP). This paper presents an adaptive PI control of mean blood pressure using vasoactive drugs like SNP. A new algorithm updating variations in time delay and sensitivity of the system is proposed and its effectiveness is discussed. For demonstration, simulations under clinical conditions are carried out and the results show that the adaptive control system can effectively handle the changes in patient's dynamics and provide satisfactory performance in regulation of blood pressure of hypertension patients.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126441745","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 : 2005-09-12DOI: 10.1109/COASE.2005.1506749
O. C. Goemans, A. Levandowski, Ken Goldberg, A.F. van der Stappen
The vibratory bowl feeder remains the most common approach to the automated feeding (orienting) of industrial parts. We study the algorithmic design of a trap in the bowl feeder track that filters out all but one orientation of a given polygonal part. We propose a new class of traps that we call guillotine traps, which remove a portion of the track between two parallel lines. A major advantage of guillotine traps over previously studied traps is that they permit feeding the part in a user-specified stable orientation, whereas these other traps offered no control over the orientation to be fed. The capability of feeding a part in any priorly specified orientation for example offers the user a means of control over the feed rate. We present a complete algorithm that takes as input any polygonal part consisting of n vertices, along with its center of mass, and a desired output orientation of the part. Our algorithm computes a guillotine trap for a vibratory bowl feeder that outputs parts in the desired orientation, or reports that no such trap exists. The algorithm runs in O(n/spl alpha/(n) log n + nk), where /spl alpha/(n) is the extremely slowly growing inverse of the Ackermann function, and k is the number of candidate solutions. Although the value of k is trivially bounded by O(n), we conjecture that k is a small constant except for highly symmetric and regular parts. Surprisingly, our algorithm is considerably more efficient than the algorithm for the more restricted and hence less powerful gap trap, which was shown to run in O(n/sup 2/ log n) time. We have implemented our complete algorithm in Mathematica and C++.
振动碗式给料机仍然是工业零件自动喂料(定向)的最常用方法。我们研究了一种在碗形馈线轨道上的陷阱的算法设计，该陷阱可以过滤掉给定多边形部分的所有方向，只保留一个方向。我们提出了一种新的陷阱，我们称之为“断头台陷阱”，它可以去除两条平行线之间的一部分轨道。与先前研究的陷阱相比，断头台陷阱的一个主要优点是，它们允许以用户指定的稳定方向馈送零件，而其他陷阱无法控制馈送方向。例如，以任何预先指定的方向馈送零件的能力为用户提供了控制馈送速率的手段。我们提出了一个完整的算法，该算法将由n个顶点组成的任何多边形部分及其质心和该部分的期望输出方向作为输入。我们的算法计算了振动碗式给料机的断头台陷阱，该陷阱可以在期望的方向上输出零件，或者报告不存在这样的陷阱。该算法运行时间为O(n/spl alpha/(n) log n + nk)，其中/spl alpha/(n)为Ackermann函数的极慢增长逆，k为候选解的个数。虽然k的值通常以O(n)为界，但我们推测，除了高度对称和规则的部分外，k是一个小常数。令人惊讶的是，我们的算法比更受限制的、因此不那么强大的间隙陷阱的算法要有效得多，间隙陷阱的运行时间为O(n/sup 2/ log n)。我们已经在Mathematica和c++中实现了完整的算法。
{"title":"On the design of guillotine traps for vibratory bowl feeders","authors":"O. C. Goemans, A. Levandowski, Ken Goldberg, A.F. van der Stappen","doi":"10.1109/COASE.2005.1506749","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506749","url":null,"abstract":"The vibratory bowl feeder remains the most common approach to the automated feeding (orienting) of industrial parts. We study the algorithmic design of a trap in the bowl feeder track that filters out all but one orientation of a given polygonal part. We propose a new class of traps that we call guillotine traps, which remove a portion of the track between two parallel lines. A major advantage of guillotine traps over previously studied traps is that they permit feeding the part in a user-specified stable orientation, whereas these other traps offered no control over the orientation to be fed. The capability of feeding a part in any priorly specified orientation for example offers the user a means of control over the feed rate. We present a complete algorithm that takes as input any polygonal part consisting of n vertices, along with its center of mass, and a desired output orientation of the part. Our algorithm computes a guillotine trap for a vibratory bowl feeder that outputs parts in the desired orientation, or reports that no such trap exists. The algorithm runs in O(n/spl alpha/(n) log n + nk), where /spl alpha/(n) is the extremely slowly growing inverse of the Ackermann function, and k is the number of candidate solutions. Although the value of k is trivially bounded by O(n), we conjecture that k is a small constant except for highly symmetric and regular parts. Surprisingly, our algorithm is considerably more efficient than the algorithm for the more restricted and hence less powerful gap trap, which was shown to run in O(n/sup 2/ log n) time. We have implemented our complete algorithm in Mathematica and C++.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121622718","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 : 2005-08-01DOI: 10.1109/COASE.2005.1506761
O. Guschinskaya, A. Dolgui, N. Guschinsky, G. Levin
The paper deals with the minimization of the number of pieces of equipment for transfer lines with multi-spindle workstations. The preliminary design stage is considered. The machining operations are grouped into blocks. Each block executed by one spindle head. The relations of the necessity and the possibility of combining operations in blocks and workstations as well as precedence constraints are given. The problem is to find the best assignment of operations to blocks and to workstations, whereas minimizing the number of pieces of equipment used. The solution must provide a desired productivity (cycle time), it must also satisfy precedence and compatibility constraints. The problem is a generalization of the simple assembly line balancing problem. A combined heuristic approach is proposed. It is based on decomposition of the initial problem into several sub-problems and solving them by an exact algorithm. Results of computational experiments are presented.
{"title":"A combined heuristic approach for optimization of a class of machining lines","authors":"O. Guschinskaya, A. Dolgui, N. Guschinsky, G. Levin","doi":"10.1109/COASE.2005.1506761","DOIUrl":"https://doi.org/10.1109/COASE.2005.1506761","url":null,"abstract":"The paper deals with the minimization of the number of pieces of equipment for transfer lines with multi-spindle workstations. The preliminary design stage is considered. The machining operations are grouped into blocks. Each block executed by one spindle head. The relations of the necessity and the possibility of combining operations in blocks and workstations as well as precedence constraints are given. The problem is to find the best assignment of operations to blocks and to workstations, whereas minimizing the number of pieces of equipment used. The solution must provide a desired productivity (cycle time), it must also satisfy precedence and compatibility constraints. The problem is a generalization of the simple assembly line balancing problem. A combined heuristic approach is proposed. It is based on decomposition of the initial problem into several sub-problems and solving them by an exact algorithm. Results of computational experiments are presented.","PeriodicalId":181408,"journal":{"name":"IEEE International Conference on Automation Science and Engineering, 2005.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115826175","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
扫码关注我们
求助内容：
应助结果提醒方式：