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

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.     

A single-stage supply chain system controlled by kanban under just-in-time philosophy

The production system using kanban was pioneered by Toyota Motor Company in Japan and subsequently it was adopted by numerous other Japanese and US companies for applying the just-in-time manufacturing principles. This research studies a single-stage supply chain system that is controlled by kanban mechanism. The supply chain system is modelled as a mixed-integer nonlinear programming (MINLP) problem. It is solved optimally by branch-and-bound method to determine the number of kanbans, batch size, number of batches, and the total quantity over one period. Meanwhile, the kanban operation between two adjacent plants is worked out considering the factors of loading and unloading time, and transport time. Coupled with plant-wide efforts for cost control and management commitment to enhance other measures of performance, a logistics system for controlling the production as well as the supply chain system is developed, which results in minimizing the total cost of the supply chain system. The results show that the improvements in reduction of inventory, wasted labour, and customer service in a supply chain are accomplished through the kanban mechanism.     

Operations planning for a multi-stage kanban system

A multi-stage production line which operates under a just-in-time production philosophy with linear demand is considered here. The first workstation processes the raw materials after receiving them from suppliers, a kanban mechanism between the workstations transports the work-in-process to the succeeding workstation, and after processing them, delivers the finished products to a buyer or a warehouse. The problem is to find optimally the number of raw material orders, kanbans circulated between workstations, finished goods shipments to the buyers, and the batch size for each shipment (lot). A cost function is developed based on the costs incurred due to the raw materials, the work-in-process between workstations, and the finished goods. Optimal number of raw material orders that minimizes the total cost is obtained, which is then used to find the optimal number of kanbans, finished goods shipments, and the batch sizes for shipments. Numerical examples are used to demonstrate the computations of optimal parameters, and to configure the kanban mechanism on a timescale. Several avenues for future research are also indicated.     

Single Supplier�CBuyer Integrated Inventory Model Under Multiple JIT Delivery and Stock-Dependent Demand

In this paper, an integrated inventory model for a supply chain comprising of single buyer and single supplier is studied when demand is stock-dependent and units in inventory deteriorate at a constant rate. The total cost of the integrated system consists of the transportation cost, inspection cost and the cost of less flexibility under the assumption of JIT deliveries. The total integrated cost of single-supplier and single-buyer is minimized with respect to number of inspections and deliveries, the cycle time of deliveries and the delivery size for the replenishment time. A numerical example is given to validate the model. The sensitivity analysis carried out suggests that the unit inspection cost, deterioration rate of units in inventory and stock-dependent parameter are the critical factors.     

The optimal control of just-in-time-based production and distribution systems and performance comparisons with optimized pull systems

In just-in-time (JIT) production systems, there is both input stock in the form of parts and output stock in the form of product at each stage. These activities are controlled by production-ordering and withdrawal kanbans. This paper discusses a discrete-time optimal control problem in a multistage JIT-based production and distribution system with stochastic demand and capacity, developed to minimize the expected total cost per unit of time. The problem can be formulated as an undiscounted Markov decision process (UMDP); however, the curse of dimensionality makes it very difficult to find an exact solution. The author proposes a new neuro-dynamic programming (NDP) algorithm, the simulation-based modified policy iteration method (SBMPIM), to solve the optimal control problem. The existing NDP algorithms and SBMPIM are numerically compared with a traditional UMDP algorithm for a single-stage JIT production system. It is shown that all NDP algorithms except the SBMPIM fail to converge to an optimal control.Additionally, a new algorithm for finding the optimal parameters of pull systems is proposed. Numerical comparisons between near-optimal controls computed using the SBMPIM and optimized pull systems are conducted for three-stage JIT-based production and distribution systems. UMDPs with 42 million states are solved using the SBMPIM. The pull systems discussed are the kanban, base stock, CONWIP, hybrid and extended kanban.     

Scheduling just-in-time part supply for mixed-model assembly lines

With increasing cost competition and product variety, providing an efficient just-in-time (JIT) supply has become one of the greatest challenges in the use of mixed-model assembly line production systems. In the present paper, therefore, we propose a new approach for scheduling JIT part supply from a central storage center. Usually, materials are stored in boxes that are allotted to the consumptive stations of the line by a forklift. For such a real-world problem, a new model, a complexity proof as well as different exact and heuristic solution procedures are provided. Furthermore, a direct comparison with a simple two-bin kanban system is provided. Such a system is currently applied in the real-world industrial process that motivates our research. It becomes obvious that this policy is considerably outperformed according to the resulting inventory- and α-service levels. Moreover, at the interface between logistics and assembly operations, strategic management implications are obtained. Specifically, based on the new approach, it is the first time a statistical analysis is being made as to whether widespread Level Scheduling policies, which are well-known from the Toyota Production System, indeed facilitate material supply. Note that in the literature it is frequently claimed that this causality exists.     

An analytical method for cost analysis in multi-stage supply chains: A stochastic network model approach

