• Journal of the Korean Society of Industry Convergence
• /
• v.12 no.1
• /
• pp.19-25
• /
• 2009

We suggest and evaluate a dynamic scheduling rule of machines and material handling systems for on-line operation in job shop type Flexible Manufacturing System. Alternating status should be able to take operation scheduling procedures and without delay in dynamic industrial environments effectively. The interaction(SPT-NS, SPT-QSNS, SPT-NUJ, EDD-NS, EDD-QSNS, EDD-NUJ, CR-NS, CR-QSNS, CR-NUJ) between machine operation scheduling and AGV dispatching rule were also studied in this research. The performance evaluation which was obtained from DSS compares the performance of Flow time, and Empty to loaded travel ratio. It is Compared with the best rules & two system.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.97-109
• /
• 2001

This research is concerned with jobshop scheduling problem for an advanced manufacturing system like flexible manufacturing which consists of two machine centers and a single automated guided vehicle(AGV). The objective is to develop and evaluate heuristic scheduling procedures that minimize makespan to be included travel time of AGV. A new heuristic algorithm is proposed and illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions in reduction ratio and frequency than the previous algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.287-297
• /
• 1997

This research is concerned with operation control problem for an automated manufacturing system which consists of two machine centers and a single automatic guided vehicle. The objective is to develop and evaluate heuristic scheduling procedures that minimize maximum completion time to be included travel time of AGV. A new heuristic algorithm is proposed and a numerical example illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions than the previous algorithms.

• IE interfaces
• /
• v.10 no.1
• /
• pp.57-65
• /
• 1997

Less researches on AGV(Automated Guided Vehicle) path configurations have been conducted so far while more studies have been placed in determining AGV guide path directions and pick-up/drop-off station locations, and routing/dispatching/scheduling strategies. In practice plenty of concerns fall in preventing deadlock and simplifying AGV system control through an appropriate AGV path configuration. In order to meet those requirements, a new AGV path configuration, inter-loop stocker type is introduced here. The stocker serves as relaying material between loops as well as stocking material. Automated material handling systems using AGVs play an important role in semiconductor industry including TFT LCD and memory/non-memory chip. A practical example of implementing the inter-loop stocker concept successfully in the TFT LCD fab is presented in this paper.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.3
• /
• pp.559-580
• /
• 1997

It is essential to construct on efficient material flow system for the successful introduction of automated manufacturing systems. Automated Guided Vehicle System(AGVS) ploys 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 became complicated due to their independent and asynchronous demands. In this paper, we review relevant papers, and provide a new and more efficient method for partitioning the AGV system by introducing the concept of Central Path. This method named Central Path design has advantages, since each partitioned workstation group is served by one AGV and the material handling between groups is performed by special AGV that is used for the Central Path. Therefore the congestion problems never occur. Furthermore Central Path Design has a high flexibility for alteration and extension of system. Finally, we demonstrate its efficiency using simulation.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2007.04a
• /
• pp.491-497
• /
• 2007

The planning and scheduling is considered as an important function because it influence to the overall performance of production in manufacturing system for supporting global objectives. In this paper, propose the hybrid approach to solve the problem which considered alternative resources and sequences, a sequence-dependent setups and transportation times. The objective of this problem is minimize the makespan with AGV traveling time. A iterative two heuristic algorithm(PSO, SA) is proposed to obtain the sequence of operations and CPLEX package is used to obtain the optimal sub-lot sizes(OLS) when the sequence of operations and greedy-based AGV dispatching rules are fixed or given. we show that performance of iterative two heuristic algorithms and simple numerical experiment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.9
• /
• pp.795-802
• /
• 2002

We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.68-74
• /
• 2003

Modem automated manufacturing processes employ automated guided vehicles(AGVs) for material handling, which serve several machining centers(MCs) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. In this paper, we will analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. With this model, the optimal number of MCs to be utilized will also be determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV will be carried out. Through rigorous analysis and simulation experiments, we shall show that such a delivery strategy will optimize the overall performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.82-87
• /
• 1993

A supervisory controller design technique for multiple-AGV systems is presented in this paper. The guidepath is represented in the form of a network, and its modifications are easily tested. The network has two-layered structure, where the path sets between each two nodes are made in advance using the K-shortest path algorithm. Occupation times for all links are stored in link-occupation table, and are updated after the dispatching time. Dispatching and scheduling for each AGV are optimized in terms of minimum-time objectives. In all times, the paths are guaranteed to be conflict-free and deadlock-free. The simplicity and flexibility on this control scheme make the supervisory suitable for real applications.