NERJIT: Using Net Requirement Data in Kanban‐Controlled Jumbled‐Flow Shops

The bold lines that have separated the application of specific production planning and control techniques to specific production systems are being blurred by continuous advances in production technologies and innovative operational procedures. Oral communication among dispatchers and production units has given way to electronic communication between production planners and these units by continuous progress in information technologies. Current production literature alludes to the idea that, collectively, these advances have paved the way for application of Just‐In‐Time (JIT) production concepts, which were originally developed for mass production systems, in intermittent production systems. But this literature does not actually consider the possibility. This article presents a modification to JIT procedures to make them more suitable for jumbled‐flow shops. This article suggests providing real‐time information about net‐requirements for each product to each work center operator for setting production priorities at each work center. Simulation experiments conducted for this study show that using Net‐Requirements in JIT (NERJIT) reduces customer wait time by 45–60% while reducing inventory slightly. The analysis of work centers’ input and output stock‐point inventories shows that using the information about net‐requirements results in production of items that are in current demand. NERJIT results in smaller input stock‐point inventory and availability of products with higher priority in the output stock‐points of work centers.     

An Analysis of Dual‐Kanban Just‐In‐Time Systems in a Non‐Repetitive Environment

Recent advances in approaches and production technologies for the production of goods and services have made just‐in‐time (JIT) a strong alternative for use in intermittent and small batch production systems, especially when time‐based competition is the norm and a low inventory is a must. However, the conventional JIT system is designed for mass production with a stable master production schedule. This paper suggests supplementing the information provided by production kanbans with information about customer waiting lines to be used by operators to schedule production in each work‐station of intermittent and small batch production systems. This paper uses simulation to analyze the effect of four scheduling policy variables—number of kanbans, length of the withdrawal cycle, information about customer waiting lines, and priority rules on two performance measures—customer wait‐time and inventory. The results show that using information about customer waiting lines reduces customer wait‐time by about 30% while also reducing inventory by about 2%. In addition, the effect of information about customer waiting lines overshadows the effect of priority rules on customer wait‐time and inventory.     

Economic Manufacturing Quantity and Its Integrating Implications

Several contradictions are noted among the Economic Order Quantity (EOQ), Just‐In‐Time (JIT), and Optimized Production Technology (OPT) approaches and the economic framework for profit maximization. A fundamental model referred to as the Economic Manufacturing Quantity (EMO) is developed and examined for its integrating implications for the three approaches. An implication for the classic EOQ approach is that the balance between setup and inventory carrying costs is valid when a production facility is operating at or below a certain critical level but not when operating above that level. An implication for the JIT approach is that one must reduce setup cost at non‐bottlenecks and setup time at bottlenecks to reduce inventory. An implication for the OPT approach is that trade‐offs between setup and inventory carrying costs may indeed be ignored while determining process batch sizes, provided each facility in a production system is operating at or above Its critical level. Economic theoretic analysis of the EMO model provides a basis for unification of JIT which advocates stability in operating level as a key to improved productivity and quality, and OPT that advocates maximizing operating level with resultant emphasis on bottlenecks as a key to increased profits. This unifying basis states that a profit‐maximizing production facility or system will operate at the full and stable level as long as market demand remains relatively sensitive to price and operating at the full (maximum) level provides positive unit contribution.     

A Production–Inventory Model for a Push–Pull Manufacturing System with Capacity and Service Level Constraints

We study a hybrid push–pull production system with a two‐stage manufacturing process, which builds and stocks tested components for just‐in‐time configuration of the final product when a specific customer order is received. The first production stage (fabrication) is a push process where parts are replenished, tested, and assembled into components according to product‐level build plans. The component inventory is kept in stock ready for the final assembly of the end products. The second production stage (fulfillment) is a pull‐based assemble‐to‐order process where the final assembly process is initiated when a customer order is received and no finished goods inventory is kept for end products. One important planning issue is to find the right trade‐off between capacity utilization and inventory cost reduction that strives to meet the quarter‐end peak demand. We present a nonlinear optimization model to minimize the total inventory cost subject to the service level constraints and the production capacity constraints. This results in a convex program with linear constraints. An efficient algorithm using decomposition is developed for solving the nonlinear optimization problem. Numerical results are presented to show the performance improvements achieved by the optimized solutions along with managerial insights provided.     

