全文获取类型
收费全文 | 671篇 |
免费 | 18篇 |
国内免费 | 1篇 |
出版年
2021年 | 15篇 |
2019年 | 16篇 |
2018年 | 7篇 |
2017年 | 11篇 |
2016年 | 8篇 |
2015年 | 15篇 |
2014年 | 13篇 |
2013年 | 111篇 |
2009年 | 8篇 |
2008年 | 14篇 |
2006年 | 10篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 6篇 |
2002年 | 9篇 |
2001年 | 11篇 |
2000年 | 7篇 |
1998年 | 15篇 |
1997年 | 12篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 10篇 |
1993年 | 13篇 |
1992年 | 14篇 |
1991年 | 16篇 |
1990年 | 10篇 |
1989年 | 13篇 |
1988年 | 22篇 |
1987年 | 13篇 |
1986年 | 21篇 |
1985年 | 15篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 11篇 |
1980年 | 14篇 |
1979年 | 15篇 |
1978年 | 13篇 |
1977年 | 11篇 |
1976年 | 7篇 |
1975年 | 14篇 |
1974年 | 11篇 |
1973年 | 7篇 |
1972年 | 10篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 10篇 |
1968年 | 7篇 |
1967年 | 6篇 |
1966年 | 8篇 |
排序方式: 共有690条查询结果,搜索用时 31 毫秒
601.
We introduce an algorithm, called TMO (Two-Machine Optimal Scheduling) which minimizes the makespan for two identical processors. TMO employs lexicographic search in conjunction with the longest-processing time sequence to derive an optimal schedule. For the m identical parallel processors problem, we propose an improvement algorithm, which improves the seed solution obtained by any existing heuristic. The improvement algorithm, called Extended TMO, breaks the original m-machine problem into a set of two-machine problems and solves them repeatedly by the TMO. A simulation study is performed to evaluate the effectiveness of the proposed algorithms by comparing it against three existing heuristics: LPT (Graham, [11]), MULTIFIT (Coffman, Garey, and Johnson, [6]), and RMG (Lee and Massey, [17]). The simulation results show that: for the two processors case, the TMO performs significantly better than LPT, MULTIFIT, and RMG, and it generally takes considerably less CPU time than MULTIFIT and RMG. For the general parallel processors case, the Extended TMO algorithm is shown to be capable of greatly improving any seed solution. © 1995 John Wiley & Sons, Inc. 相似文献
602.
Economic screening procedures using a correlated variable are developed for selecting markets in situations when there are several markets with different profit/ cost structures. It is assumed that the performance variable and the screening variable are jointly normally distributed. Profit models are constructed which involve three profit/cost components: profit from a conforming item, cost from an accepted nonconforming item, and screening inspection cost. Methods of finding the optimal screening procedures are presented and numerical examples are given. 相似文献
603.
We consider a device that deteriorates over time according to a Markov process so that the failure rate at each state is constant. The reliability of the device is characterized by a Markov renewal equation, and an IFRA (increasing failure rate on average) property of the lifetime is obtained. The optimal replacement and repair problems are analyzed under various cost structures. Furthermore, intuitive and counterintuitive characterizations of the optimal policies and results on some interesting special problems are presented. © 1992 John Wiley & Sons, Inc. 相似文献
604.
K. D. Glazebrook 《海军后勤学研究》1992,39(5):613-633
N jobs are available for processing by a single machine. Jobs make (stochastic) progress while being processed but deteriorate while awaiting processing. The pioneering work of Browne and Yechiali, who developed scheduling policies for such models, is extended (i) to incorporate a precedence relation on the job set, delimiting the class of admissible policies, and (ii) to preemptive scheduling models. For the latter, we demonstrate that under appropriate conditions there is an optimal policy which is nonpreemptive. This is also achieved for a class of preemptive models in which processing generates delays for waiting jobs. A single class of algorithms is shown to generate optimal policies for many of the problems considered. © 1992 John Wiley & Sons, Inc. 相似文献
605.
We present an algorithm called the exact ceiling point algorithm (XCPA) for solving the pure, general integer linear programming problem (P). A recent report by the authors demonstrates that, if the set of feasible integer solutions for (P) is nonempty and bounded, all optimal solutions for (P) are “feasible 1-ceiling points,” roughly, feasible integer solutions lying on or near the boundary of the feasible region for the LP-relaxation associated with (P). Consequently, the XCPA solves (P) by implicitly enumerating only feasible 1-ceiling points, making use of conditional bounds and “double backtracking.” We discuss the results of computational testing on a set of 48 problems taken from the literature. 相似文献
606.
The bivariate negative binomial distribution of Mitchell and Paulson [17] for the case b = c = 0 is shown to be equivalent to the accident proneness model of Edwards and Gurland [4] and Subrahmaniam [19,20]. The diagonal series expansion of its joint probability function is then derived. Two other formulations of this distribution are also considered: (i) as a mixture model, which showed how it arises as the discrete analogue to the Wicksell-Kibble bivariate gamma distribution, and (ii) as a consequence of the linear birth-and-death process with immigration. 相似文献
607.
This article generalizes the classical dichotomic reliability model to include states of partial operation. The generalized model can be considered as a special case of a general jump process. Both continuous and discrete state spaces are included. The relationship to cumulative damage shock models is discussed. Properties of the model are investigated and these are illustrated via examples. The equivalence of three forms of component independence is proved, but this equivalence does not generalize to the property of zero covariance. Alternative forms of series and parallel connections and the effect of component replacement are discussed. 相似文献
608.
609.
Consider the following situation: Each of N different combat units is presented with a number of requirements to satisfy, each requirement being classified into one of K mutually exclusive categories. For each unit and each category, an estimate of the probability of that unit satisfying any requirement in that category is desired. The problem can be generally stated as that of estimating N different K-dimensional vectors of probabilities based upon a corresponding set of K-dimensional vectors of sample proportions. An empirical Bayes model is formulated and applied to an example from the Marine Corps Combat Readiness Evaluation System (MCCRES). The EM algorithm provides a convenient method of estimating the prior parameters. The Bayes estimates are compared to the ordinary estimates, i.e., the sample proportions, by means of cross validation, and the Bayes estimates are shown to provide considerable improvement. 相似文献
610.