全文获取类型
收费全文 | 148篇 |
免费 | 60篇 |
国内免费 | 11篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 5篇 |
2017年 | 12篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 22篇 |
2013年 | 13篇 |
2012年 | 15篇 |
2011年 | 13篇 |
2010年 | 7篇 |
2009年 | 14篇 |
2008年 | 10篇 |
2007年 | 14篇 |
2006年 | 9篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 5篇 |
2002年 | 7篇 |
2001年 | 3篇 |
2000年 | 1篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有219条查询结果,搜索用时 15 毫秒
191.
A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017 相似文献
192.
在将子弹均匀散布的椭圆区域等效转换为矩形区域的基础上,建立了适宽射向射击子母弹对矩形目标毁伤全概率计算的数学模型。通过函数转换和泛函分析给出了子弹均匀散布子母弹理想射击密度,得到了理想射击密度下对目标的毁伤概率计算公式。讨论了最有利火力分配方式的确定方法,给出了最优射向间隔和表尺差的计算公式,为便于实际应用,给出了最优火力分配计算中所需的3个参数的近似计算公式,最后给出了应用算例。 相似文献
193.
针对目前大学自习教室资源浪费普遍存在的现象,将学生上自习与否视为独立同分布随机变量,从自习教室的管理与维护成本、电费成本以及学生的满意度3个方面出发,建立了双目标随机规划模型,并在模型基础上提出了大学自习教室设置的一般方法。通过实例分析,对模型的正确性和有效性进行了论证。结果表明:在各种情况下,该模型都能很好地解决自习教室设置这一问题,并且能在学生满意度较高的条件下,节约能源13%以上。该模型可以有效地对自习教室进行优化设置,不仅提高了资源利用水平,而且节约了能源。 相似文献
194.
This article discusses a two‐player noncooperative nonzero‐sum inspection game. There are multiple sites that are subject to potential inspection by the first player (an inspector). The second player (potentially a violator) has to choose a vector of violation probabilities over the sites, so that the sum of these probabilities do not exceed one. An efficient method is introduced to compute all Nash equilibria parametrically in the amount of resource that is available to the inspector. Sensitivity analysis reveals nonmonotonicity of the equilibrium utility of the inspector, considered as a function of the amount of resource that is available to it; a phenomenon which is a variant of the well‐known Braess paradox. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
195.
Consider a manufacturer serving a set of retail stores each of which faces deterministic demands in a finite planning horizon. At the beginning of the planning horizon, the production capacity of the manufacturer is built, followed by production, outsourcing to third party manufacturers if necessary and distribution to the retail stores. Because the retail stores are usually managed by different managers who act as independent profit centers, it is desirable that the total cost is divided among the retail stores so that their incentives can be appropriately captured and thus efficient operations can be achieved. Under various conditions, we prove that there is a fair allocation of costs among the retail stores in the sense that no subset of retail stores subsidizes others, or equivalently, the resulting capacity investment game has a nonempty core, that is, the capacity investment game is a balanced game. In addition, our proof provides a mechanism to compute a fair cost allocation. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 512–523, 2013 相似文献
196.
层次分析法的水下航行器维修性指标分配方法 总被引:1,自引:0,他引:1
基于层次分析法的水下航行器维修性指标分配方法把层次分析法应用到水下航行器维修性指标分配方法中,即邀请专家对故障的检测和隔离方式、可达性、可更换性和测试的困难等级进行两两比较,得到评价矩阵,据此,可以得到分配结果.这种方法克服了按故障率和设计特性分配法在设计特性相差不大时存在的缺陷,把定性分析与定量分析相结合.在设计初期即明确设计目标,除了考虑到单元的故障率还兼顾了初期设计过程中的不确定性.将这种方法应用于某水下航行器的维修性分配,结果表明,该方法具有实用价值. 相似文献
197.
Sven Axsäter 《海军后勤学研究》2007,54(5):485-491
A two‐echelon distribution inventory system with a central warehouse and a number of retailers is considered. The retailers face stochastic demand and replenish from the warehouse, which, in turn, replenishes from an outside supplier. The system is reviewed continuously and demands that cannot be met directly are backordered. Standard holding and backorder costs are considered. In the literature on multi‐echelon inventory control it is standard to assume that backorders at the warehouse are served according to a first come–first served policy (FCFS). This allocation rule simplifies the analysis but is normally not optimal. It is shown that the FCFS rule can, in the worst case, lead to an asymptotically unbounded relative cost increase as the number of retailers approaches infinity. We also provide a new heuristic that will always give a reduction of the expected costs. A numerical study indicates that the average cost reduction when using the heuristic is about two percent. The suggested heuristic is also compared with two existing heuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
198.
199.
Hadas Shabtay 《Defence and Peace Economics》2014,25(5):461-480
This study presents a framework and models for the analysis of government budget allocation into defense and civilian expenditures in situations of uncertainty about the incidence of war. The models display the intricate relationships between security levels, subjective probabilities of the occurrence of war, and potential war damages. We show that poor countries tend to perceive greater probabilities of war than their richer rivals, and that the psychological burden of insecurity is larger when the country’s wealth is larger and when its preference for security is higher. We apply our models to the Israeli–Syrian arms race and show that the higher rate of growth of Israel’s gross domestic product relative to that of Syria is expected to lead to an increase in Syria’s perception of the likelihood of war and to a decrease in Israel’s perception of such a likelihood. We also show that if Syria’s regime becomes ideologically more extreme, the monetary cost of maintaining Israel’s security at the level that it enjoyed prior to the change will be very high, whereas the monetary cost of maintaining Israel’s welfare will be moderate. 相似文献
200.
战时弹药供应协同调运模型研究 总被引:1,自引:0,他引:1
弹药协同调运是战时弹药保障工作中的重要环节,其协同调运的合理性将直接影响到弹药保障工作的顺利进行.针对弹药的调运问题,从战时技术实施与应用角度研究弹药的调运问题,以到达需求点的运输时间、弹药输送车数量以及弹药损失量为优化目标,建立一种多目标决策模型,为缩短运输时间、减少弹药输送车数量、提高安全到达需求点的弹药量提供一种实用的方法. 相似文献