• 한국경영과학회지
• /
• 제20권2호
• /
• pp.11-22
• /
• 1995

kanban 시스템의 초기 Kanban 갯수 결정문제는 Kanban 시스템의 최적 운영 문네 준 하나이다. 생산 공정 구조가 일반 형태를 같는 Kanban 시스템에서는 초기 최적 Kanban 갯수 결정 문제는 수학적으로는 정수계획법으로 모델화 되기 때문에 발견적 해법으로는 가능해만 제시해 줄 수 있다. 실제 Kanban 시스템을 사용하는 현장에서는 대부분 경험적으로 초기 Kanban 갯수를 결정한다. 본 논문에서는 현장 경험을 이용하여 각 생산 단계 사이에 생산걍, 재고, 고갈이 Kanban 갯수에 따라 관계성을 찾을 수 있다면, 일반 생산 형태를 갖는 Kanban 시스템에 Kanban 갯수함수를 적용하여 초기 Kanban 갯수 결정하는 개법을 제시했다.

• 산업경영시스템학회지
• /
• 제32권1호
• /
• pp.1-10
• /
• 2009

Inventory Management has become a very important issue in supply chain management, because inventories may be used as a means to accomplish the certain strategic goals in company decisions. RFID(radio frequency identification) technology is used to help manage inventories. It is known that the ideal control of inventories is to replenish item by item. This paper points out several misinterpretations from the Wal-mart report presented in '07 Seoul Forum and suggests the new direction of RFID application. In this paper we consider RFID as not 'identification technology' but 'information technology.' The 'RF-Kanban' suggested here is adopted from the'Kanban'concept of TPS(Toyota Production System). The RF-Kanban system shows the easier control for replenishing various items in boxes. Lots of inventories can be reduced through RF-Kanban System. This work develops the protocol of RF-Kanban and introduces the case study for easier understanding.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.53-61
• /
• 1998

In this paper, we take into consideration the optimal cycle time in a kanban system. Even though there are many studios in the literature published in the past. It is rare to fine a paper dealing with kanban cycle time. We consider manufacturing structure configured in the real field and suggest kanban cycle time for the cases of linear, tree assembled, distributed, general and mixed structures. Also we give numerical example for each structure.

• 경영과학
• /
• 제11권1호
• /
• pp.107-115
• /
• 1994

Stochastic manufacturing systems are generally formulated as performance models of discrete event systems. In this paper, logical models(as opposed to performance models) of kanban systems are presented which are deterministic and untimed but not stochastic and timed. As a result, the first and second order properties of kanban systems are showed which can be fruitfully applied to the analysis and design of kanban systems.

• 한국경영과학회지
• /
• 제36권2호
• /
• pp.51-65
• /
• 2011

We compared a CONWIP(constant work-in-process) system with a kanban system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as CONWIP and kanban is equivalent to a m-node tandem queue with finite buffer, we applied a max-plus algebra based solution method for the tandem queue to evaluate the performance of two systems. Numerical examples with 6 workstations were used to demonstrate the proposed analysis. The numerical results support the previous studies that CONWIP outperforms kanban in terms of expected waiting time and WIP. Unlike the kanban case, sequencing workstations in a CONWIP does not affect the performance of the system.

• 대한안전경영과학회지
• /
• 제5권4호
• /
• pp.209-217
• /
• 2003

The traditional Kanban needs a lot of preconditions for fitting conditions of dynamic production processing environment. The traditional Kanban isn't suitable conditions of dynamic production processing environment. Therefore conditions of dynamic production processing environment is needed more stable system. This study is describe CONWIP system such as suitable in dynamic production processing environment. Most Pull system is a Kanban system than use Kanban cards or signal for production management and inventory control. The object of Kanban system is reducing inventory between shop-floor that can reduce inventiry cost. If the system reduce the number of Kanban cards would be reduce the working process WIP, can be reduced and can be found all potential problem of production between shop-floors. This study apply to CONWIP system model for Korean industrial companies.

• Industrial Engineering and Management Systems
• /
• 제4권2호
• /
• pp.184-191
• /
• 2005

In this article we study the feasibility of the Ant Colony Optimisation (ACO) algorithm for finding optimal Kanban allocations in Kanban systems represented by Stochastic Petri Net (SPN) models. Like other optimisation algorithms inspired by nature, such as Simulated Annealing/Genetic Algorithms, the ACO algorithm contains a large number of adjustable parameters. Thus we study the influence of the parameters on performance of ACO on the Kanban allocation problem, and identify the most important parameters.

• Management Science and Financial Engineering
• /
• 제8권2호
• /
• pp.1-20
• /
• 2002

This paper presents a model that analyzes the impact of uncertainties in demand and processing times on the production lead time of a Kanban system. We consider the waste associated with under-production as well as over-production when we measure the production lead time. We set up an optimization model to minimize the production lead time. A simple heuristic procedure is developed to determine solutions in terms of the size of containers and the number of Kanban cards. In addition, we numerically examine the behavior of the optimal Kanban system.

• 대한산업공학회지
• /
• 제16권1호
• /
• pp.115-122
• /
• 1990

Kanban, a pull system for inventory control is in direct contrast to conventional push systems. In the pull system, the kind and quantity of items needed by the succeeding stage are withdrawn from the preceding stage, only at the rate and at the time they are consumed. In this paper, lot size models are formulated in two special cases of practical interests and simple solution procedures are adapted to minimize the total cost of the kanban system. An numerical example is solved to illustrate the method.

• 경영과학
• /
• 제9권1호
• /
• pp.3-15
• /
• 1992

In this paper, we study a manufacturing system of serial stages with general service times, in which the production of each stage and the coordination of stages are controlled by Kanban discipline. This Kanban discipline is modeled as a Discrete Event Dynamic System and a system of recursive equations is applied to study the dynamics of the system. The recursive relationship enables us to compare this Kanban discipline with the other blocking disciplines such as transfer blocking, service blocking, block-and-hold b, and block-and-hold K, and the Kanban is shown to be superior to the other disciplines in terms of makespan and throughput. As a special case, two stages Kanban system is modeled as $C_2/C_2/1/N$ queueing system, and a recursive algorithm is developed to calculate the system performance. In optimizing the system performance, the stochastic optimization approach of Robbins-Monro is employed via perturbation analysis, the way to estimate the stochastic partial derivative based on only one sample trajectory of the system, and the required commuting condition is verified. Then the stochastic convexity result is established to provide second-order optimality condition for this parametric optimization problem.