Optimization of buffer-size allocation using dynamic programming in assembly-like systems

Authors:
Masayoshi Hasama;Yu Song;Takao Ito;Seigo Matsuno
Affiliations:
Department of System Management, Fukuoka Institute of Technology, Wajirohigashi, Japan;Department of System Management, Fukuoka Institute of Technology, Wajirohigashi, Japan;Department of Business Administration, Ube National College of Technology, Ube, Tokiwadai, Japan;Department of Business Administration, Ube National College of Technology, Ube, Tokiwadai, Japan
Venue:
ICOSSSE'10 Proceedings of the 9th WSEAS international conference on System science and simulation in engineering
Year:
2010

Citing 5
Cited 0

Assembly-like queues with finite capacity: bounds, asymptotics and approximations

Queueing Systems: Theory and Applications
Finite capacity assembly like queues

Queueing Systems: Theory and Applications
Analysis of a Kanban discipline for cell coordination in production lines

Management Science
Properties of serial kanban systems

Queueing Systems: Theory and Applications
Performance analysis and buffer allocations in some open assembly systems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Assembly-like queueing systems are used in the assembly processes in production lines in the chemical industry as well as dataflow in computer systems. While many models are constructed in tandem and merge systems, assembly-like systems are known to be more complicated and difficult to analyze. These systems are not investigated in queueing theory. Whereas most research focuses on simple assembly-nodes, in this paper, we evaluate by dynamic programming using numerical analysis to propose buffer-size optimal allocation algorithm.