Equilibrium Joining Strategies and Optimal Control of a Make‐to‐Stock Queue

We consider a make‐to‐stock, finite‐capacity production system with setup cost and delay‐sensitive customers. To balance the setup and inventory related costs, the production manager adopts a two‐critical‐number control policy, where the production starts when the number of waiting customers reaches a certain level and shuts down when a certain quantity of inventory has accumulated. Once the production is set up, the unit production time follows an exponential distribution. Potential customers arrive according to a Poisson process. Customers are strategic, i.e., they make decisions on whether to stay for the product or to leave without purchase based on their utility values, which depend on the production manager's control decisions. We formulate the problem as a Stackelberg game between the production manager and the customers, where the former is the game leader. We first derive the equilibrium customer purchasing strategy and system performance. We then formulate the expected cost rate function for the production system and present a search algorithm for obtaining the optimal values of the two control variables. We further analyze the characteristics of the optimal solution numerically and compare them with the situation where the customers are non‐strategic.     

Single‐Period Two‐Product Assemble‐to‐Order Systems with a Common Component and Uncertain Demand Patterns

We consider a single‐period assemble‐to‐order system that produces two types of end products to satisfy two independent and stochastic customer orders. Each type of product is used to fulfill a particular customer order and these two products share a common component. Furthermore, one customer may confirm her order before the other one, and the manufacturer needs to make a commitment immediately upon the receipt of each customer order on how many products to be delivered. We propose a model for optimizing the inventory and production decisions under the above ATO environment. We also extend our model to the situation where the manufacturer can fulfill the unsatisfied low‐priority demand using the left‐over inventories after fulfilling the high‐priority demand, in case the low‐priority customer arrives first. Numerical experiments are conducted, which provide some interesting insights on the impact of uncertain demand pattern.     

MANAGING A FLOW LINE WITH SINGLE‐KANBAN,DUAL‐KANBAN OR CONWIP

To control the production of different parts on a single flow line, managers can choose between the Single‐kanban, Dual‐kanban, and Conwip. This paper therefore compares the three different systems. The results show that Conwip consistently produces the shortest mean customer wait time and lowest total work‐in‐process. Our results also contradict the finding of a previous study, which showed that Dual‐kanban performed better than Single‐kanban. The different findings can, however, be attributed to the use of a material transfer policy, which favors the Dual‐kanban modeled in the previous study. Our study shows that transferring replenished containers immediately to downstream stations, increasing the number of cards, and reducing the withdrawal cycle reduce the mean customer wait time significantly.     

Inventory Management for Customers with Alternative Lead Times

It is common for suppliers operating in batch‐production mode to deal with patient and impatient customers. This paper considers inventory models in which a supplier provides alternative lead times to its customers: a short or a long lead time. Orders from patient customers can be taken by the supplier and included in the next production cycle, while orders from impatient customers have to be satisfied from the on‐hand inventory. We denote the action to commit one unit of on‐hand inventory to patient or impatient customers as the inventory‐commitment decision, and the initial inventory stocking as the inventory‐replenishment decision. We first characterize the optimal inventory‐commitment policy as a threshold type, and then prove that the optimal inventory‐replenishment policy is a base‐stock type. Then, we extend our analysis to models to consider cases of a multi‐cycle setting, a supply‐capacity constraint, and the on‐line charged inventory‐holding cost. We also evaluate and compare the performances of the optimal inventory‐commitment policy and the inventory‐rationing policy. Finally, to further investigate the benefits and pitfalls of introducing an alternative lead‐time choice, we use the customer‐choice model to study the demand gains and losses, known as demand‐induction and demand‐cannibalization effects, respectively.     

Pool‐Point Distribution of Zero‐Inventory Products

We study zero‐inventory production‐distribution systems under pool‐point delivery. The zero‐inventory production and distribution paradigm is supported in a variety of industries in which a product cannot be inventoried because of its short shelf life. The advantages of pool‐point (or hub‐and‐spoke) distribution, explored extensively in the literature, include the efficient use of transportation resources and effective day‐to‐day management of operations. The setting of our analysis is as follows: A production facility (plant) with a finite production rate distributes its single product, which cannot be inventoried, to several pool points. Each pool point may require multiple truckloads to satisfy its customers' demand. A third‐party logistics provider then transports the product to individual customers surrounding each pool point. The production rate can be increased up to a certain limit by incurring additional cost. The delivery of the product is done by identical trucks, each having limited capacity and non‐negligible traveling time between the plant and the pool points. Our objective is to coordinate the production and transportation operations so that the total cost of production and distribution is minimized, while respecting the product lifetime and the delivery capacity constraints. This study attempts to develop intuition into zero‐inventory production‐distribution systems under pool‐point delivery by considering several variants of the above setting. These include multiple trucks, a modifiable production rate, and alternative objectives. Using a combination of theoretical analysis and computational experiments, we gain insights into optimizing the total cost of a production‐delivery plan by understanding the trade‐off between production and transportation.     

