• 제목/요약/키워드: dispatching

검색결과 346건 처리시간 0.025초

반도체 라인 물류시스템에서의 할당문제 기반 차량 배차 (Assignment Problem Based Vehicle Dispatching for a Semiconductio FAB)

  • 김병인;신재준;정상원
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2006년도 추계학술대회
    • /
    • pp.525-528
    • /
    • 2006
  • This paper considers the vehicle dispatching problem in the automated material handling system (AMHS) of a large scale semiconductor fabrication line, which consists of 18 bays, 468 equipments and uses more than 130 overhead hoist transporters (OHT). We propose an assignment problem based vehicle dispatching approach to take advantage of simultaneous vehicle reassignment based on up-to-date system status. The proposed approach compares fsvorably with the shortest travel distance first rule and with the reassignment based rule which was recently proposed by the authors, in the number of vehicles required and the average lead time.

  • PDF

트랜스퍼 크레인의 반입 및 반출 작업순서 결정규칙 (Sequencing receiving and delivery operations for a Transfer Crane)

  • 이경모;김갑환
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 1998년도 추계학술대회논문집:21세기에 대비한 지능형 통합항만관리
    • /
    • pp.309-313
    • /
    • 1998
  • Delay time of receiving and delivery is one of important factors that should be considered in the evaluation of the customer service level of a container terminal. In this study, dispatching rules are tested with the objective of minimizing the service delay time for arriving outside trucks. A dynamic programming model is suggested for a static dispatching problem in which all the truck arrivals are known in advance. In order to overcome the excessive computational time of the dynamic programming technique, several heuristic rules are suggested that can be applied in practices. A simulation study is carried out to test the performances of the heuristic rules.

  • PDF

