• 대한산업공학회지
• /
• 제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.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2011년도 춘계학술대회
• /
• pp.216-217
• /
• 2011

The problem of automated stacking cranes (ASC) dispatching in container terminals is addressed in this paper. We propose a heuristic-based ASC dispatching approach which adopts multi-criteria decision strategy. By aggregating different criteria the proposed strategy can consider multiple aspects of the dispatching situation and make robust decision in various situations. A multi-objective evolutionary algorithm (MOEA) is adopted to tune the weights associated to each criteria to minimize both the quay crane delay and external truck delay. The proposed approach is validated by comparison with different dispatching heuristics and simulation results obtained confirms its effectiveness.

• Industrial Engineering and Management Systems
• /
• 제14권1호
• /
• pp.32-43
• /
• 2015

This study suggests an electronic brokerage system that has the capability of efficiently matching dispatching delivery tasks with trucks. In the brokerage system, individual truck drivers and shippers are allowed to participate in the dispatching process through the internet or wireless communication. An auction-based dispatching method for the electronic brokerage system is suggested. The basic rationale of the auction-based dispatching method-which is a distributed decision-making process-is discussed. The performance of the suggested algorithms is evaluated by a simulation study.

• 한국시뮬레이션학회논문지
• /
• 제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.

• 경영과학
• /
• 제15권2호
• /
• pp.201-210
• /
• 1998

Truck dispatching is one of the most commonly occurring problems of transprot management. We developed an interactive decision support system named IDSSTD, for the truck dispatching problem where two conflicting objectives are treated and travel speed varies depending on the passing areas and time of day. The IDSSTD aids the decision-making process by allowing the user to interact directly with the database, to direct data to a decision model, and to portray results in a convenient form. The IDSSTD is consisted of two major interactive phases. The pre-scheduling interactive phase is to reduce the complexity of a given problem before applying the BC-saving heuristic algorithm and the post-scheduling interactive phase is to improve practically the algorithmic solution. The IDSSTD has the capabilities of its own manipulation(analysis and recommendation) and diverse graphic features in order to facilitate a user's interaction.

• 대한산업공학회지
• /
• 제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.

• 한국경영과학회지
• /
• 제30권3호
• /
• pp.67-80
• /
• 2005

This paper deals with a container terminal where containers are discharged by quay cranes from a ship and transported by a fleet of vehicles to the terminal yard. Since container terminals are fully utilized in general, It is important to increase terminal throughput by discharging the containers out of the ship without any delay, At the operational level, it should be decided which vehicle transports which container. The vehicle dispatching decision should be carefully made since the container discharging time increases when the quay cranes wait idle for the vehicles. This paper presents vehicle dispatching heuristics with the objective of minimizing the total container discharging time. The heuristics are based on a network flow model and a look-ahead concept. Through some experiments, the performance of the dispatching methods is evaluated.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2011년도 춘계학술대회
• /
• pp.218-219
• /
• 2011

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

• 한국항해항만학회지
• /
• 제35권6호
• /
• pp.501-507
• /
• 2011

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

• 대한산업공학회지
• /
• 제21권1호
• /
• pp.85-101
• /
• 1995

Automated Guided Vehicles(AGVs) are widely used in computer integrated manufacturing(CIM) systems for material handling purposes. Although automated guided vehicles provide higher levels of flexibility and computer integrability, the installations are limited in number and one of the critical reasons lies in the complexity involved in the operation. The main objective of this research is to alleviate this problem by proposing efficient integrated operational control methods for AGV-based CIM systems. Particularly, this research is concerned with the mixed problem of dispatching automated guided vehicles and scheduling machines operation. The proposed dynamic heuristic algorithm uses various priority schemes and relevant information concerning the load of the system, the status of queues, and the position of AGVs in the scheduling process. The scheduling decision process is hierarchical in the sense that different decision criteria are applied sequentially to identify the most appropriate part to be served. This algorithm consists of two sections, the section of part selection by AGVs for the next service whenever an AGV completes the current assignment, and the section of part selection by machines for next service whenever a machine completes the current operation. The proposed algorithm has been compared with other scheduling schemes using the performance measure of mean flow-time and mean tardiness. Simulation results indicate that the proposed algorithm can reduce the mean flow-time and mean tardiness significantly.