A performance evaluation of disassembly systems with reverse blocking

  • Authors:
  • Tetsuo Yamada;Naoyuki Mizuhara;Hisashi Yamamoto;Masayuki Matsui

  • Affiliations:
  • Musashi Institute of Technology, Faculty of Environmental and Information Studies, Department of Environmental and Information Studies, 3-3-1 Ushikubo-nishi, Tsuzuki-ku, Yokohama, Kanagawa 224-855 ...;The University of Electro-Communications, Department of Systems Engineering, 1-5-1 Chofugaoka, Chofu-Shi, Tokyo 182-8585, Japan;Tokyo Metropolitan University, Department of System Design, 6-6 Asahigaoka, Hino, Tokyo 191-0065, Japan;The University of Electro-Communications, Department of Systems Engineering, 1-5-1 Chofugaoka, Chofu-Shi, Tokyo 182-8585, Japan

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

For sustainable manufacturing, manufacturers should construct and design inverse manufacturing systems consisting of assembly and disassembly systems. The sorting process in the disassembly system is the first process of the whole inverse manufacturing system. Therefore, it can become a bottleneck and decrease the productivity of the whole inverse manufacturing systems. This study focuses on a disassembly system with reverse blocking in a sorting process [Yamada, T., & Matsui, M. (2003). Disassembly production systems and its design issues. Reprints of Japan Industrial Management Association, Spring meeting, Chofu, Japan, May, 144-145 (in Japanese)]. It generalizes the queuing model and discusses the performance of the disassembly system by mathematical and numerical analysis. First, the sorting process with reverse blocking is generally modeled as a queuing system. Next, the stationary state equations of the system are formulated, and the objective function is set as the throughput. Finally, the system performance is discussed by mathematical and numerical analysis in cases of a different number of stations and buffers, and also an example of the system design is shown and discussed in view of the busy rate, blocking probability and throughput.