• 제목/요약/키워드: Rule-based Dispatching

검색결과 50건 처리시간 0.026초

생산일정계획을 위한 지식 기반 모의실험 (Knowledge Based Simulation for Production Scheduling)

  • 나태영;김승권;김선욱
    • 대한산업공학회지
    • /
    • 제23권1호
    • /
    • pp.197-213
    • /
    • 1997
  • It is not easy to find a good production schedule which can be used in practice. Therefore, production scheduling simulation with a simple dispatching rule or a set of dispatching rules is used. However, a simple dispatching rule may not create a robust schedule, for the same rule is blindly applied to all internal production processes. The presumption is that there might be a specific combination of appropriate rules that can improve the efficiency of a total production system for a certain type of orders. In order to acquire a better set of dispatching rules, simulation is used to examine the performance of various combinations of dispatching rule sets. There are innumerable combination of rule sets. Hence it takes too much computer simulation time to find a robust set of dispatching rule for a specific production system. Therefore, we propose a concept of the knowledge based simulation to circumvent the problem. The knowledge based simulation consists of knowledge bases, an inference engine and a simulator. The knowledge base is made of rule sets that is extracted from both simulation and human intuition obtained by the simulation studies. For a certain type of orders, the proposed system provides several sets of dispatching rules that are expected to generate better results. Then the scheduler tries to find the best by simulating all proposed set of rules with the simulator. The knowledge-based simulator armed with the acquired knowledge has produced improved solutions in terms of time and scheduling performance.

  • PDF

반도체 생산 공정에서 포토장비의 부하 밸런싱을 위한 Dedication 부하 기반 디스패칭 룰 (Dedication Load Based Dispatching Rule for Load Balancing of Photolithography Machines in Wafer FABs)

  • 조강훈;정용호;박상철
    • 한국CDE학회논문집
    • /
    • 제22권1호
    • /
    • pp.1-9
    • /
    • 2017
  • This research develops dispatching rule for a wafer FABs with dedication constraints. Dedication, mostly considered in a photolithography step, is a feature in a modern FABs in order to increase the yield of machines and achieve the advance of manufacturing technology. However, the dedication has the critical problem because it causes dedication load of machines to unbalance. In this paper, we proposes the dedication load based dispatching rule for load balancing in order to resolve the problem. The objective of this paper is to balance dedication load of photo machines in wafer FABs with dedication constraint. Simulation experiments show that the proposed rule improves the performance of wafer FABs as well as load balance for dedication machines compared to open-loop control based conventional dispatching rule.

혼합 흐름공정의 할당규칙조합에 관한 연구: 인쇄회로기판 공정을 중심으로 (A Study on Combinatorial Dispatching Decision of Hybrid Flow Shop : Application to Printed Circuit Board Process)

  • 윤성욱;고대훈;김지현;정석재
    • 대한산업공학회지
    • /
    • 제39권1호
    • /
    • pp.10-19
    • /
    • 2013
  • Dispatching rule plays an important role in a hybrid flow shop. Finding the appropriate dispatching rule becomes more challenging when there are multiple criteria, uncertain demands, and dynamic manufacturing environment. Using a single dispatching rule for the whole shop or a set of rules based on a single criterion is not sufficient. Therefore, a multi-criteria decision making technique using 'the order preference by similarity to ideal solution' (TOPSIS) and 'analytic hierarchy process' (AHP) is presented. The proposed technique is aimed to find the most suitable set of dispatching rules under different manufacturing scenarios. A simulation based case study on a PCB manufacturing process is presented to illustrate the procedure and effectiveness of the proposed methodology.

