全文获取类型
收费全文 | 243篇 |
免费 | 12篇 |
出版年
2021年 | 9篇 |
2019年 | 3篇 |
2018年 | 6篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 8篇 |
2013年 | 47篇 |
2012年 | 4篇 |
2011年 | 2篇 |
2010年 | 3篇 |
2009年 | 10篇 |
2008年 | 3篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 7篇 |
2001年 | 5篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1975年 | 2篇 |
1974年 | 2篇 |
1973年 | 4篇 |
1972年 | 2篇 |
1971年 | 2篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 2篇 |
排序方式: 共有255条查询结果,搜索用时 15 毫秒
21.
22.
We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
23.
We consider the problem of assigning alternatives evaluated on several criteria into ordered categories C1,C2,…,Cp. This problem is known as the multi‐criteria sorting problem and arises in many situations such as classifying countries into different risk levels based on economical and socio‐political criteria, evaluating credit applications of bank customers. We are interested in sorting methods that are grounded on the construction of outranking relations. Among these, the Electre Tri method requires defining multidimensional profiles that represent the “frontier” separating consecutive categories Ch and Ch+1, and assigns an alternative to categories according to how it compares to each of the profiles. The explicit specification of the profiles of consecutive categories can be difficult for decision makers. We develop a new outranking based sorting method that does not require the explicit definition of profiles. We instead require the decision maker to assign a subset of reference alternatives to the categories. To assign the remaining alternatives, each such alternative is compared to reference alternatives, and assigned to categories accordingly. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
24.
The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
25.
Finding all nondominated vectors for multi‐objective combinatorial optimization (MOCO) problems is computationally very hard in general. We approximate the nondominated frontiers of MOCO problems by fitting smooth hypersurfaces. For a given problem, we fit the hypersurface using a single nondominated reference vector. We experiment with different types of MOCO problems and demonstrate that in all cases the fitted hypersurfaces approximate all nondominated vectors well. We discuss that such an approximation is useful to find the neighborhood of preferred regions of the nondominated vectors with very little computational effort. Further computational effort can then be spent in the identified region to find the actual nondominated vectors the decision maker will prefer. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
26.
27.
We study the (s,S) inventory system in which the server takes a rest when the level of the inventory is zero. The demands are assumed to occur for one unit at a time. The interoccurrence times between successive demands, the lead times, and the rest times are assumed to follow general distributions which are mutually independent. Using renewal and convolution techniques we obtain the state transition probabilities. 相似文献
28.
29.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
30.
针对非线性非高斯导航系统信息处理问题,采用自组织算法、神经网络和遗传算法等改进传统非线性Kalman滤波算法,构建一种自适应的组合导航系统。应用具有冗余趋势项的自组织算法、Volterra神经网络和遗传算法,建立导航系统误差的非线性预测模型,进而计算得到其预测值;将该预测值与Kalman滤波算法求得的估计值进行比较得到差值,以此监测Kalman滤波算法的工作状态;采用自适应控制方法,在导航系统结构层面改进Kalman滤波算法,构建新型的导航系统误差补偿模型。开展基于导航系统KIND-34的半实物仿真研究,应用所提出的改进方法改善了导航系统误差的补偿效果,提高了组合导航系统的自适应能力和容错能力。 相似文献