This paper studies the cost distribution characteristics in multi-stage supply chain networks. Based on the graphical evaluation and review technique, we propose a novel stochastic network mathematical model for cost distribution analysis in multi-stage supply chain networks. Further, to investigate the effects of cost components, including the procurement costs, inventory costs, shortage costs, production costs and transportation costs of supply chain members, on the total supply chain operation cost, we propose the concept of cost sensitivity and provide corresponding algorithms based on the proposed stochastic network model. Then the model is extended to analyze the cost performance of supply chain robustness under different order compensation ability scenarios and the corresponding algorithms are developed. Simulation experiment shows the effectiveness and flexibility of the proposed model, and also promotes a better understanding of the model approach and its managerial implications in cost management of supply chains.     

An inventory model with partial backordering and unit backorder cost linearly increasing with the waiting time

As the implementation of JIT practice becomes increasingly popular, each echelon in a supply chain tends to carry fewer inventories, and thus the whole supply chain is made more vulnerable to lost sales and/or backorders. The purpose of this paper is to recast the inventory model to be more relevant to current situations, where the penalty cost for a shortage occurrence at a downstream stage in a supply chain is continually transmitted to the upstream stages. The supplier, in this case, at the upstream of the supply chain is responsible for all the downstream shortages due to the chain reaction of its backlog. The current paper proposes a model in which the backorder cost per unit time is a linearly increasing function of shortage time, and it claims that the optimal policy for the supplier is setting the optimal shortage time per inventory cycle to minimize its total relevant cost in a JIT environment.     

The performance evaluation of a multi-stage JIT production system with stochastic demand and production capacities

This paper discusses a single-item, multi-stage, serial Just-in-Time (JIT) production system with stochastic demand and production capacities. The JIT production system is modeled as a discrete-time, M/G/1-type Markov chain. A necessary and sufficient condition, or a stability condition, under which the system has a steady-state distribution is derived. A performance evaluation algorithm is then developed using the matrix analytic methods. In numerical examples, the optimal numbers of kanbans are determined by the proposed algorithm. The optimal numbers of kanbans are robust for the variations in production capacity distribution and demand distribution.     

Multi-vendor integrated procurement-production system under shared transportation and just-in-time delivery system

Just-in-time (JIT) procurement is one of the important elements of lean production system. Successful implementation of JIT needs vendor-manufacturer cooperation on small lot size delivery and inbound logistics cost reduction. Unlike the most recent literature focusing on single-vendor and single-buyer integrated inventory systems, this paper studies a multi-vendor integrated procurement-production inventory system that incorporates delivery and shared transportation costs. A multi-vendor optimal model is developed here for deciding the batch size of vendor's production, and delivery frequencies of different vendors to the manufacturer. Solution procedures for two special cases—uncapacitated and capacitated models are developed; especially, a new approximate method for capacitated model is devised. Numerical examples demonstrate the solution mechanism for the model. The results highlight cooperation between vendors and manufacturers on JIT procurement practices.     

基于时变需求的集成多级供应链生产订货策略研究

考虑一个时变需求环境下集成多级供应链问题,在有限的规划时间内销售商以固定周期订货,而生产商以不同的周期生产,目的是寻找销售商最优的订货周期和生产商最佳的生产策略,从而使供应链系统的总运营成本最少.建立了该问题的混合整数非线性规划模型,求解该模型分为两步：先求对应一个订货周期的最佳生产策略,再求最优的订货周期,第一步用到了图论里求最短路方法.给出了两个步骤的算法和程序,实验证明它们是有效的.通过算例对模型进行了分析,研究了各参数对最优解及最小费用的影响.     

Evaluation of cycle-count policies for supply chains with inventory inaccuracy and implications on RFID investments

Inventory record inaccuracy leads to ineffective replenishment decisions and deteriorates supply chain performance. Conducting cycle counts (i.e., periodic inventory auditing) is a common approach to correcting inventory records. It is not clear, however, how inaccuracy at different locations affects supply chain performance and how an effective cycle-count program for a multi-stage supply chain should be designed. This paper aims to answer these questions by considering a serial supply chain that has inventory record inaccuracy and operates under local base-stock policies. A random error, representing a stock loss, such as shrinkage or spoilage, reduces the physical inventory at each location in each period. The errors are cumulative and are not observed until a location performs a cycle count. We provide a simple recursion to evaluate the system cost and propose a heuristic to obtain effective base-stock levels. For a two-stage system with identical error distributions and counting costs, we prove that it is more effective to conduct more frequent cycle counts at the downstream stage. In a numerical study for more general systems, we find that location (proximity to the customer), error rates, and counting costs are primary factors that determine which stages should get a higher priority when allocating cycle counts. However, it is in general not effective to allocate all cycle counts to the priority stages only. One should balance cycle counts between priority stages and non-priority stages by considering secondary factors such as lead times, holding costs, and the supply chain length. In particular, more cycle counts should be allocated to a stage when the ratio of its lead time to the total system lead time is small and the ratio of its holding cost to the total system holding cost is large. In addition, more cycle counts should be allocated to downstream stages when the number of stages in the supply chain is large. The analysis and insights generated from our study can be used to design guidelines or scorecard systems that help managers design better cycle-count policies. Finally, we discuss implications of our study on RFID investments in a supply chain.     

