An economic lot‐sizing problem with perishable inventory and economies of scale costs: Approximation solutions and worst case analysis

The costs of many economic activities such as production, purchasing, distribution, and inventory exhibit economies of scale under which the average unit cost decreases as the total volume of the activity increases. In this paper, we consider an economic lot‐sizing problem with general economies of scale cost functions. Our model is applicable to both nonperishable and perishable products. For perishable products, the deterioration rate and inventory carrying cost in each period depend on the age of the inventory. Realizing that the problem is NP‐hard, we analyze the effectiveness of easily implementable policies. We show that the cost of the best Consecutive‐Cover‐Ordering (CCO) policy, which can be found in polynomial time, is guaranteed to be no more than (4 + 5)/7 ≈ 1.52 times the optimal cost. In addition, if the ordering cost function does not change from period to period, the cost of the best CCO policy is no more than 1.5 times the optimal cost. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

分布参数管道的一种改进的小分段数有限元模型

在分段数为１和２时，现有有限元模型的一阶谐振频率比一维分布参数模型的一阶谐振频率低许多，因而其适用的频率范围较低，计算精度较差。本文提出了一种改进的小分段数有限元模型，通过修正流体管道的并联导纳使分段数为１和２时的有限元模型的一阶谐振频率与一维分布参数模型一致，从而提高了其使用的频率范围和计算精度。利用单根管道阀门关闭的水击问题的仿真计算对改进模型的效果进行了验证。在分段数为２时，原有的有限元模型的计算结果与分布参数模型的计算结果相差较大，而改进后的模型的计算结果与分布参数模型的计算结果基本一致。     

正则化方法在拉普拉斯数值反演中的应用

本文用正则化方法给出了拉普拉斯变换的数值反演方法,并考虑了问题的不适定性,此方法在实际中有较强的应用价值.     

空空导弹攻击区处理的拟合——插值法

用最小二乘拟合与插值相结合的方法对空空导弹的发射包线进行处理,降低了拟合阶次。数字仿真结果表明,该方法不但在平常发射条件下极大地提高了拟合的精度和速度,而且在一些传统方法几乎无法使用的异常情况下仍有较好的结果。     

属性约简与近似集的关系研究

上近似和下近似是在粗集理论中最基本的概念,而粗集理论的主要思想又是在保持分类能力不变的前提下通过对属性的约简导出问题的决策和分类规则。本文讨论了属性的约简和相对约简与上近似和下近似的关系,并在此基础上提出了一种新的相对约简———保近似约简。     

Balancing perfectly periodic service schedules: An application from recycling and waste management

A national recycling and waste management company provides periodic services to its customers from over 160 service centers. The services are performed periodically in units of weeks over a planning horizon. The number of truck‐hours allocated to this effort is determined by the maximum weekly workload during the planning horizon. Therefore, minimizing the maximum weekly workload results in minimum operating expenses. The perfectly periodic service scheduling (PPSS) problem is defined based on the practices of the company. It is shown that the PPSS problem is strongly NP‐hard. Attempts to solve large instances by using an integer programming formulation are unsuccessful. Therefore, greedy BestFit heuristics with three different sorting schemes are designed and tested for six real‐world PPSS instances and 80 randomly generated data files. The heuristics provide effective solutions that are within 2% of optimality on average. When the best found BestFit schedules are compared with the existing schedules, it is shown that operational costs are reduced by 18% on average. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 160–171, 2012     

Basic scheduling problems with raw material constraints

One of the achievements of scheduling theory is its contribution to practical applications in industrial settings. In particular, taking finiteness of the available production capacity explicitly into account, has been a major improvement of standard practice. Availability of raw materials, however, which is another important constraint in practice, has been largely disregarded in scheduling theory. This paper considers basic models for scheduling problems in contemporary manufacturing settings where raw material availability is of critical importance. We explore single scheduling machine problems, mostly with unit or all equal processing times, and L_max and C_max objectives. We present polynomial time algorithms, complexity and approximation results, and computational experiments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Signal‐to‐interference‐plus‐noise ratio estimation for wireless communication systems: Methods and analysis

The Signal‐to‐Interference‐plus‐Noise Ratio (SINR) is an important metric of wireless communication link quality. SINR estimates have several important applications. These include optimizing the transmit power level for a target quality of service, assisting with handoff decisions and dynamically adapting the data rate for wireless Internet applications. Accurate SINR estimation provides for both a more efficient system and a higher user‐perceived quality of service. In this paper, we develop new SINR estimators and compare their mean squared error (MSE) performance. We show that our new estimators dominate estimators that have previously appeared in the literature with respect to MSE. The sequence of transmitted bits in wireless communication systems consists of both pilot bits (which are known both to the transmitter and receiver) and user bits (which are known only by the transmitter). The SINR estimators we consider alternatively depend exclusively on pilot bits, exclusively on user bits, or simultaneously use both pilot and user bits. In addition, we consider estimators that utilize smoothing and feedback mechanisms. Smoothed estimators are motivated by the fact that the interference component of the SINR changes relatively slowly with time, typically with the addition or departure of a user to the system. Feedback estimators are motivated by the fact that receivers typically decode bits correctly with a very high probability, and therefore user bits can be thought of as quasipilot bits. For each estimator discussed, we derive an exact or approximate formula for its MSE. Satterthwaite approximations, noncentral F distributions (singly and doubly) and distribution theory of quadratic forms are the key statistical tools used in developing the MSE formulas. In the case of approximate MSE formulas, we validate their accuracy using simulation techniques. The approximate MSE formulas, of interest in their own right for comparing the quality of the estimators, are also used for optimally combining estimators. In particular, we derive optimal weights for linearly combining an estimator based on pilot bits with an estimator based on user bits. The optimal weights depend on the MSE of the two estimators being combined, and thus the accurate approximate MSE formulas can conveniently be used. The optimal weights also depend on the unknown SINR, and therefore need to be estimated in order to construct a useable combined estimator. The impact on the MSE of the combined estimator due to estimating the weights is examined. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Variable sampling plans for normal distribution indexed by Taguchi's loss function

Taguchi has presented an approach to quality improvement in which reduction of deviation from the target value is the guiding principle. In this approach any measured value x of a product characteristic X brings a loss to consumer in general, where the loss is expressed as a quadratic form with respect to the difference between the measured value x and the target value T of a product characteristic. Then, it is natural to reject the lot which may bring a large loss to consumer. This concept induces us to construct new variable sampling plans based on the Taguchi's loss criterion. In this article, a design procedure of the sampling plans for assuring the loss in the Taguchi's method is proposed. Some numerical results based on the proposed design procedures are illustrated. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 591–603 (1997)