排序方式: 共有29条查询结果,搜索用时 15 毫秒
11.
12.
首次导出了平面问题两种介质分界线为离散线的线法基本方程;三维问题离散线分布于界面内的技法基本方程;并采用线法对拉伸法试验中膜基最大剪切应力问题进行了计算,指出了原有结果中的不足. 相似文献
13.
本文就奇异点附近的变形可表示为一维函数的情况,导出了奇异点附近变形的凸凹性对照射光源的要求。用焦散线的这种性质测定平面裂纹的应力强度因子KⅡ,收到意想不到的效果。 相似文献
14.
15.
刀口边缘误差对传递函数的影响 总被引:1,自引:0,他引:1
刀口法是测量光学系统的传递函数一种基本方法,通过对刀口边缘误差建立数学模型,讨论刀口误差对光学传递函数测量精度的影响。对刀口边缘误差进行了定量分析,得出在一定精度范围内测量光强的区域,定性分析了使用拟合法求MTF优于使用均值法求MTF。 相似文献
16.
We consider the case when n components are needed to assemble a given product. Components are provided by suppliers, and the period between the order time and the time a component is available (i.e., the lead time) is a random variable with a known distribution. The due date for the assembled product is also known. The costs to be taken into account are the inventory costs of the components and the backlogging cost of the assembled product. We propose an iterative algorithm which leads to the optimal order instants of the components. © 1993 John Wiley & Sons, Inc. 相似文献
17.
In modern warfare, many believe the decisive factor in winning a battle is seizing the right moment to shift from defense to attack, or vice versa. This paper attempts to bring that perspective to Lanchester's differential equations of warfare, and continues the application of Lanchester's linear law to the analysis of the World War II battle of Ardennes, as reported in earlier issues of Naval Research Logistics by Bracken and by Fricker. A new variable, shift time, accounting for the timing of the shift between defense and attack is explicitly included in our version of the model, and it helps obtain improved goodness of fit to historical data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:653–661, 2001 相似文献
18.
19.
Chengbin Chu 《海军后勤学研究》1992,39(6):859-875
This article examines the single-machine scheduling problem to minimize total flow time with unequal release dates. This problem has been proven to be NP-hard. We present a necessary and sufficient condition for local optimality which can also be considered as a priority rule. On the basis of this condition, we then define a class of schedules which contains all optimal solutions. We present some efficient heuristic algorithms using the previous condition to build a schedule belonging to this subset. We also prove some new dominance theorems, discuss the results found in the literature for this problem, and propose a branch-and-bound algorithm in which the heuristics are used to provide good upper bounds. We compare this new algorithm with existing algorithms found in the literature. Computational results on problems with up to 100 jobs indicate that the proposed branch-and-bound algorithm is superior to previously published algorithms. © 1992 John Wiley & Sons. Inc. 相似文献
20.
We incorporate strategic customer waiting behavior in the classical economic order quantity (EOQ) setting. The seller determines not only the timing and quantities of the inventory replenishment, but also the selling prices over time. While similar ideas of market segmentation and intertemporal price discrimination can be carried over from the travel industries to other industries, inventory replenishment considerations common to retail outlets and supermarkets introduce additional features to the optimal pricing scheme. Specifically, our study provides concrete managerial recommendations that are against the conventional wisdom on “everyday low price” (EDLP) versus “high-low pricing” (Hi-Lo). We show that in the presence of inventory costs and strategic customers, Hi-Lo instead of EDLP is optimal when customers have homogeneous valuations. This result suggests that because of strategic customer behavior, the seller obtains a new source of flexibility—the ability to induce customers to wait—which always leads to a strictly positive increase of the seller's profit. Moreover, the optimal inventory policy may feature a dry period with zero inventory, but this period does not necessarily result in a loss of sales as customers strategically wait for the upcoming promotion. Furthermore, we derive the solution approach for the optimal policy under heterogeneous customer valuation setting. Under the optimal policy, the replenishments and price promotions are synchronized, and the seller adopts high selling prices when the inventory level is low and plans a discontinuous price discount at the replenishment point when inventory is the highest. 相似文献