Optimal and self-tuning optimal control of a periodic-review hybrid production inventory system

In this paper, a periodic-review dynamic production inventory system for a single reusable product is investigated. There are two stocks, one for the serviceable items and one for the remanufactured ones. We assume that the items in either stock may be subject to deterioration. Items deterioration is of great importance to inventory theory. An optimal control is derived in the case where the deterioration parameters are known and a self-tuning optimal control strategy is applied in the case where the deterioration parameters are unknown. In particular, the recursive least-squares (RLS) method is used to identify the deterioration parameters. Simulations are conducted to illustrate the results obtained.     

Inventory decisions for a finite horizon problem with product substitution options and time varying demand

The inventory control of substitutable products has been recognized as a problem worthy of study in the operations management literature. Product substitution provides flexibility in supply chain management and enhances response time in production control. This paper proposes a finite horizon inventory control problem for two substitutable products, which are ordered jointly in each replenishment epoch. Demand for the products are assumed to be time–varying. In case of a stock–out for one of the products, its demand is satisfied by using the stock of the other product. The optimal ordering schedule, for both products, that minimizes the total cost over a finite planning horizon is derived. Numerical examples along with sensitivity analyses are also presented.     

Optimal EOQ Models for Deteriorating Items with Time-Varying Demand

In this paper, optimal inventory lot-sizing models are developed for deteriorating items with general continuous time-varying demand over a finite planning horizon and under three replenishment policies. The deterioration rate is assumed to be a constant fraction of the on-hand inventory. Shortages are permitted and are completely backordered. The proposed solution procedures are shown to generate global minimum replenishment schedules for both general increasing and decreasing demand patterns. An extensive empirical comparison using randomly generated linear and exponential demands revealed that the replenishment policy which starts with shortages in every cycle is the least cost policy and the replenishment policy which prohibits shortages in the last cycle exhibited the best service level effectiveness. An optimal procedure for the same problem with trended inventory subject to a single constraint on the minimum service level (maximum fraction of time the inventory system is out of stock during the planning horizon) is also proposed in this paper.     

The production–inventory problem of a product with time varying demand,production and deterioration rates

In this paper, we consider the production–inventory problem in which the demand, production and deterioration rates of a product are assumed to vary with time. Shortages of a cycle are allowed to be backlogged partially. Two models are developed for the problem by employing different modeling approaches over an infinite planning horizon. Solution procedures are derived for determining the optimal replenishment policies. A procedure to find the near-optimal operating policy of the problem over a finite time horizon is also suggested.     

A demand-driven method for scheduling optimal smooth production levels

This paper is concerned with demand-driven production scheduling in a commercial environment where smoothed production plans generation over a rolling horizon is desirable as new observations of demand are received through time. Demands are assumed to be normally distributed and dependent on the previous observed levels. The method of chance constraint of Charnes and Cooper is extended to multi-product production planning with variable workforce, back-ordered inventory, and nonstationary stochastic demand process. Bayesian procedures for revising the chance constraints and several variants of linear-programming-based production planning models are presented. In all cases the proposed methodology ensures that demands are satisfied, at a given level of confidence, while achieving smooth production.     

A Finite Horizon Production Model with Variable Production Rates and Constant Demand Rate

In this paper we present a finite horizon single product single machine production problem. Demand rate and all the cost patterns do not change over time. However, end of horizon effects may require production rate adjustments at the beginning of each cycle. It is found that no such adjustments are required. The machine should be operated either at minimum speed (i.e. production rate = demand rate; shortage is not allowed), avoiding the buildup of any inventory, or at maximum speed, building up maximum inventories that are controlled by the optimal production lot size.     

上升线性需求条件下考虑资金时间价值的变质性物品生产库存模型

变质性物品生产库存系统的研究具有重要实际意义.本文研究了变质性物品生产库存系统在上升趋势线性需求条件下,考虑资金的时间价值,在有限计划时间水平内,如何确定最优生产周期,各周期最优生产率,以及最优库存安排策略.通过本文的研究,得到了一些有用的结论.     

Multi-item single source ordering problem with transportation cost: A Lagrangian decomposition approach

As a part of supply chain management literature and practice, it has been recognized that there can be significant gains in integrating inventory and transportation decisions. The problem we tackle here is a common one both in retail and production sectors where several items have to be ordered from a single supplier. We assume that there is a finite planning horizon to make the ordering decisions for the items, and in this finite horizon the retailer or the producer knows the demand of each item in each period. In addition to the inventory holding cost, an item-base fixed cost associated with each item included in the order, and a piecewise linear transportation cost are incurred. We suggest a Lagrangean decomposition based solution procedure for the problem and carry out numerical experiments to analyze the value of integrating inventory and transportation decisions under different scenarios.     