An analysis of production-inventory models with deteriorating items in a two-echelon supply chain

This paper revisits two previous studies that addressed the integrated production–inventory problem for deteriorating items in a two-echelon supply chain, where the item’s deterioration rate is a constant or follows a continuous probability distribution function. The aim of this study is to present an improved solution procedure to determine the delivery lot size and the number of deliveries per production batch cycle that minimizes the total cost of the entire supply chain. The performance of the proposed methodology is illustrated analytically and numerically.     

自由作业的供应链排序研究

研究一类集成工件加工和发送的供应链排序模型,即研究如何安排工件在自由作业机器上加工,把加工完毕的工件分批发送给下游客户,使得含生产排序费用和发送费用的目标函数最优.这里,分别取工件最大送到时间和平均送到时间为生产排序费用;而发送费用是由固定费用和与运输路径有关的变化费用组成.利用排序理论和动态规划方法,构造了自由作业供应链排序问题的多项式时间近似算法,并分析算法的性能比.     

Equipment Selection Problems in Just-in-Time Manufacturing Systems

This paper is concerned with the development of a mathematical model for solving the problem of equipment selection in just-in-time (JIT) manufacturing systems. Equipment selection issues are important, particularly during the initial stages of implementing JIT. In this paper a mathematical model is proposed for capacity planning and for selecting equipment in a multi-stage JIT production system. An example situation is considered to explain the application and behaviour of the model.     

A just-in-time three-level integrated manufacturing system for linearly time-varying demand process

This paper considers a just-in-time (JIT) manufacturing system in which a single manufacturer procures raw materials from a single supplier, process them to produce finished products, and then deliver the products to a single-buyer. The customer demand rate is assumed to be linearly decreasing time-varying. In the JIT system, in order to minimize the suppliers as well as the buyers holding costs, the supply of raw materials and the delivery of finished products are made in small quantities. In this case, both the supply and the delivery may require multiple installments for a single production lot. We develop a mathematical model for this problem, propose a simple methodology for solving the model, and illustrate the effectiveness of the method with numerical examples.     

JIT环境下工厂线边库存容量投资协调策略研究

在JIT环境下,制造商要求长期合作的供应商在其工厂周边租用仓库,而自己只维持较少的线边库存。本文以此为背景,假定制造商投资建设工厂线边库存的费用与其容量大小成正比,分别建立了供应链分散决策和集中决策模型,并提出了制造商工厂线边库存投资建设协调模型。研究结果表明,相比分散决策,供应链集中决策时制造商投资建设的最优工厂线边库存容量更大,从而有利于供应商和整个供应链,而不利于制造商。算例分析证明提出的基于不对称博弈的线边库存投资费用分担策略能够实现整个供应链利益的帕累托优化。     

A coordination system for seasonal demand problems in the supply chain

This article considers a single product coordination system using a periodic review policy, participants of the system including a supplier and one or more heterogeneous buyers over a discrete time planning horizon in a manufacturing supply chain. In the coordination system, the demand of buyer in each period is deterministic, the supplier replenishes all the buyers, and all participants agree to plan replenishment to minimize total system costs. To achieve the objective of the coordination system, we make use of small lot sizing and frequent delivery policies (JIT philosophy) to transport inventory between supplier and buyers. Moreover, demand variations of buyers are allowed in the coordination system to suit real-world situations, especially for hi-tech industries. Furthermore, according to the mechanisms of minimizing the total relevant costs, the proposed method can obtain the optimal number of deliveries, shipping points and shipping quantities in each order for all participants in the coordination system.     

Research on a scheduling mechanism in a complex system based on TOC

Under the condition where there is no seasonal demand fluctuation, short life cycle product supply chain should confront the market environment such as the decreasing of product value, the launch of substitutes and the appearance of competitors’ similar products, and the supply chain will become a very complex system. In this paper, the authors consider a TOC-based scheduling mechanism in this complex supply chain system. under the constant total production cost, it is more important to improve the availability of the wanted product in order to enhance the overall supply chain competitiveness so to obtain more effective output(profit rate) for the supply chain in a long period. Especially we try to apply the SDBR concept into a schedule mechanism in a particular supply chain system, and use numerical analysis to test the efficiency of the proposed method.     

Global optimal policy for vendor–buyer integrated inventory system within just in time environment

Traditionally, inventory problems for the vendor and the buyer are treated separately. In modern enterprises, however, the integration of vendor–buyer inventory system is an important issue. This co-operative approach to inventory management contributes to the success of supply chain management by minimizing the joint inventory cost. The joint inventory cost and the response time can further be reduced when the buyer orders and the vendor replenishes the required items just in time (JIT) for their consumption. The inclusion of the JIT concept in this model contributes significantly to a joint inventory cost reduction. A numerical example and sensitivity analysis are carried out. The derived results show an impressive cost reduction when compared with Goyal’s model.