Impact of Information Technology Integration and Lean/Just‐In‐Time Practices on Lead‐Time Performance*

Managers seeking to improve lead‐time performance are challenged by how to balance resources and investments between process improvement achieved through lean/just‐in‐time (JIT) practices and information technology (IT) deployment. However, extant literature provides little guidance on this question. Motivated by both practical importance and lack of academic research, this article examines empirically the relationships among interfirm IT integration, intrafirm IT integration, lean/JIT practices, and lead‐time performance using data from IndustryWeek's Census of Manufacturers ( IndustryWeek, 2006 ). The results provide several new insights on the relationship between IT integration and lean/JIT practices. First, the study confirms that implementing lean/JIT practices significantly reduces lead time. Second, lean/JIT practices mediate the influence of IT integration on lead‐time performance. This suggests that process improvements that result from lean/JIT practices are important contributors to the success of IT integration. Even companies that have experienced success in reducing lead time through lean/JIT practices may benefit from IT integration practices such as those embodied in enterprise resource planning systems. The findings provide managers with empirical evidence and a theoretical framework on the balance between lean/JIT and IT for effecting improvement in lead‐time performance, thus offering practical guidance on this important question. Future research is needed to extend the lean/JIT practices in this study to supply chain practices and explore the relationship between supply chain practices and IT integration.     

Supply Performance in Multi‐Echelon Inventory Systems with Intermediate Product Demand: A Perspective on Allocation

In this article, we study the performance of multi‐echelon inventory systems with intermediate, external product demand in one or more upper echelons. This type of problem is of general interest in inventory theory and of particular importance in supply chain systems with both end‐product demand and spare parts (subassemblies) demand. The multi‐echelon inventory system considered here is a combination of assembly and serial stages with direct demand from more than one node. The aspect of multiple sources of demands leads to interesting inventory allocation problems. The demand and capacity at each node are considered stochastic in nature. A fixed supply and manufacturing lead time is used between the stages. We develop mathematical models for these multi‐echelon systems, which describe the inventory dynamics and allow simulation of the system. A simulation‐based inventory optimization approach is developed to search for the best base‐stock levels for these systems. The gradient estimation technique of perturbation analysis is used to derive sample‐path estimators. We consider four allocation schemes: lexicographic with priority to intermediate demand, lexiographic with priority to downstream demand, predetermined proportional allocation, and proportional allocation. Based on the numerical results we find that no single allocation policy is appropriate under all conditions. Depending on the combinations of variability and utilization we identify conditions under which use of certain allocation polices across the supply chain result in lower costs. Further, we determine how selection of an inappropriate allocation policy in the presence of scarce on‐hand inventory could result in downstream nodes facing acute shortages. Consequently we provide insight on why good allocation policies work well under differing sets of operating conditions.     

INVENTORY RATIONING AND SHIPMENT FLEXIBILITY ALTERNATIVES FOR DIRECT MARKET FIRMS

This paper investigates inventory‐rationing policies of interest to firms operating in a direct market channel. We model a single product with two demand classes, where one class requests a lower order fulfillment lead time but pays a higher price. Demand for each class follows a Poisson process. Inventory is fed by a production system with exponentially distributed build times. We study rationing policies in which the firm either blocks or backlogs orders for the lower priority customers when inventory drops below a certain level. We compare the performance of these rationing policies with a pure first‐come, first‐serve policy under various scenarios for customer response to delay: lost sales, backlog, and a combination of lost sales and backlog.     

Inventory Rationing in a Make‐to‐Stock System with Batch Production and Lost Sales