시스템 LSI 반도체 FAB의 납기만족을 위한 예약 기반의 디스패칭 룰 (Reservation based Dispatching Rule for On-Time Delivery in System LSI Semiconductor FAB)

  • 서정철;정용호;박상철
    • 한국CDE학회논문집
    • /
    • 제19권3호
    • /
    • pp.236-244
    • /
    • 2014
  • Presented in the paper is a reservation based dispatching rule to achieve the on-time delivery in system LSI (large scale integrated circuit) semiconductor fabrication (FAB) with urgent orders. Using the proposed reservation based dispatching rule, urgent lots can be processed without waiting in a queue. It is possible to achieve the on-time delivery of urgent orders by reserving a proper tool for the next step in advance while urgent lots are being processed at the previous step. It can cause, however, tardiness of normal lots, because the proposed rule assign urgent lots first. To solve this problem, the proposed rule tries to find the best tool for the reservation in the tool group, which can minimize idle time, and the reservation rule is applied at all tools except for photolithography tools (bottleneck). $MOZART^{(R)}$ which is developed by VMS solutions are used for simulation experiments. The experimentation results show that the reservation based dispatching rule can achieve the on-time delivery of normal lots as well as urgent lots.

색도 및 색순에 따른 그라비아 인쇄 공정의 작업 순서 결정 규칙 (Dispatching Rule based on Chromaticity and Color Sequence Priorities for the Gravure Printing Operation)

  • 배재호
    • 산업경영시스템학회지
    • /
    • 제43권3호
    • /
    • pp.10-20
    • /
    • 2020
  • This paper presents a method to measure the similarity of assigned jobs in the gravure printing operation based on the chromaticity and color sequence, and order the jobs accordingly. The proposed dispatching rule can be used to fulfill diverse manufacturing site requirements because the parameters can be adjusted to prioritize chromaticity and color sequence. In general, dispatching rules either ignore the job-changing time or require that the time be clearly defined. However, in the gravure printing operation targeted in this study, it is difficult to apply the general dispatching rule because of the difficulties in quantifying the job-changing time. Therefore, we propose a method for generalizing assignment rules of the job planner, allocating relative similarity among assigned jobs, and determining the sequence of jobs accordingly. Chromaticity priority is determined by the arrangement of the color assignments in the printing operation; color sequence priority is determined by the addition, deletion, or change in a specific color sequence. Finally, the job similarity is determined by the dot product of the chromaticity and color sequence priorities. Implementation of the proposed dispatching rule at an actual manufacturing site showed the planner present the same job order as that obtained using the proposed rule. Therefore, this rule is expected to be useful in industrial sites where clear quantification of the job-changing time is not possible.

유한버퍼하에서 기계이용률과 산출량을 고려한 급송규칙 (A Dispatching Rule Considering Machine Utilization and Throughput under Finite Buffer Capacity)

  • 김종화;차상수
    • 산업공학
    • /
    • 제15권3호
    • /
    • pp.316-324
    • /
    • 2002
  • Automated Guided Vehicles are widely used as an essential material handling system for FMS to provide flexibility and efficiency. We suggest a new dispatching rule based on priority function which considers urgency and empty vehicle travel time under finite buffer capacity. We evaluate the performance of the proposed rule by comparing the performance of Shortest Travel Time/Distance(STT/D) rule in terms of machine utilization, throughput and WIP level using simulation. The simulation results show that the suggested dispatching rule is robust and provides better machine utilization, throughput with comparable WIP level compared to STT/D rule.

신경망을 이용한 무인운반차의 다요소배송규칙 (A Multi-attribute Dispatching Rule Using A Neural Network for An Automated Guided Vehicle)

  • 정병호
    • 한국시뮬레이션학회논문지
    • /
    • 제9권3호
    • /
    • pp.77-89
    • /
    • 2000
  • This paper suggests a multi-attribute dispatching rule for an automated guided vehicle(AGV). The attributes to be considered are the number of queues in outgoing buffers of workstations, distance between an idle AGV and a workstation with a job waiting for the service of vehicle, and the number of queues in input buffers of the destination workstation of a job. The suggested rule is based on the simple additive weighting method using a normalized score for each attribute. A neural network approach is applied to obtain an appropriate weight vector of attributes based on the current status of the manufacturing system. Backpropagation algorithm is used to train the neural network model. The proposed dispatching rules and some single attribute rules are compared and analyzed by simulation technique. A number of simulation runs are executed under different experimental conditions to compare the several performance measures of the suggested rules and some existing single attribute dispatching rules each other.

  • PDF

