全文获取类型
收费全文 | 155篇 |
免费 | 61篇 |
国内免费 | 4篇 |
出版年
2021年 | 6篇 |
2020年 | 7篇 |
2019年 | 8篇 |
2018年 | 2篇 |
2017年 | 7篇 |
2016年 | 11篇 |
2015年 | 11篇 |
2014年 | 11篇 |
2013年 | 5篇 |
2012年 | 13篇 |
2011年 | 20篇 |
2010年 | 7篇 |
2009年 | 12篇 |
2008年 | 9篇 |
2007年 | 10篇 |
2006年 | 12篇 |
2005年 | 12篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 7篇 |
2001年 | 10篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有220条查询结果,搜索用时 203 毫秒
211.
In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015 相似文献
212.
The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015 相似文献
213.
剩余寿命预测是视情维修决策的重点和难点.针对工程实践中历史数据少、模型参数估计精度低的问题,建立一种基于随机滤波(SF)的齿轮箱剩余寿命预测模型.该方法采用递归期望最大化(REM)算法对模型参数进行递归更新,推导极大似然估计方法的参数递归更新过程,最后经实例验证模型的有效性和实用性. 相似文献
214.
Petter Holme 《后勤工程学院学报》2014,(3):1-7
Network epidemiology has become a core framework for investigating the role of human contact patterns in the spreadingof infectious diseases. In network epidemiology, one represents the contact structure as a network of nodes(individuals) connected bylinks(sometimes as a temporal network where the links are not continuously active) and the disease as a compartmental model(whereindividuals are assigned states with respect to the disease and follow certain transition rules between the states). In this paper, we discussfast algorithms for such simulations and also compare two commonly used versions,one where there is a constant recovery rate(the numberof individuals that stop being infectious per time is proportional to the number of such people);the other where the duration of the diseaseis constant. The results show that, for most practical purposes, these versions are qualitatively the same. 相似文献
215.
研究一类具有分布时滞和反应扩散的随机细胞神经网络的稳定性。通过构造Lyapunov泛函,并利用It公式、半鞅收敛定理以及不等式技巧,得到了系统几乎必然指数稳定的充分条件。 相似文献
216.
We give necessary and sufficient conditions based on signatures to obtain distribution‐free stochastic ordering properties for coherent systems with exchangeable components. Specifically, we consider the stochastic, the hazard (failure) rate, the reversed hazard rate, and the likelihood ratio orders. We apply these results to obtain stochastic ordering properties for all the coherent systems with five or less exchangeable components. Our results extend some preceding results. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
217.
雷达对地面目标的搜索效能是直升机对地作战效能评估的基础,建立雷达对地面目标搜索的数学模型,并分析几个因素对发现目标概率的影响,以及提高目标发现概率的方法,进而提高直升机的作战效能.模型有效地提高了雷达探测地面目标效能评估的准确性,对于指挥决策部门和设计单位有一定的参考意义. 相似文献
218.
219.
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 相似文献
220.
Designing Code Division Multiple Access networks includes determining optimal locations of radio towers and assigning customer markets to the towers. In this paper, we describe a deterministic model for tower location and a stochastic model to optimize revenue given a set of constructed towers. We integrate these models in a stochastic integer programming problem with simple recourse that optimizes the location of towers under demand uncertainty. We develop algorithms using Benders' reformulation, and we provide computational results. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献