We address an inventory rationing problem in a lost sales make‐to‐stock (MTS) production system with batch ordering and multiple demand classes. Each production order contains a single batch of a fixed lot size and the processing time of each batch is random. Assuming that there is at most one order outstanding at any point in time, we first address the case with the general production time distribution. We show that the optimal order policy is characterized by a reorder point and the optimal rationing policy is characterized by time‐dependent rationing levels. We then approximate the production time distribution with a phase‐type distribution and show that the optimal policy can be characterized by a reorder point and state‐dependent rationing levels. Using the Erlang production time distribution, we generalize the model to a tandem MTS system in which there may be multiple outstanding orders. We introduce a state‐transformation approach to perform the structural analysis and show that both the reorder point and rationing levels are state dependent. We show the monotonicity of the optimal reorder point and rationing levels for the outstanding orders, and generate new theoretical and managerial insights from the research findings.     

The Impact of Revenue‐Maximizing Priority Pricing on Customer Delay Costs

Speed is an increasingly important determinant of which suppliers will be given customers' business and is defined as the time between when an order is placed by the customer and when the product is delivered, or as the amount of time customers must wait before they receive their desired service. In either case, the speed a customer experiences can be enhanced by giving priority to that particular customer. Such a prioritization scheme will necessarily reduce the speed experienced by lower‐priority customers, but this can lead to a better outcome when different customers place different values on speed. We model a single resource (e.g., a manufacturer) that processes jobs from customers who have heterogeneous waiting costs. We analyze the price that maximizes priority revenue for the resource owner (i.e., supplier, manufacturer) under different assumptions regarding customer behavior. We discover that a revenue‐maximizing supplier facing self‐interested customers (i.e., those that independently minimize their own expected costs) charges a price that also minimizes the expected total delay costs across all customers and that this outcome does not result when customers coordinate to submit priority orders at a level that seeks to minimize their aggregate costs of priority fees and delays. Thus, the customers are better off collectively (as is the supplier) when the supplier and customers act independently in their own best interests. Finally, as the number of priority classes increases, both the priority revenues and the overall customer delay costs improve, but at a decreasing rate.     

Heuristics for Base‐Stock Levels in Multi‐Echelon Distribution Networks

We study inventory optimization for locally controlled, continuous‐review distribution systems with stochastic customer demands. Each node follows a base‐stock policy and a first‐come, first‐served allocation policy. We develop two heuristics, the recursive optimization (RO) heuristic and the decomposition‐aggregation (DA) heuristic, to approximate the optimal base‐stock levels of all the locations in the system. The RO heuristic applies a bottom‐up approach that sequentially solves single‐variable, convex problems for each location. The DA heuristic decomposes the distribution system into multiple serial systems, solves for the base‐stock levels of these systems using the newsvendor heuristic of Shang and Song (2003), and then aggregates the serial systems back into the distribution system using a procedure we call “backorder matching.” A key advantage of the DA heuristic is that it does not require any evaluation of the cost function (a computationally costly operation that requires numerical convolution). We show that, for both RO and DA, changing some of the parameters, such as leadtime, unit backordering cost, and demand rate, of a location has an impact only on its own local base‐stock level and its upstream locations’ local base‐stock levels. An extensive numerical study shows that both heuristics perform well, with the RO heuristic providing more accurate results and the DA heuristic consuming less computation time. We show that both RO and DA are asymptotically optimal along multiple dimensions for two‐echelon distribution systems. Finally, we show that, with minor changes, both RO and DA are applicable to the balanced allocation policy.     

Customer‐Base Concentration and Inventory Efficiencies: Evidence from the Manufacturing Sector

What is the link between customer‐base concentration and inventory efficiencies in the manufacturing sector? Using hand‐collected data from 10‐K Filings, we find that manufacturers with more concentrated customer bases hold fewer inventories for less time and are less likely to end up with excess inventories, as indicated by the lower likelihood and magnitude of inventory write‐downs and reversals. Using disaggregated inventory disclosures, we find that inventory efficiencies primarily flow through the finished goods inventory account, while raw material efficiencies are offset by higher work‐in‐process holdings and longer work‐in‐process cycles. In additional analysis, we document a valuation premium for more concentrated manufacturers after controlling for other firm characteristics, including default risk and cost of capital estimates. We conclude that investors trade off the costs and benefits of relationships with a limited number of major customers and, on balance, consider customer‐base concentration as a net positive for firm valuation. Overall, our study adds to interdisciplinary research in accounting and operations management by shedding new light on the relevance of major customer disclosures for fundamental analysis and valuation in the manufacturing sector.     

