z-logo
Premium
DECOMPOSITION ALGORITHM FOR PERFORMANCE EVALUATION OF AGV SYSTEMS
Author(s) -
Nakano Masaru,
Ohno Katsushisa
Publication year - 1999
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/j.1937-5956.1999.tb00370.x
Subject(s) - computer science , queueing theory , automated guided vehicle , decomposition , algorithm , erlang (programming language) , mathematical optimization , real time computing , mathematics , theoretical computer science , functional programming , computer network , ecology , artificial intelligence , biology
This paper proposes a realistic queueing model of automated guided vehicle (agv) systems in just‐in‐time production systems. The model takes into consideration return paths, Erlang distributed service times, and pull‐type dispatching rule, assuming finite buffer capacities. Since it has no product‐form solution and natural decomposability due to complex nontree fork‐cum‐join architecture and dynamic dispatching rules, we propose a machine‐based decomposition algorithm for the performance evaluation of the model. Each decomposed module consists of the processing machine and its dispatching station. Three flow probabilities, derived from flow conservation analysis, relate the modules, which are updated iteratively until the parameters converge. The numerical results from a real‐life Agv system application show that the algorithm is reasonably accurate.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here