Transport of airborne particulate matters originating from Mentougou, Beijing, China

In this study, a coupled regional air quality modeling system is applied to investigate the time spatial variations in airborne particulate matters （PM10）, originating from Mentougou to Beijing municipal area in the period of April 1-7, 2004, and the influences of complex terrain and meteorological conditions upon boundary layer structure and PM10 concentration distributions. An intercomparison of the performance with CALPUFF against the observed data is presented and an examination of scatter plots is provided. The statistics show that the correlation coefficient and STD between the modeled and observed data are 0.86 and 0.03, respectively. Analysis of model results illustrates that the pollutants emitted from Mentougou can be transported to Beijing municipal area along certain transport pathways, and PM10 concentration distributions show heterogeneity characteristics. Contributions of the Mentougou sources to the PM10 concentrations in Beijing municipal area are up to 0.1-15 μg/m^3.     

基于投影寻踪分类模型的高管团队战略协同分析

着眼于企业高管团队战略协同系统所蕴含的学术与实践价值,研究系统效能重于高管团队自身的作为,关注系统优化则更重于传统模式下高管团队的内部建设.本文首先探究了高管团队与企业战略的协同机理;然后将基于实码加速遗传算法的投影寻踪分类模型技术引入子系统及子系统序参量的权重计算和有序度评价,提出了新的协同度评价方法,建立了高管团队的战略协同度评价模型;应用该模型对S企业进行了实例研究,印证了模型的可操作性.企业高管团队的战略协同度评价结果有助于识别具体企业高管团队战略协同进程中的制约要素,从而有针对性地提出优化对策.     

需求率为斜坡型的一类变质性物品最优库存策略

本文在考虑需求率服从斜坡型分布的情况下,研究了允许缺货且缺货完全回补、变质率服从威布尔分布、补货率为无穷、有限计划期内的库存模型,证明了最优补货策略的存在性,并给出了求解最优补货策略的算法.     

延期支付条件下零售商的最优售价和订货策略

在供应商给予零售商延期支付和现金折扣的优惠政策下,进一步假设产品的年需求量依赖于零售商产品售价的基础上,建立了由一个零售商和一个供应商所构成的库存决策模型,扩展了经典的经济生产批量(EPQ)模型。通过模型的分析求解,可以得出零售商在上述情况下的最优订货周期、最优售价及最优付款时间的简单判定方法。最后,通过算例,验证了模型的可行性,得出了与实际相符的结论。     

A Dynamic Supplier Selection and Inventory Management Model for a Serial Supply Chain with a Novel Supplier Price Break Scheme and Flexible Time Periods

A new supplier price break and discount scheme taking into account order frequency and lead time is introduced and incorporated into an integrated inventory planning model for a serial supply chain that minimizes the overall incurred cost including procurement, inventory holding, production, and transportation. A mixed-integer linear programming (MILP) formulation is presented addressing this multi-period, multi-supplier, and multi-stage problem with predetermined time-varying demand for the case of a single product. Then, the length of the time period is considered as a variable. A new MILP formulation is derived when each period of the model is split into multiple sub-periods, and under certain conditions, it is proved that the optimal solution and objective value of the original model form a feasible solution and an upper bound for the derived model. In a numerical example, three scenarios of the derived model are solved where the number of sub-period is set to 2, 3, and 4. The results further show the decrease of the optimal objective value as the length of the time period is shortened. Sufficient evidence demonstrates that the length of the time period has a significant influence on supplier selection, lot sizing allocation, and inventory planning decisions. This poses the necessity of the selection of appropriate length of a time period, considering the trade-off between model complexity and cost savings.     

基于排队的库存服务系统最优控制策略

研究一个连续盘点的(s,Q)补货的库存服务系统。基于排队理论建立库存水平状态平衡方程,并推导出库存水平稳态概率分布以及作为库存控制的系统稳态性能指标。以库存成本最小化为目标,构建服务水平约束的库存控制模型。针对模型的非线性约束与整数型变量的特征,采用一种改进的遗传算法(IGA)用于决策变量的寻优。数值实验表明,当目标服务水平大于库存系统内生的服务水平时,实施服务水平约束能够降低库存控制成本。     