How Inventory Cost Influences Introduction Timing of Product Line Extensions

In the industry with radical technology push or rapidly changing customer preference, it is firms' common wisdom to introduce high‐end product first, and follow by low‐end product‐line extensions. A key decision in this “down‐market stretch” strategy is the introduction time. High inventory cost is pervasive in such industries, but its impact has long been ignored during the presale planning stage. This study takes a first step toward filling this gap. We propose an integrated inventory (supply) and diffusion (demand) framework and analyze how inventory cost influences the introduction timing of product‐line extensions, considering substitution effect among successive generations. We show that under low inventory cost or frequent replenishment ordering policy, the optimal introduction time indeed follows the well‐known “now or never” rule. However, sequential introduction becomes optimal as the inventory holding gets more substantial or the product life cycle gets shorter. The optimal introduction timing can increase or decrease with the inventory cost depending on the marketplace setting, requiring a careful analysis.     

Two Backorder Compensation Mechanisms in Inventory Systems with Impatient Customers

We study a compensation mechanism design problem with customer‐choice behavior in a continuous review setting where the production and demand processes are stochastic. When a stockout occurs, the firm controls backorders on the basis of certain compensation policies. Customers make decisions to maximize their utility, which is decreasing in the price, the waiting time, and the customer's impatience factor. We assume that the impatience factor is private information held by the customer only. Two compensation mechanisms are designed to control backorders, namely uniform compensation and priority auction with an admission price. Under uniform compensation, the firm offers the same discount to all customers, whereas under auction compensation, priority is granted according to the customers' bid prices. We obtain the optimal stockout price and base stock level under each mechanism, and analyze the properties of the respective optimal policies. Assuming linear waiting costs with uniformly distributed impatience factor, we find that the auction mechanism (1) maintains a lower base stock level and results in greater profit and (2) benefits customers with relatively lower or higher impatience factors, but customers with a medium impatience factor may be rendered worse off. We further show that both compensation mechanisms are suitable for products with a high unit profit, a high lost sales penalty cost, and a high holding cost.     

A NUMERICAL ANALYSIS OF CAPACITATED POSTPONEMENT

Customer satisfaction can be achieved by providing rapid delivery of a wide variety of products. High levels of product variety require correspondingly high levels of inventory of each item to quickly respond to customer demand. Delayed product differentiation has been identified as a strategy to reduce final product inventories while providing the required customer service levels. However, it is done so at the cost of devoting large production capacities to the differentiation stage. We study the impact of this postponement capacity on the ability to achieve the benefits of delayed product differentiation. We examine a single‐period capacitated inventory model and consider a manufacturing system that produces a single item that is finished into multiple products. After assembly, some amount of the common generic item is completed as non‐postponed products, whereas some of the common item is kept as in‐process inventory, thereby postponing the commitment to a specific product. The non‐postponed finished‐goods inventory is used first to meet demand. Demand in excess of this inventory is met, if possible, through the completion of the common items. Our results indicate that a relatively small amount of postponement capacity is needed to achieve all of the benefits of completely delaying product differentiation for all customer demand. This important result will permit many firms to adopt this delaying strategy who previously thought it to be either technologically impossible or prohibitively expensive to do so.     

MANAGING CYCLIC INVENTORIES

Cyclic inventory is the buffer following a machine that cycles over a set of products, each of which is subsequently consumed in a continuous manner. Scheduling such a machine is interesting when the changeover times from one product to another are non‐trivial—which is generally the case. This problem has a substantial literature, but the common practices of “lot‐splitting” and “maximization of utilization” suggest that many practitioners still do not fully understand the principles of cyclic inventory. This paper is a tutorial that demonstrates those principles. We show that cyclic inventory is directly proportional to cycle length, which in turn is directly proportional to total changeover time, and inversely proportional to machine utilization. We demonstrate the virtue of “maximum changeover policies” in minimizing cyclic inventory—and the difficulty in making the transition to an increased level of demand. In so doing, we explicate the different roles of cyclic inventory, transitional inventory, and safety stock. We demonstrate the interdependence of the products in the cycle—the lot‐size for one product cannot be set independently of the remaining products. We also give necessary conditions for consideration of improper schedules (i.e., where a product can appear more than once in the cycle), and demonstrate that both lot‐splitting and maximization of utilization are devastatingly counter‐productive when changeover time is non‐trivial.