An integrated MOGA approach to determine the Pareto-optimal kanban number and size for a JIT system

被引:28
作者
Hou, Tung-Hsu [1 ]
Hu, Wei-Chung [1 ]
机构
[1] Natl Yunlin Univ Sci & Technol, Dept Ind Engn & Management, Yunlin 640, Taiwan
关键词
JIT; Lean production; Kanban; MOGA; OPTIMIZATION; SIMULATION; ALGORITHM;
D O I
10.1016/j.eswa.2010.11.032
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In a just-in-time (JIT) system, kanban number and size represent the inventory level of work-in-process (WIP) or purchasing parts. It is an important issue to determine the feasible kanban number and size. In this research, an integrated multiple-objective genetic algorithm (MOGA) based system is developed to determine the Pareto-optimal kanban number and size, and is applied in a JIT-oriented manufacturing company to demonstrate its feasibility. In the integrated system, a simulation model is built to simulate the multi-stage JIT production system of the company. Then an experimental design of different kanban numbers and sizes for different production stages is applied to test the production performances. Based on the simulation results, regression models are built to represent the relationships between the kanban numbers of different production stages and the production performance. These regression models are then used in genetic algorithms to generate the performance for chromosomes. Finally, the proposed multi-objective genetic algorithm (MOGA) based system uses the generalized Parato-based scale independent fitness function (GPSIFF) as the fitness function to evaluate the multiple objectives for chromosomes and used to find the Pareto-optimal kanban number and size for multiple objectives, i.e., maximizing mean throughput rate and minimizing mean total WIP inventory. A comparison in the performance of the proposed system with that of the current kanban number is conducted to demonstrate the feasibility of the proposed system. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:5912 / 5918
页数:7
相关论文
共 15 条
[1]   Effect of kanban size on just-in-time manufacturing systems [J].
Chan, FTS .
JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2001, 116 (2-3) :146-160
[2]   Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems [J].
Deb, Kalyanmoy .
EVOLUTIONARY COMPUTATION, 1999, 7 (03) :205-230
[3]  
DURI C, 1995, EMERGING TECHNOLOGIE, V3, P557
[4]  
GUNERI AF, 2008, INT J PRODUCTION SEP, P15
[5]   An algorithm to dynamically adjust the number of Kanbans in stochastic processing times and variable demand environment [J].
Gupta, SM ;
AlTurki, YAY .
PRODUCTION PLANNING & CONTROL, 1997, 8 (02) :133-141
[6]   Intelligent evolutionary algorithms for large parameter optimization problems [J].
Ho, SY ;
Shu, LS ;
Chen, JH .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (06) :522-541
[7]   Kanban optimization by simulation and evolution [J].
Köchel, P ;
Nieländer, U .
PRODUCTION PLANNING & CONTROL, 2002, 13 (08) :725-734
[8]   Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling [J].
Lee, I. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2007, 45 (13) :2859-2873
[10]  
MONDEN Y., 1993, Toyota production system: An integrated approach to just-in-time, P279