Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost

This article addresses a single‐item, finite‐horizon, periodic‐review coordinated decision model on pricing and inventory control with capacity constraints and fixed ordering cost. Demands in different periods are random and independent of each other, and their distributions depend on the price in the current period. Each period's stochastic demand function is the additive demand model. Pricing and ordering decisions are made at the beginning of each period, and all shortages are backlogged. The objective is to find an optimal policy that maximizes the total expected discounted profit. We show that the profit‐to‐go function is strongly CK‐concave, and the optimal policy has an (s,S,P) ‐like structure. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

论音乐与社会文化发展的关联性

本文通过对中国当代青年文化的变迁的浅论,简单论述音乐与文化发展的关联性,使我们认识到在当今世界各种文化互动中,我们需要自重,但不封闭,需要学习,但不盲从。     

高超声速防空导弹结构防热技术展望

近年来,高超声速防空导弹成为各军事大国研究热门。高超声速防空导弹飞行速度马赫数超过5,因此如何准确确定气动加热环境和进行热防护设计,选择合适的防热结构方案,是研制高超声速防空导弹的重要关键技术。基于未来高超声速防空导弹可能面临的热环境,并结合目前国内外在热防护材料及热结构方面的发展状况,介绍几种适合未来高超声速防空导弹的防热设计方案。     

基于UDVR的低压配电线路雷击电压跌落治理仿真

采用分相控制的UDVR主电路结构,利用瞬时波形比较法,基于三角波比较的delta增量逆变技术,建立了UDVR的PSCAD／EMTDC仿真模型,解决了低压配电网线路遭受雷击、绝缘子闪络等引发的单相接地故障在线路重合闸期间引发的电压跌落问题,保证了敏感负荷在此期间的持续供电的电能质量．仿真结果表明：模型建立正确,控制方法可行．     

通过变维kalman滤波实现融合定位

为了能更好地跟踪、定位机动目标,提出了一种将蜂窝网定位信息与本地传感器信息相融合,利用变维Kalman滤波实现定位的方法。本地传感器信息指目标的运动速度和方向。仿真实验证明该方法具有较强的机动跟踪能力,定位精度高,且计算相对简便。     

Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP‐hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

对象关系数据库中的数据结构

介绍了在面向对象数据库和关系数据库相结合的对象关系数据库中,实现关系型数据结构和面向对象数据结构的结合及其存储的一种方法,并举例说明对象关系数据库中对象关系数据记录存储的具体实现。     

Sojourn times in a two‐stage queueing network with blocking

The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first‐come‐first‐serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi‐birth‐and‐death processes and continuous‐time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Economic ordering decisions with market choice flexibility

Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.