자동화 컨테이너 터미널의 복수 규칙 기반 AGV 배차 전략 최적화 (Optimizing dispatching strategy based on multicriteria heuristics for AGVs in automated container terminal)

  • 김정민;최이;박태진;류광렬
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2011년도 춘계학술대회
    • /
    • pp.218-219
    • /
    • 2011
  • 본 논문은 컨테이너 운송을 위한 AGV(Automated Guided Vehicle) 배차 전략을 대상으로 한다. AGV 배차 문제는 안벽 크레인의 대기 시간과 AGV의 주행 거리를 최소화하도록 AGV에 작업을 할당하는 것이 목표이다. 터미널 환경의 동적인 특성으로 인해 계획 결과의 정확한 예측이 어렵고 수정이 빈번하기 때문에 실무에서는 의사결정 시간이 짧은 단순 규칙 기반 배차가 많이 쓰인다. 그러나 단순 규칙 기반 배차는 근시안적 특성으로 인해 배차의 다양한 성능 지표를 만족시키지 못하는 한계가 있으며 이를 극복하기 위해 본 논문에서는 복수 규칙 기반의 배차 전략을 제안한다. 복수 휴리스틱 기반 배차 전략은 여러 규칙의 가중합으로 구성되며 규칙 사이의 가중치를 최적화하기 위해 다목적 진화 알고리즘을 적용하였다. 시뮬레이션 실험을 통해 제안 방안이 기존 단일 규칙 기반 배차에 비해 더 좋은 성능을 보임을 확인하였다.

  • PDF

Research on the WIP-based Dispatching Rules for Photolithography Area in Wafer Fabrication Industries

  • Lin, Yu-Hsin;Tsai, Chih-Hung;Lee, Ching-En;Chiu, Chung-Ching
    • International Journal of Quality Innovation
    • /
    • 제8권2호
    • /
    • pp.132-146
    • /
    • 2007
  • Constructing an effective production control policy is the most important issue in wafer fabrication factories. Most of researches focus on the input regulations of wafer fabrication. Although many of these policies have been proven to be effective for wafer fabrication manufacturing, in practical, there is a need to help operators decide which lots should be pulled in the right time and to develop a systematic way to alleviate the long queues at the bottleneck workstation. The purpose of this study is to construct a photolithography workstation dispatching rule (PADR). This dispatching rule considers several characteristics of wafer fabrication and influential factors. Then utilize the weights and threshold values to design a hierarchical priority rule. A simulation model is also constructed to demonstrate the effect of the PADR dispatching rule. The PADR performs better in throughput, yield rate, and mean cycle time than FIFO (First-In-First-Out) and SPT (Shortest Process Time).

AGV시스템에서 적응 규칙을 갖는 퍼지 급송알고리듬에 관한 연구 (A Fuzzy Dispatching Algorithm with Adaptive Control Rule for Automated Guided Vehicle System in Job Shop Environment)

  • 김대범
    • 한국시뮬레이션학회논문지
    • /
    • 제9권1호
    • /
    • pp.21-38
    • /
    • 2000
  • A fuzzy dispatching algorithm with adaptable control scheme is proposed for more flexible and adaptable operation of AGV system. The basic idea of the algorithm is prioritization of all move requests based on the fuzzy urgency. The fuzzy urgency is measured by the fuzzy multi-criteria decision-making method, utilizing the relevant information such as incoming and outgoing buffer status, elapsed time of move request, and AGV traveling distance. At every dispatching decision point, the algorithm prioritizes all move requests based on the fuzzy urgency. The performance of the proposed algorithm is compared with several dispatching algorithms in terms of system throughput in a hypothetical job shop environment. Simulation experiments are carried out varying the level of criticality ratio of AGVs , the numbers of AGVs, and the buffer capacities. The rule presented in this study appears to be more effective for dispatching AGVs than the other rules.

  • PDF