응급통신소생술 도착전지시 프로토콜 기본설계 방안 (The Basic Design on Dispatch Life Support Pre-arrival Instruction Protocol)

  • 백홍석;김정현;오용교;조현
    • 한국응급구조학회지
    • /
    • 제4권1호
    • /
    • pp.17-29
    • /
    • 2000
  • As technology advances rapidly, emergency medical dispatching systems must also advance. Optimal emergency medical dispatching requires the courage to practice medicine at dispatch. Modern emergency medical dispatch provides appropriate resource responses with the use of an (Advanced Medical priority Dispatch System(AMPDS) in U.S.A. The AMPDS is a systematic protocol for all aspects of the dispatch process. Based on the AMPDS chief complaint list, we initiated a basic design on pre-arrival instruction protocol and completed the scripted pre-arrival instruction protocol, using Cardiopulmonary resuscitation(CPR) protocol. Implementation of this study creates computerized emergency medical dispatching system for future enhancements, such as the AMPDS.

  • PDF

AutoMod를 활용한 효율적 작업배정에 관한 연구 (A Study on the Job Dispatching using AutoMod)

  • 김봉선;이승무;이석환
    • 대한안전경영과학회:학술대회논문집
    • /
    • 대한안전경영과학회 2007년도 추계학술대회
    • /
    • pp.163-180
    • /
    • 2007
  • The purpose of this paper is to develop an efficient production strategy with changing factors to influence the productivity. The factors would be the number of Multi-Function worker, the method of job dispatching, and lot size. A simulation model has been developed for this study. We used AutoMod simulation and the process activity was animated to follow the flow of process easily. The alternatives have been tested through the simulation model, and the various alternatives is proposed for the efficient production strategy. We hope that the system is applied to similar types of small and medium-sized enterprises to develop an efficient production strategy and to achieve the satisfactory result.

  • PDF

자동생산시스템에서 납기를 고려한 동적주문투입정책 (Dynamic Order Release Policy Considering The Due Date of Order for Automated Manufacturing Systems)

  • 노인규;박찬웅
    • 한국국방경영분석학회지
    • /
    • 제22권2호
    • /
    • pp.153-165
    • /
    • 1996
  • This paper presents an order releasing algorithm for an AMS. Order release policy determine order releasing time to shop floor so as to improve order management and shop performance. The proposed order releasing algorithm can cope with the dynamic environment of orders(e.g. change or cancel of order) flexibly and fastly, by processing individual order and exchanging the information(e.g. compeletion time or lateness of order, etc) with customer. And the objective of the order releasing algorithm is the observance of the due-date, therefore, it can provide customer with a reliability of order. Computer simulation is used to obtain the makespan of order which is the input data of the order releasing algorithm. The eight candidate part dispatching rules are simulated to selected an effective part dispatching rule for the computer simulation. By using the best effective part dispatching rule, the computer simulation is conducted to determine order releasing time.

  • PDF

A Dispatching Method for Automated Guided Vehicles to Minimize Delays of Containership Operations

  • Kim, Kap-Hwan;Bae, Jong-Wook
    • Management Science and Financial Engineering
    • /
    • 제5권1호
    • /
    • pp.1-25
    • /
    • 1999
  • There is a worldwide trend to automate the handling operations in port container terminals in an effort to improve productivity and reduce labor cost. This study iscusses how to apply an AGV(automated guided vehicle) system to the handling of containers in the yard of a port container ter-minal. The main issue of this paper is how to assign tasks of container delivery to AGVs during ship operations in an automated port container terminal. A dual-cycle operation is assumed in which the loading and the discharging operation can be performed alternately. Mixed integer linear program-ming formulations are suggested for the dispatching problem. The completion time of all the dis-charging and loading operations by a quayside crane is minimized, and the minimization of the total travel time of AGVs is also considered as a secondary objective. A heuristic method using useful properties of the dispatching problem is suggested to reduce the computational time. The perfor-mance of the heuristic algorithm is evaluated in light of solution quality and computation time.

  • PDF

AutoMod를 활용한 작업배정에 관한 연구 (A Study on the Job Dispatching using AutoMod)

  • 김봉선;이승무;이석환
    • 대한안전경영과학회지
    • /
    • 제9권6호
    • /
    • pp.181-191
    • /
    • 2007
  • The purpose of this paper is to develop an efficient production strategy with changing factors to influence the productivity. The factors would be the number of Multi-Function worker, the method of job dispatching, and lot size. A simulation model has been developed for this study. We used AutoMod simulation and the process activity was animated to follow the flow of process easily. The alternatives have been tested through the simulation model, and the various alternatives is proposed for the efficient production strategy. We hope that the system is applied to similar types of small and medium-sized enterprises to develop an efficient production strategy and to achieve the satisfactory result.

납기지연시간 단축을 위해 AGV 시간을 고려한 작업할당 방법 (A AGV time-oriented Job Dispatching Methodology for Preventing the Tardiness)

  • 김근형;고효헌;백준걸
    • 대한안전경영과학회지
    • /
    • 제13권4호
    • /
    • pp.125-137
    • /
    • 2011
  • Customers are generally requiring a variety of products, earlier due date, and lower price. A manufacturing process needs the efficient scheduling to meet those customer's requirements. This study proposes the novel algorithm named MJA(Minimum Job completion time and AGV time) that increases the performance of machines and AGV(Automated Guided Vehicles) in many kinds of job types. MJA optimizes the bottleneck of machines and efficiency of AGV with considering two types of dispatching at the same time. Suggested algorithm was compared with existing heuristic methods by several simulations, it performed better for reducing the time of tardiness.

컨테이너 화물수송을 위한 차량배차 의사결정지원시스템 (Truck Dispatching Decision Support System for The Container Transportation Problem)

  • 김동희;이창호;김봉선
    • 대한산업공학회지
    • /
    • 제23권2호
    • /
    • pp.275-288
    • /
    • 1997
  • The container transportation problem is a kind of generalized pickup and delivery problem(GPDP), and a typical NP-hard problem of which polynomial algorithm has not yet been developed. In this problem, trucks have to transport containers from origins to destinations, while have to satisfy several restrictions such as request time, cargo closing time, driver's break time. In this paper, we present a straightforward heuristic and a user-interactive truck dispatching system which supports decision makers.

  • PDF

유연생산시스템에 있어서의 투입우선규칙에 관한 연구 (A Study on Dispatching Rules in a Flexible Manufacturing System)

  • 이근형;황승국;이강우
    • 산업경영시스템학회지
    • /
    • 제22권52호
    • /
    • pp.191-201
    • /
    • 1999
  • There have been a huge volume of researches concerning dispatching rules in job shop environments. Strangely, studies all but one pay no attention to multiple identical jobs due to the existence of production orders each of which calls for a fixed quantity, called an order size, of a specific part. Jobs arrive in the form of production orders in most, if not all, job shop type flexible manufacturing systems. This paper presents simple processing-time-based dispatching rules, and shows experimentally based on simulation that the rules with order-size considerations perform consistently well for tardiness and utilization measures. Several alternative strategies for rule specifications are examined.

  • PDF