Computation of order and volume fill rates for a base stock inventory control system with heterogeneous demand to investigate which customer class gets the best service

We consider a base stock inventory control system serving two customer classes whose demands are generated by two independent compound renewal processes. We show how to derive order and volume fill rates of each class. Based on assumptions about first order stochastic dominance we prove when one customer class will get the best service. That theoretical result is validated through a series of numerical experiments which also reveal that it is quite robust.Base stock policy; service measures; two customer classes; compound renewal processes

Production and inventory control in complex production systems using approximate dynamic programming.

Production systems focus not only on providing enough product to supply the market, but also on delivering the right product at the right price, while lowering the cost during the production process. The dynamics and uncertainties of modern production systems and the requirements of fast response often make its design and operation very complex. Thus, analytical models, such as those involving the use of dynamic programming, may fail to generate an optimal control policy for modern production systems. Modern production systems are often in possession of the features that allow them to produce various types of product through multiple working stations interacting with each other. The production process is usually divided into several stages, thus a number of intermediate components (WIP) are made to stock and wait to be handled by the next production stage. In particular, development of an efficient production and inventory control policy for such production systems is difficult, since the uncertain demand, system dynamics and large changeover times at the work stations cause significant problems. Also, due to the large state and action space, the controlling problems of modern production systems often suffer from the curse of dimensionality

An enhanced approximation mathematical model inventorying items in a multi-echelon system under a continuous review policy with probabilistic demand and lead-time

An inventory system attempts to balance between overstock and understock to reduce the total cost and achieve customer demand in a timely manner. The inventory system is like a hidden entity in a supply chain, where a large complete network synchronizes a series of interrelated processes for a manufacturer, in order to transform raw materials into final products and distribute them to customers. The optimality of inventory and allocation policies in a supply chain for a cement industry is still unknown for many types of multi-echelon inventory systems. In multi-echelon networks, complexity exists when the inventory issues appear in multiple tiers and whose performances are significantly affected by the demand and lead-time. Hence, the objective of this research is to develop an enhanced approximation mathematical model in a multi-echelon inventory system under a continuous review policy subject to probabilistic demand and lead-time. The probability distribution function of demand during lead-time is established by developing a new Simulation Model of Demand During Lead-Time (SMDDL) using simulation procedures. The model is able to forecast future demand and demand during lead-time. The obtained demand during lead-time is used to develop a Serial Multi-echelon Inventory (SMEI) model by deriving the inventory cost function to compute performance measures of the cement inventory system. Based on the performance measures, a modified distribution multi-echelon inventory (DMEI) model with the First Come First Serve (FCFS) rule (DMEI-FCFS) is derived to determine the best expected waiting time and expected number of retailers in the system based on a mean arrival rate and a mean service rate. This research established five new distribution functions for the demand during lead-time. The distribution functions improve the performance measures, which contribute in reducing the expected waiting time in the system. Overall, the approximation model provides accurate time span to overcome shortage of cement inventory, which in turn fulfil customer satisfaction

Developing a closed-form cost expression for an (R,s,nQ) policy where the demand process is compound generalized Erlang.

We derive a closed-form cost expression for an (R,s,nQ) inventory control policy where all replenishment orders have a constant lead-time, unfilled demand is backlogged and inter-arrival times of order requests are generalized Erlang distributedInventory control; Compound renewal process; Generalized Erlang distribution;

Simulation Optimization for the Stochastic Economic Lot Scheduling Problem with Sequence-Dependent Setup Times

We consider the stochastic economic lot scheduling problem (SELSP) with lost sales and random demand, where switching between products is subject to sequence-dependent setup times. We propose a solution based on simulation optimization using an iterative two-step procedure which combines global policy search with local search heuristics for the traveling salesman sequencing subproblem. To optimize the production cycle, we compare two criteria: minimizing total setup times and evenly distributing setups to obtain a more regular production cycle. Based on a numerical study, we find that a policy with a balanced production cycle leads to lower cost than other policies with unbalanced cycles. (authors' abstract