An application of Genetic Algorithm in solving an inventory model with advance payment and interval valued inventory costs

The purpose of this research is to solve the mixed integer constrained optimization problem with interval coefficient by a real-coded genetic algorithm (RCGA) with ranking selection, whole arithmetical crossover and non-uniform mutation for non-integer decision variables. In the ranking selection, as well as in finding the best solution in each generation of RCGA, recently developed modified definitions of order relations between interval numbers with respect to decision-making are used. Also, for integer decision variables, new types of crossover and mutation are introduced. This methodology is applied to solve a finite time horizon inventory model with constant lead-time, uniform demand rate and a discount by paying an amount of money in advance. Moreover, different inventory costs are considered to be interval valued. According to the consumption of items during lead-time and reorder level, two cases may arise. For each case, the mathematical model becomes a constrained nonlinear mixed integer problem with interval objective. Our objective is to determine the optimal number of cycles in the finite time horizon, lot-size in each cycle and optimal profit. The model is illustrated with some numerical examples and sensitivity analysis has been done graphically with the variation of different inventory parameters.     

Synchronized routing of seasonal products through a production/distribution network

This paper presents a multi-period vehicle routing problem for a large-scale production and distribution network. The vehicles must be routed in such a way as to minimize travel and inventory costs over a multi-period horizon, while also taking retailer demands and the availability of products at a central production facility into account. The network is composed of one distribution center and hundreds of retailers. Each retailer has its demand schedule representing the total number of units of a given product that should have been received on a given day. Many high value products are distributed. Product availability is determined by the production facility, whose production schedule determines how many units of each product must be available on a given day. To distribute these products, the routes of a heterogeneous fleet must be determined for a multiple period horizon. The objective of our research is to minimize the cost of distributing products to the retailers and the cost of maintaining inventory at the facility. In addition to considering product availability, the routing schedule must respect many constraints, such as capacity restrictions on the routes and the possibility of multiple vehicle trips over the time horizon. In the situation studied, no more than 20 product units could be carried by a single vehicle, which generally limited the number of retailers that could be supplied to one or two per route. This article proposes a mathematical formulation, as well as some heuristics, for solving this single-retailer-route vehicle routing problem. Extensions are then proposed to deal with the multiple-retailer-route situation.     

Research on closed-loop supply chain coordination control model based on difference equation load model

ABSTRACT

This paper systematically summarizes the basic theory of closed-loop supply chain, expounds the difference equation model and the parameter dispersion of differential equation load model, and uses the difference equation to describe the dynamic model based on closed-loop supply chain network. Then the dynamic model of closed-loop supply chain network is established, and the basic theory of model predictive control is expounded. Finally, an inventory balance state space model is established for a closed-loop supply chain considering recycling centre, and a case study is carried out. Get the performance curve of production and inventory. Through the model predictive control method, it is proved that in the case of control variable production/order, the whole system is gradually stable, and when the stock level is controlled at a certain position, the cost can be reduced.     

Predictive control of nonlinear dynamic processes

Predictive control can be applied if the reference value of the process is known in advance and the deterministic disturbances can be predicted. A cost function defined in the future horizon is minimized. The control signal is calculated for a control horizon, but only the first one is applied and the procedure is repeated (receding horizon strategy). Processes with mild analytical nonlinear characteristics are considered. The possible process models are either nonparametric (linear, Hammerstein, and Volterra weighting function series) or parametric ones (generalized Hammerstein, parametric Volterra, and bilinear models). The algorithms of the optimal and suboptimal predictive control based on the nonparametric and the parametric models mentioned are derived. Several simulations present how effective these methods are. The adaptive case is dealt with as well.     

Hierarchical decision making in production and repair/replacement planning with imperfect repairs under uncertainties

In this paper, we analyse an optimal production, repair and replacement problem for a manufacturing system subject to random machine breakdowns. The system produces parts, and upon machine breakdown, either an imperfect repair is undertaken or the machine is replaced with a new identical one. The decision variables of the system are the production rate and the repair/replacement policy. The objective of the control problem is to find decision variables that minimize total incurred costs over an infinite planning horizon. Firstly, a hierarchical decision making approach, based on a semi-Markov decision model (SMDM), is used to determine the optimal repair and replacement policy. Secondly, the production rate is determined, given the obtained repair and replacement policy. Optimality conditions are given and numerical methods are used to solve them and to determine the control policy. We show that the number of parts to hold in inventory in order to hedge against breakdowns must be readjusted to a higher level as the number of breakdowns increases or as the machine ages. We go from the traditional policy with only one high threshold level to a policy with several threshold levels, which depend on the number of breakdowns. Numerical examples and sensitivity analyses are presented to illustrate the usefulness of the proposed approach.     

