• Title/Summary/Keyword: Dispatching System

Search Result 205, Processing Time 0.023 seconds

Fleet Sizing under Dynamic Vehicle Dispatching (동적 차량배차 환경에서의 차량 대수 결정)

  • Koo, Pyung-Hoi;Suh, Jungdae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.3
    • /
    • pp.256-263
    • /
    • 2002
  • This paper addresses a planning problem in a pickup-delivery transportation' system under dynamic vehicle dispatching. We present a procedure to determine a fleet size in which stochastic characteristics of vehicle travels are considered. Statistical approach and queueing theory are applied to estimate vehicle travel time and vehicle waiting time, based on which an appropriate fleet size is determined. Simulation experiments are performed to verify the proposed procedure.

An Efficient Method of Workflow Management using a Dispatching Rule (우선순위규칙을 이용한 워크플로우의 효율적 운영 방안)

  • 이승현;유우식;배혜림;김영호;박용태
    • Korean Management Science Review
    • /
    • v.20 no.2
    • /
    • pp.17-31
    • /
    • 2003
  • A workflow management system is a software system to support accurate execution, control and management of business processes. It has been known that the system automatically executes complex processes and effectively manages them to improve the productivities. However though existing systems assure the automatic execution of an individual process, there is a room for enhancement from the view of efficient execution of all the processes. In this paper, we propose a method of executing business processes efficiently by introducing the PERT/CPM techniques in the workflow management systems. We first consider the differences between workflow process models and PERT/CPM models, and then develop a method of calculating the critical path and slack time in workflow processes. This leads us to develop a dispatching rule that can guide task performers to prioritize their tasks to increase the efficiency of ail the processes. We have carried out a set of simulation experiments and analyzed the results to demonstrate the effectiveness of the proposed method.

A Job Loading Procedure as a Kernel Part of FMS Integrated Operating System and Its Evaluation

  • Katayama, Hiroshi
    • Management Science and Financial Engineering
    • /
    • v.2 no.1
    • /
    • pp.1-18
    • /
    • 1996
  • FMS operating system consists of several subsystems in general. i.e. tool grouping subsystem. tool/job assignment subsystem. job dispatching subsystem, and papers dealing with each subsystem were published by many researchers [1], [4], [6], [8], [9], [10], [11], [12], [13], [14], [15], [16]. This paper mainly discusses about tool/job assignment subsystem as a job loading procedure. that occupies the kernel position of overall FMS operating system. Its performance is evaluated through simulation experiments of an integrated operating system under a typical FMS hardware configuration implemented in many machining factories, which is composed of the proposed procedure as well as a job dispatching procedure including several heuristic dispatching rules in terms of rule-base.

  • PDF

A Study of Vehicle Operation Policy in Warehouse (창고에서의 이송장비 운영정책에 관한 연구)

  • Lee, Hue-On;Chae, Jun-Jae;Lee, Moon-Su
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.1
    • /
    • pp.1-8
    • /
    • 2011
  • Controlling industrial vehicle operated by human in warehouse was not simple since the information transfer for controlling the vehicle was not easy. However, as the technology for the WMS (Warehouse Management System) has been advanced and the PDA (Personal Digital Assistant) has come into wide use in a workplace, the control of man-operated vehicle became less difficult as do to AGVS (Automated Guided Vehicle System). This study examines the ways to improve the efficiency of warehouse operation through introducing rule of task assignment for the vehicles, particularly forklift. This study, basically, refer to AGV operation policy because a great number of studies for AGV dispatching rule have been done and the mechanism for the controlling vehicles is very similar. The workers in field prefer to simple dispatching rules such as Shortest Retrieval Time First (SRTF), Shortest Travel Time First (STTF), and Longest Waiting Time First (LWTF). However, these rules have potential disadvantage. Thus, several rules made up by combining rules mentioned above are introduced and these new rules use threshold value or evaluation formula. The effectiveness of these new rules are tested by simulation and the results are compared. This study proposes favorable dispatching rules for forklift in warehouse for the efficiency of the vehicle operation and stability of service level.

Optimization of Wind Power Dispatch to Minimize Energy Storage System Capacity

  • Nguyen, Cong-Long;Lee, Hong-Hee
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.3
    • /
    • pp.1080-1088
    • /
    • 2014
  • By combining a wind turbine with an energy storage system (ESS), we are able to attenuate the intermittent wind power characteristic making the power derived from a wind farm dispatchable. This paper evaluates the influence of the phase delay of the low-pass filter in the conventional smoothing power control on the ESS capacity; longer phase delays require a larger ESS capacity. In order to eliminate the effect of the phase delay, we optimize the power dispatch using a zero-phase low-pass filter that results in a non-delayed response in the power dispatch. The proposed power dispatching method significantly minimizes the ESS capacity. In addition, the zero-phase low-pass filter, which is a symmetrical forward-reverse finite impulse response type, is designed simply with a small number of coefficients. Therefore, the proposed dispatching method is not only optimal, but can also be feasibly applied to real wind farms. The efficacy of the proposed dispatching method is verified by integrating a 3 MW wind turbine into the grid using wind data measured on Jeju Island.

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

  • Kim, Dong-Hee;Lee, Chang-Ho;Kim, Bong-Sun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.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 Multi-Stage Dispatching Rule for Efficient AGVS (Automated Guided Vehicle System) (효율적인 AGVS의 운용을 위한 다단계 차량 발주 방식에 관한 연구)

  • 박대희
    • Journal of the Korea Society for Simulation
    • /
    • v.6 no.1
    • /
    • pp.41-52
    • /
    • 1997
  • It is essential to construct an efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System (AGVS) plays a significant role more and more in modern manufacturing environments, because of the flexibility and the precision they offer. However, as the size and the complexity of systems increase, the problems of dispatching, routing and scheduling of AGVs become complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for dispatching AGV, named MEVTT (Minimum Empty Vehicle Travel Time) and demonstrate its performance and efficiency using simulation.

  • PDF

A Dynamic Dispatching Method to Improve Performance of Flow shop (Flow shop의 효율제고를 위한 동적 작업배정방안)

  • Rhee, Jong-Tae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.4
    • /
    • pp.37-50
    • /
    • 1994
  • The efficiency of production system is mainly considered in the viewpoints of reducing the average flow time of products and increasing the throughput rate. The performance in these viewpoints is very depending on job dispatching of each machine in real time operation, in the case jobs are released dynamically. In this research, a heuristic dynamic dispatching method is suggested for a flow shop case where new jobs with random process times are released by an interarrival time distribution and the number of waiting jobs between each pair of machines are limited. The proposed method has been compared with some priority rule-based dispatching methods by simulation and found to be superior to them.

  • PDF

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

  • Kim, Jong-Hwa;Cha, Sang-Soo
    • IE interfaces
    • /
    • v.15 no.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 (신경망을 이용한 무인운반차의 다요소배송규칙)

  • 정병호
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.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