A Bayesian analysis on the effect of multiple supply options in a quick response environment

In the apparel industry, vendors often suffer from high mismatches in supply and demand. To cope with this problem, they procure the same style product from different suppliers with different manufacturing costs. Especially in the quick response environment, which allows vendors to monitor trends in customer demand and search for available suppliers through the electronic market, they have additional opportunities to improve their decision‐making. In this paper, we propose an analytical profit maximization model and develop efficient decision tools to help both the middle and lower level managers pursuing this strategy. Furthermore, we have shown how significantly the vendors' potential competitive edge can be improved by exploiting multiple supply options, even at the expense of high premium procurement costs for late orders. The effect is critical, especially in a highly competitive market, and it has important implications for the top managers. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

微分方程解的稳定性与周期性

综合利用相空间理论、压缩映像原理、算子的性质以及Liapunov泛函的方法,研究了具有无限时滞中立型泛函微分方程周期解的存在性、唯一性及稳定性问题,得到新的结果,推广了已有的结果。     

农村文化建设对农村社会稳定的双向效应

社会稳定是改革发展的重要前提,而保持农村稳定是全社会稳定的关键。维护农村社会稳定根本途径在于文化建设,但文化建设对农村社会稳定有双向效应。文化建设对农村社会稳定的正面效应有减贫效应、社会结构优化效应、社会控制效应、社会心理优化效应和社会化效应,而文化建设的受益不均衡效应、虚化效应、过度社会动员效应及其信息失稳效应等又不利于农村社会稳定。因此,要充分重视农村文化建设的积极作用,也要清醒认识其负面效应,并为维护农村社会稳定考虑扬正抑负的对策。     

Waiting time analysis of the M/G/1 queue with finite retrial group

We consider an M/G/1 retrial queue with finite capacity of the retrial group. First, we obtain equations governing the dynamic of the waiting time. Then, we focus on the numerical inversion of the density function and the computation of moments. These results are used to approximate the waiting time of the M/G/1 queue with infinite retrial group for which direct analysis seems intractable. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process

This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

地杂波雷达截面积模型分析

对雷达地杂波进行准确有效地建模在雷达性能分析中是非常重要的.在推导雷达直视距离的基础上,分析比较了地杂波雷达截面积的经典模型与改进模型相对于雷达作用距离之间的性能曲线.实例验证表明,两种模型之间的区别随着距离的增大而增大;改进模型的曲线变化趋势与实际在雷达显示器上的观察到的杂波变化情况能够较好地吻合.     

机载武器自主类型选择算法

基于减轻飞行员负担和满足无人攻击机发展的需要,研究了载机的自主武器类型选择问题.应用管理学和运筹学知识和采用模糊推理中隶属度函数的思想,分别试探性地提出了两种自主武器选择方法:基本流程法和隶属度函数法.从算例结果可以看出:应用这两种方法得到比较好的武器选择结果.因此,在载机上应用这两种武器选择算法,能使载机具有自主选择合适武器的能力.     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于时长调整技术的低速率语音编码算法

研究并实现了一种新的低速率语音编码方案。通过将时长调整算法作为声码器的预处理和后处理,不需要修改声码器结构就能灵活地实现低速率语音编码。文中选择基于STFT的时长调整算法、SOLA算法、WSOLA算法分别与2.4kb/s和600b/s的声码器相结合,仿真结果显示,新方案进一步降低了语音编码速率,为低速率语音编码研究提供了一条有效的新思路。