Optimal production control of a failure-prone machine

We consider a problem of optimal production control of a single unreliable machine. The objective is to minimize a discounted convex inventory/backlog cost over an infinite horizon. Using the variational analysis methodology, we develop the necessary conditions of optimality in terms of the co-state dynamics. We show that an inventory-threshold control policy is optimal when the work and repair times are exponentially distributed, and demonstrate how to find the value of the threshold in this case. We consider also a class of distributions concentrated on finite intervals and prove properties of the optimal trajectories, as well as properties of an optimal inventory threshold that is time dependent in this case.     

Dynamic Network Inventory Control Model with Interval Nonstationary Demand Uncertainty

We consider a dynamic inventory control system described by a network model with an interval assigned nonstationary demand. We assume that unknown demand may take any value within the interval, which bounds depend on time. In terms of Kaucher interval arithmetic, we derive necessary and sufficient conditions for the existence of a feasible feedback control and sufficient conditions for the existence of an optimal feedback control strategy. We obtain an optimal feasible storage level and estimate the rate of the system convergence to this level. Then we develop the algorithm of finding the optimal control strategy. These results are applied to an example.     

A non-stationary periodic review production–inventory model with uncertain production capacity and uncertain demand

In this paper we consider a nonstationary periodic review dynamic production–inventory model with uncertain production capacity and uncertain demand. The maximum production capacity varies stochastically. It is known that order up-to (or base-stock, critical number) policies are optimal for both finite horizon problems and infinite horizon problems. We obtain upper and lower bounds of the optimal order up-to levels, and show that for an infinite horizon problem the upper and the lower bounds of the optimal order up-to levels for the finite horizon counterparts converge as the planning horizons considered get longer. Furthermore, under mild conditions the differences between the upper and the lower bounds converge exponentially to zero.     

Planning and scheduling of multistage multiproduct batch plants operating under production campaigns

When plants are operated under stable conditions during reasonable time periods, operation with campaigns is particularly appropriate. The regular operation of the facilities simplifies the production control, the inventory management, the plant operability, etc. A?campaign includes several batches of different products that are going to be manufactured and the same one is cyclically repeated over the time horizon. In this work, a mixed integer linear programming formulation is proposed for the planning and scheduling of given multiproduct batch plants operating with campaigns. The number and size of batches for each product, the campaign composition, the assignment of batches to units and their sequencing, and the number of times that the campaign is repeated over the time horizon must be determined. Taking into account this scenario, an appropriate performance measure is the minimization of the cycle time. An asynchronous slot-based continuous-time representation for modeling the assignment of batches to units and their sequencing is employed, and a novel rule for determining the maximum number of slots postulated for each unit is proposed.     

An inventory control problem for deteriorating items with back-ordering and financial considerations

This paper investigates the effects of time value of money and inflation on the optimal ordering policy in an inventory control system. We proposed an economic order quantity model to manage a perishable item over the finite horizon planning under which back-ordering and delayed payment are assumed. The demand and deterioration rates are constant. The present value of total cost during the planning horizon in this inventory system is modeled first, then a three phases solution procedure is proposed to derive the optimal order and shortage quantities, and the number of replenishment during the planning horizon. Finally, the proposed model is illustrated through numerical examples and the sensitivity analysis is reported to find some managerial insights.     

Optimal Policies for Production/Inventory Systems with Finite Capacity and Markov-Modulated Demand and Supply Processes

In many production/inventory systems, not only is the production/inventory capacity finite, but the systems are also subject to random production yields that are influenced by factors such as breakdowns, repairs, maintenance, learning, and the introduction of new technologies. In this paper, we consider a single-item, single-location, periodic-review model with finite capacity and Markov modulated demand and supply processes. When demand and supply processes are driven by two independent, discrete-time, finite-state, time-homogeneous Markov chains, we show that a modified, state-dependent, inflated base-stock policy is optimal for both the finite and infinite horizon planning problems. We also show that the finite-horizon solution converges to the infinite-horizon solution.     

Fuzzy stochastic inequality and equality possibility constraints and their application in a production-inventory model via optimal control method

This paper deals with one equality constraint in fuzzy environment and other inequality constraint with both fuzzy and random parameter together. The purpose of this paper is to demonstrate the application of these type of constraints in a production inventory model solved as a Bang–Bang control problem in a finite time horizon. Finally numerical experiments have been performed for illustration.