全文获取类型
收费全文 | 374篇 |
免费 | 9篇 |
专业分类
383篇 |
出版年
2021年 | 10篇 |
2019年 | 7篇 |
2018年 | 3篇 |
2017年 | 8篇 |
2016年 | 6篇 |
2015年 | 11篇 |
2014年 | 8篇 |
2013年 | 70篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2003年 | 2篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 7篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 14篇 |
1987年 | 6篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 2篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1967年 | 2篇 |
1966年 | 3篇 |
排序方式: 共有383条查询结果,搜索用时 6 毫秒
201.
S. S. Chitgopekar 《海军后勤学研究》1974,21(2):365-371
We consider the costly surveillance of a stochastic system with a finite state space and a finite number of actions in each state. There is a positive cost of observing the system and the system earns at a rate depending on the state of the system and the action taken. A policy for controlling such a system specifies the action to be taken and the time to the next observation, both possibly random and depending on the past history of the system. A form of the long range average income is the criterion for comparing different policies. If R Δ denotes the class of policies for which the times between successive observations of the system are random variables with cumulative distribution functions on [0, Δ], Δ < ∞, we show that there exists a nonrandomized stationary policy that is optimal in R Δ. Furthermore, for sufficiently large Δ, this optimal policy is independent of Δ. 相似文献
202.
The quadratic-assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch-and-bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is presented. 相似文献
203.
Kyung S. Park 《海军后勤学研究》1983,30(3):397-400
This article presents another inventory model for situations in which, during the stockout period, a fraction b of the demand is backordered and the remaining fraction 1 ? b is lost. By defining a time-proportional backorder cost and a fixed penalty cost per unit lost, a unimodal objective function representing the average annual cost of operating the inventory system is obtained. The optimal operating policy variables are calculated directly. 相似文献
204.
In this note the authors call for a change of the optimality criteria given by Theorem 3 in section 5 of the paper of W. Szwarc “On Some Sequencing Problems” in NRLQ Vol. 15, No. 2 [2]. Further, two cases of the three machine problem, namely, (i) ≦ and (ii) ≦ are considered, and procedures for obtaining optimal sequences in these cases are given. In these cases the three-machine problem is solved by solving n (the number of jobs) two-machine problems. 相似文献
205.
This paper addresses the problem of finding a feasible schedule of n jobs on m parallel machines, where each job has a deadline and some jobs are preassigned to some machine. This problem arises in the daily assignment of workload to a set of flight dispatchers, and it is strongly characterized by the fact that the job lengths may assume one out of k different values, for small k. We prove the problem to be NP‐complete for k = 2 and propose an effective implicit enumeration algorithm which allows efficiently solution a set of real‐life instances. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 359–376, 2000 相似文献
206.
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 相似文献
207.
We consider a software reliability model where the failure rate of each fault depends on the specific operation performed. The software is tested in a given sequence of test cases for fixed durations of time to collect data on failure times. We present a Bayesian analysis of software failure data by treating the initial number of faults as a random variable. Our analysis relies on the Markov Chain Monte Carlo methods and is used for developing optimal testing strategies in an adaptive manner. Two different models involving individual and common faults are analyzed. We illustrate an implementation of our approach by using some simulated failure data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:747–763, 2001 相似文献
208.
209.
210.