This study focuses on the formation of input release lots in a semiconductor wafer fabrication facility. After the order-lot pegging process assigns lots in the fab to orders and calculates the required quantity of wafers for each product type to meet customers’ orders, the decisions on the formation of input release lots should be made to minimize the production costs of the release lots. Since the number of lots being processed in the wafer fab directly is related to the productivity of the wafer fab, the input lot formation is crucial process to reduce the production costs as well as to improve the efficiency of the wafer fab. Here, the input lot formation occurs before every shift begins in the semiconductor wafer fab. When input quantities (of wafers) for product types are given from results of the order-lot pegging process, lots to be released into the wafer fab should be formed satisfying the lot size requirements. Here, the production cost of a homogeneous lot of the same type of product is less than that of a heterogeneous lot that will be split into the number of lots according to their product types after passing the branch point during the wafer fabrication process. Also, more production cost occurs if a lot becomes more heterogeneous. We developed a multi-dimensional dynamic programming algorithm for the input lot formation problem and showed how to apply the algorithm to solve the problem optimally with an example problem instance. It is necessary to reduce the number of states at each stage in the DP algorithm for practical use. Also, we can apply the proposed DP algorithm together with lot release rules such as CONWIP and UNIFORM.
Quality function deployment (QFD) is a useful method in product design and development to maximize customer satisfaction. In the QFD, the technical attributes (TAs) affecting the product performance are identified, and product performance is improved to optimize customer requirements (CRs). For product development, determining the optimal levels of TAs is crucial during QFD optimization. Many optimization methods have been proposed to obtain the optimal levels of TAs in QFD. In these studies, the levels of TAs are assumed to be continuous while they are often taken as discrete in real world application. Another assumption in QFD optimization is that the requirements of the heterogeneous customers can be generalized and hence only one house of quality (HoQ) is used to connect with CRs. However, customers often have various requirements and preferences on a product. Therefore, a product market can be partitioned into several market segments, each of which contains a number of customers with homogeneous preferences. To overcome these problems, this paper proposes an optimization approach to find the optimal set of TAs under multi-segment market. Dynamic Programming (DP) methodology is developed to maximize the overall customer satisfaction for the market considering the weights of importance of different segments. Finally, a case study is provided for illustrating the proposed optimization approach.
An unmanned aerial vehicle (UAV) is a powered aerial vehicle that does not carry a human operator, uses aerodynamic forces to provide vehicle lift, can fly autonomously or be piloted remotely, can be expendable or recoverable, and can carry a lethal or no
본 논문에서는 동적계획법과 계층적 변이추적을 이용한 새로운 스테레오 정합 알고리즘을 제안
한다. 기존 동적계획법을 이용한 정합 알고리즘에서는 밝기 변화가 적거나 폐색영역과 같은 정합 화소
의 부재 등으로 인하여 정합 오류를 동반하므로 생성된 변이 맵을 신뢰할 수 없는 문제를 갖는다. 그러
므로 제안한 방법에서는 계층간의 변이 추적기법을 도입하여 이러한 정합 오류를 복원할 수 있도록 알
고리즘을 구성하였다. 입력된 스테레오 영상을 부 표본화를 통해 계층화 하고 동적계획법을 이용하여
생성된 각 계층의 변이 맵으로부터 계층사이의 변이 이동오차와 밝기에 기반한 정합오차를 계산하여
정합 오류를 줄임으로써 보다 정확한 변이를 선택하도록 하였다. 실험 결과에서 보듯이 밝기 변화가
적은 영역과 폐색영역 등에서 기존의 동적계획법방법 보다 개선된 성능을 보였다.
This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of v
Changes in manufacturing system are those that occur during production and cause the systems to behave unpredictably. So scheduling problem in this dynamic industrial environments is very complex. The main concept of this dissertation is to continuously m
Change in manufacturing systems are those that occur during production and cause the systems to behave unpredictably. So scheduling problem in this dynamic industrial environments is very complex. The main concept of This dissertation is to continuously monitor a manufacturing system' status(RPJ, RLJ, RSDJ, JIT) and detect or predict a change so that scheduling system will react by Modifying production schedule(dispaching rule) to lessen the effects of this change.
현재 부산항신항과 배후단지 물류업체를 연계하는 셔틀운송에는 배후단지 물류업체가 독자적으로 운송차량을 보유하고 운용함으로써 자원소모의 중복성이 있으며 불규칙한 운송화물의 발생으로 화물운송에 매번 다른 차량이 투입되어 업체들이 특정 지역에 밀집되어 있는 단지의 지리적 효과를 충분히 활용하지 못하고 있다. 따라서 본 연구는 이러한 문제들을 해결하기 위해 동적계획을 구성하고 휴리스틱 방법을 통해 작업 스케줄링과 실시간 작업규칙을 구성하며 물류기업의 수 배송 계획에 풀링과 듀얼사이클링을 적용하여 셔틀운송에 소요된 자원의 감축효과와 효율성을 시뮬레이션을 통해 검증한다.
한국수자원공사는 낙동강 및 금강수계에 대해 실시간 물관리 시스템을 개발하여 수계 내 다목적 댐의 효율적인 운영을 도모하였다. 본 연구에서는 이를 확장하여 최적화 기법인 표본 추계학적 동적계획법을 사용하여 한강수계 다목적댐의 효율적인 월말 목표저수량을 산정하고 이를 통해 실시간 물관리시스템의 효율을 극대화하고자 수행되었다. 수계 내 댐중 저수용량과 용수공급 측면에서 중요도가 높은 소양강댐, 충주댐, 화천댐 등 3개 댐만을 대상으로 모형을 개발하였으며 저수
This paper describes an efficient path generation method for area coverage. Its applications include robots for de-mining, cleaning, painting, and so on. Our method is basically based on a divide and conquer strategy. We developed a novel cell decomposition algorithm that divides a given area into several cells. Each cell is covered by a robot motion that requires minimum time to cover the cell. Using this method, completeness and time efficiency of coverage are easily achieved. For the completeness of coverage in dynamic environments, we also propose a path following method that makes the robot cover missed areas as a result of the presence of unknown obstacles. The effectiveness of the method is verified using computer simulations.
저수지 운영의 기초가 되는 운영률은 대부분 과거기록 유입량중 최대 혹은 최소의 극한치 자료를 이용하거나 평균치 자료를 이용하여 도출하기 때문에 실제 운영에서 발생할 수 있는 불확실성에 대처한 기대편익 산정이나 운영방안 수립에는 적절히 이용할 수 없다. 또한 지금까지 개발된 대부분의 운영률은 유입량을 포함하여 모든 운영변수를 이미 알고 있다는 확정론적 방법에 기초하고 있어 유입량의 불확실성을 반영하지 못하는 단점이 있다. 이를 개선할 수 있는 방법으로 추