An assembly-type supply chain system controlled by kanbans under a just-in-time delivery policy

被引:35
作者
Wang, SJ
Sarker, BR [1 ]
机构
[1] Louisiana State Univ, Dept Ind & Mfg Syst Engn, Baton Rouge, LA 70803 USA
[2] SE Missouri State Univ, Dept Ind & Engn Technol, Cape Girardeau, MO 63701 USA
关键词
kanban; supply chain; inventory control; mixed integer nonlinear programming;
D O I
10.1016/j.ejor.2003.10.038
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This research studies the assembly-type supply chain system controlled by kanban mechanism. First, a supply chain system is modeled as a mixed-integer nonlinear programming (MINLP) problem. A composite formulation of the assembly-type supply chain system is developed by appropriately aggregating the individual branch models as a whole system. The batch size, the number of batches, and the total quantity over one period in the mainline and each branch line are determined. The small size MINLP problems are solved optimally by a branch-and-bound method. For the large size MINLP problems, a heuristic is developed which divides the ATSCS into several small size problems, and then conquers them individually. Next, the kanban operation between two adjacent plants is developed to schedule the loading and unloading, and transportation. Coupled with plant-wide efforts for cost control and management commitment, a logistics system is built for controlling the production as well as the supply chain system, which results in minimizing the total cost of the supply chain system. Numerical examples are presented to illustrate the two heuristic procedures and a better solution is obtained for the ATSCS problem. (C) 2003 Elsevier B. V. All rights reserved.
引用
收藏
页码:153 / 172
页数:20
相关论文
共 20 条
[1]   An overview of design and operational issues of kanban systems [J].
Akturk, MS ;
Erhun, F .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1999, 37 (17) :3859-3881
[2]   MULTISTAGE, PULL-TYPE PRODUCTION INVENTORY SYSTEMS [J].
ALTIOK, T ;
RANJAN, R .
IIE TRANSACTIONS, 1995, 27 (02) :190-200
[3]  
[Anonymous], OPERATIONS RES
[4]   Ranking of generalised multi-stage KANBAN policies [J].
Axsäter, S ;
Rosling, K .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 113 (03) :560-567
[5]   AN OUTER-APPROXIMATION ALGORITHM FOR A CLASS OF MIXED-INTEGER NONLINEAR PROGRAMS [J].
DURAN, MA ;
GROSSMANN, IE .
MATHEMATICAL PROGRAMMING, 1986, 36 (03) :307-339
[6]   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
[7]   Determination of the number of containers, production kanbans and withdrawal kanbans; and scheduling in kanban flowshops - Part 2 [J].
Hemamalini, B ;
Rajendran, C .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2000, 38 (11) :2549-2572
[8]   The Kanban assignment problem - A non-integral approach [J].
Herer, YT ;
Shalom, L .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) :260-276
[9]   Project surface regions: a decision support methodology for multitasking workers assignment in JIT systems [J].
Horng, HC ;
Cochran, JK .
COMPUTERS & INDUSTRIAL ENGINEERING, 2001, 39 (1-2) :159-171
[10]   BATCHING POLICY IN KANBAN SYSTEMS [J].
KARMARKAR, US ;
KEKRE, S .
JOURNAL OF MANUFACTURING SYSTEMS, 1989, 8 (04) :317-328