需求可变性降低对均值CVaR约束销售努力决策库存系统的影响

本文运用Levy提出的变换研究需求可变性降低对风险偏好零售商的库存决策、销售努力决策和期望效用的影响,用均值CVaR刻画零售商的风险偏好特性,它包括风险厌恶、风险追求,也具有损失规避的特性。首先,运用该变换定量刻画需求可变性的降低,证明该变换蕴含经典随机占优中的割准则序和二阶随机占优等。其次,给出系统的最优订货量、最优期望效用和最优销售努力水平,得到它们关于风险偏好系数的单调性,并给出降低需求可变性对期望效用的影响。第三,针对风险中性、风险厌恶(最大化CVaR)和风险追求(最小化CVaR)这三种特殊情况得到相应的结果,并给出企业在库存决策和促销决策的管理启示。最后,通过数值例子验证了得到的研究结果并给出相应的管理启示。     

考虑合同保质期的快速失效药品的二级供应链库存策略研究

医院药品对保质期和服务水平有非常高的要求,同时,药品的库存空间在医药库存中也有重要影响。首先针对快速失效的医药药品考虑了医药库存的合同保质期以及库存空间约束,同时考虑医院库存以及制造商库存,基于经济订货批量模型和经济生产批量模型建立了二级供应链的医药库存模型,然后用MATLAB软件求解了模型最优解,并对一些重要参数进行了敏感性分析。研究发现,合同保质期对医院订购批量、制造商生产批量和总库存成本有一定的影响,其中对于制造商的生产批量以及医院的库存成本影响较大。如果不考虑合同保质期的约束,将会对总库存成本带来更大损失。     

基于排队的两类顾客易逝品库存控制策略研究

本文采用排队理论在面向两类顾客需求的环境下讨论易逝品库存排队系统控制策略问题。首先刻画面向两类顾客服务且具有马尔科夫结构的易逝品库存系统排队模型,获得库存水平状态的稳态概率分布以及作为库存成本控制的系统稳态性能指标。接下来,构建库存控制成本函数及考虑服务水平约束的库存控制优化模型,设计了改进的遗传算法。最后,数值算例揭示出系统参数的敏感性和相应的管理启示。     

Inventory control with fixed cost and price optimization in continuous time

We continue to study the problem of inventory control, with simultaneous pricing optimization in continuous time. In our previous paper [8], we considered the case without set up cost, and established the optimality of the base stock-list price (BSLP) policy. In this paper we consider the situation of fixed price. We prove that the discrete time optimal strategy (see [11]), i.e., the (s, S, p) policy can be extended to the continuous time case using the framework of quasi-variational inequalities (QVIs) involving the value function. In the process we show that an associated second order, nonlinear two-point boundary value problem for the value function has a unique solution yielding the triplet (s, S, p). For application purposes the explicit knowledge of this solution is needed to specify the optimal inventory and pricing strategy. Se- lecting a particular demand function we are able to formulate and implement a numerical algorithm to obtain good approximations for the optimal strategy.     

Managing supply chain backorders under vendor managed inventory: An incentive approach and empirical analysis

This paper shows how a manufacturer may use an incentive contract with a distributor under a VMI arrangement to gain market share. The manufacturer promises a distributor lower inventory levels in exchange for efforts by the distributor to convert potential lost sales due to stockouts to backorders. Data gathered from a third party provider of information services are then used to illustrate that this incentive arrangement may, at least implicitly, be employed in industry. Our data estimations show that when a manufacturer and distributor are operating under a VMI arrangement, lower inventory at the distributor is associated with a higher conversion rate of lost sales stockouts to backorders.     

An improvement to multiple criteria ABC inventory classification

In this paper we presented an extended version of the Ng-modelg [W.L. Ng, A simple classifier for multiple criteria ABC analysis, European Journal of Operational Research 177 (2007) 344–353] for multi-criteria inventory classification. The proposed model is a nonlinear programming model which determines a common set of weights for all the items. Our model not only incorporates multiple criteria for ABC classification, but also maintains the effects of weights in the final solution, an improvement over the model proposed by Ng. An illustrative example is presented to compare our model and the Ng-model.     

需求对时间和价格敏感产品的最优动态定价与订购策略

探讨了需求对时间和价格敏感产品的最优动态定价和订购策略,建立了使零售商利润最大化的库存模型.然后对模型的性质进行了分析,给出了一个寻找最优价格调整次数的算法和数值例子,得到一些有意义的管理经验.     

基于MCMC的随机库存系统中提前期需求分布的计算

在需求和提前期均是随机的库存系统中,提前期需求的分布是由提前期分布与需求分布复合而成的,这个复合分布的计算通常是困难的。本文采用基于Gibbs抽样的马尔科夫链蒙特卡洛(MCMC,Markov chain Monte Carlo)方法,抽取条件分布样本作为提前期需求分布的样本,通过样本来计算提前期需求分布密度、服务水平和损失函数。这种方法避免了直接求解复杂积分计算上的困难,也克服了近似分布拟合偏差过大的问题,有效地解决了随机需求与随机提前期的复杂库存系统中提前期需求确定问题。理论与数值分析结果表明:与现有方法相比较,基于MCMC的方法具有计算简便、拟合精度高、通用性好等特点。     

损耗性物品信用交易下的斯坦博格库存模型

目前众多的信用交易模型是在供应商给定的信用交易期限条件下,零售商确定最优订购数量或订购周期,而很少考虑供应商信用交易策略的制定问题。本文针对损耗性物品,在最终需求为价格的线性函数条件下,利用斯坦博格博弈模型给出了信用交易下供应商信用交易策略的制定和零售商的最优订购决策,最后通过算例对模型进行了验证。     

Intersecting a simple mixed integer set with a vertex packing set

We consider a mixed integer set that results from the intersection of a simple mixed integer set with a vertex packing set from a conflict graph. This set arises as a relaxation of the feasible set of mixed integer problems such as inventory routing problems. We derive families of strong valid inequalities that consider the structures of the simple mixed integer set and the vertex packing set simultaneously.