信息共享程度对我国服装供应链库存成本的影响

我国服装行业库存水平近年逐渐恶化,库存问题成为该行业发展的重要瓶颈。信息共享被认为是有效解决该问题的方法之一。然而目前国内文献对我国服装行业信息共享的定量研究较为缺乏;同时国内外对信息共享的普适研究也多集中于比较共享与不共享信息的影响,鲜有文章研究信息共享程度对供应链绩效的影响。本文通过建立信息共享量化模型分析以下三种情况对服装行业供应商库存水平及成本的影响:(1)共享需求统计信息,(2)共享实时需求信息,(3)共享需求及市场信息。本文研究表明,共享实时需求信息比共享需求统计信息能有效降低供应商库存水平及成本;而额外共享市场信息,能增加供应链柔性,提高其应对市场不确定性的能力。本文研究信息共享程度对服装行业供应链的影响,旨在降低我国服装供应链高库存水平,并为我国服装企业信息化及品牌建设提供管理启示。     

Partial Pooling in Tandem Lines with Cooperation and Blocking

For a tandem line of finite, single-server queues operating under the production blocking mechanism, we study the effects of pooling several adjacent stations and the associated servers into a single station with a single team of servers. We assume that the servers are cross-trained (so that they can work at several different stations) and that two or more servers can cooperate on the same job. For such a system, we provide sufficient conditions on the service times and sizes of the input and output buffers at the pooled station under which pooling will decrease the departure time of each job from the system (and hence increase the system throughput). We also show that pooling decreases the total number of jobs in the system at any given time and the sojourn time of each job in the system if the departure time of each job from the system is decreased by pooling and there is an arrival stream at the first station. Moreover, we provide sufficient conditions under which pooling will improve the holding cost of each job in the system incurred before any given time, and extend our results to closed tandem lines and to queueing networks with either a more general blocking mechanism or probabilistic routing. Finally, we present a numerical study aimed at quantifying the improvements in system performance obtained through pooling and at understanding which stations should be pooled to achieve the maximum benefit. Our results suggest that the improvements gained by pooling may be substantial and that the bottleneck station should be among the pooled stations in order to obtain the greatest benefit. AMS subject classification: 90B22     

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.     

Two storage inventory model in a mixed environment

Multi-item inventory models with two storage facility and bulk release pattern are developed with linearly time dependent demand in a finite time horizon under crisp, stochastic and fuzzy-stochastic environments. Here different inventory parameters—holding costs, ordering costs, purchase costs, etc.—are assumed as probabilistic or fuzzy in nature. In particular cases stochastic and crisp models are derived. Models are formulated as profit maximization principle and three different approaches are proposed for solution. In the first approach, fuzzy extension principle is used to find membership function of the objective function and then it’s Graded Mean Integration Value (GMIV) for different optimistic levels are taken as equivalent stochastic objectives. Then the stochastic model is transformed to a constraint multi-objective programming problem using Stochastic Non-linear Programming (SNLP) technique. The multi-objective problems are transferred to single objective problems using Interactive Fuzzy Satisfising (IFS) technique. Finally, a Region Reducing Genetic Algorithm (RRGA) based on entropy has been developed and implemented to solve the single objective problems. In the second approach, the above GMIV (which is stochastic in nature) is optimized with some degree of probability and using SNLP technique model is transferred to an equivalent single objective crisp problem and solved using RRGA. In the third approach, objective function is optimized with some degree of possibility/necessity and following this approach model is transformed to an equivalent constrained stochastic programming problem. Then it is transformed to an equivalent single objective crisp problem using SNLP technique and solved via RRGA. The models are illustrated with some numerical examples and some sensitivity analyses have been presented.