The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

目标选择优化模型及算法

提出了可用于大威力武器火力分配的目标选择优化模型及算法。内容包括：问题的数学描述、问题的等价变换与分解、问题求解的动态规划算法和不同算法的计算次数比较。     

线性规划的一种并行修正松弛算法

对求解线性规划问题的松弛算法进行了修正,在此基础上提出了一种基于cluster结构的并行算法,分析了算法的性能;基于曙光3000大规模并行计算机,给出了算法用于求解线性规划问题实例的实验结果.理论分析和实验结果表明,修正算法改进了松弛算法的实际性能,同时具有较好的并行性和稳定性,可用于求解此类大规模科学与工程规划问题的高性能计算.     

给定人员情况下最小化开发时间和成本的软件项目调度

给出了一种软件项目的随机调度模型.它明确地把调度策略作为输入,一旦调度策略确定,模型就可以输出关于项目的完成时间或成本的一个概率分布.利用随机最优化技术,能够计算出软件项目的一个调度策略,它使得项目在人员给定的情况下开发时间和成本最小.     

层次分析法中一致性检验的一种调整方法

针对层次分析法中一致性检验难以通过的问题,提出了一种优化调整方法,并分析了该方法的基本思路及可行性。为方便上机编程,还给出了该方法的具体实现步骤。     

S模糊集与故障树复合分析

运用模糊集评价和概率估计提出一种故障树复合分析方法来评价非常事件,使传统的故障树分析中,类似人为错误的模糊、不精确事件得到有效地处理。     

关于Smarandache序列Pd（n）和qd（n）的均值估计

对任意正整数n,Pd（n）定义为n的所有正因子的乘积,gd（n）定义为n的所有小于n的正因子的乘积。若n=p1^a1p2^a2…px^as是n的标准分解式,算数函数Ω（n）=a1＋a2＋…＋as。用解析的方法研究关于Smarandache序列Pd（n）、qd（n）与Q（n）的混合均值,并给出两个较好的渐近公式。     

基于GP的计划生成方法

针对计划生成的计算复杂性和传统遗传算法在求解组合问题时的低效率,结合任务策略提出了一种基于遗传程序设计的计划生成方法。利用业务活动域的任务策略知识来指导遗传操作,减少了完全随机遗传操作造成的无效操作,并且在进化过程中使高阶模式和低阶模式获得共同的进化机会,提高了遗传算法的效率。     

Hilbert空间中Lipschitz伪压缩映像不动点的杂交投影算法

在H ilbert空间中,采用杂交投影的方法设计了一种Lipschitz伪压缩映像不动点新的迭代格式,并利用H ilbert空间中特有的性质,证明了由此算法产生的序列强收敛于Lipschitz伪压缩映像不动点。     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008