全文获取类型
收费全文 | 1352篇 |
免费 | 30篇 |
出版年
2021年 | 18篇 |
2019年 | 39篇 |
2018年 | 22篇 |
2017年 | 35篇 |
2016年 | 30篇 |
2015年 | 32篇 |
2014年 | 25篇 |
2013年 | 266篇 |
2010年 | 15篇 |
2009年 | 17篇 |
2007年 | 17篇 |
2006年 | 17篇 |
2005年 | 22篇 |
2004年 | 25篇 |
2003年 | 14篇 |
2002年 | 16篇 |
2000年 | 18篇 |
1999年 | 14篇 |
1998年 | 21篇 |
1997年 | 28篇 |
1996年 | 26篇 |
1995年 | 11篇 |
1994年 | 29篇 |
1993年 | 20篇 |
1992年 | 18篇 |
1991年 | 30篇 |
1990年 | 18篇 |
1989年 | 30篇 |
1988年 | 24篇 |
1987年 | 28篇 |
1986年 | 31篇 |
1985年 | 26篇 |
1984年 | 19篇 |
1983年 | 20篇 |
1982年 | 18篇 |
1981年 | 18篇 |
1980年 | 20篇 |
1979年 | 22篇 |
1978年 | 21篇 |
1977年 | 17篇 |
1976年 | 21篇 |
1975年 | 15篇 |
1974年 | 23篇 |
1973年 | 23篇 |
1972年 | 21篇 |
1971年 | 22篇 |
1970年 | 16篇 |
1969年 | 16篇 |
1968年 | 14篇 |
1967年 | 14篇 |
排序方式: 共有1382条查询结果,搜索用时 15 毫秒
101.
In this article we investigate situations where the buyer is offered discounted price schedules from alternative vendors. Given various discount schedules, the buyer must make the best buying decision under a variety of constraints, such as limited storage space and restricted inventory budgets. Solutions to this problem can be utilized by the buyer to improve profitability. EOQ models for multiple products with all-units discounts are readily solvable in the absence of constraints spanning the products. However, constrained discounted EOQ models lack convenient mathematical properties. Relaxing the product-spanning constraints produces a dual problem that is separable, but lack of convexity and smoothness opens the door for duality gaps. In this research we present a set of algorithms that collectively find the optimal order vector. Finally, we present numerical examples using actual data. to illustrate the application of the algorithms. © 1993 John Wiley & Sons, Inc. 相似文献
102.
In this article we consider a project scheduling problem where there are cash flows throughout the life of the project and where shorter activity durations can be attained by incurring greater direct costs. In particular, the objective of this problem is to determine the activity durations and a schedule of activity start times so that the net present value of cash flows is maximized. We formulate this problem as a mixed-integer nonlinear program which is amenable to solution using the generalized Benders decomposition technique developed by Geoffrion. We test the algorithm on 140 project scheduling problems, the largest of which contains 30 nodes and 64 activities. Our computational results are quite encouraging inasmuch as 123 of the 140 problems require less than 1 CPU second of solution time. © 1993 John Wiley & Sons, Inc. 相似文献
103.
This article introduces a new conceptual and methodological framework for the use of decision makers and their interactions with the computer in bicriterion decision making. The new method, called the multirun interactive method, attempts to estimate the prior of the decision maker on his uncertain preference nature using the minimum cross-entropy principle. A computational study is performed with four hypothesized prior distributions under various interaction conditions. Other important aspects related to the method, such as implementation of the method, decision making under certainty, decision making with multiple decision makers, and bicriterion integer programming, are also discussed. 相似文献
104.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans. 相似文献
105.
We present a new approach for inference from accelerated life tests. Our approach is based on a dynamic general linear model setup which arises naturally from the accelerated life-testing problem and uses linear Bayesian methods for inference. The advantage of the procedure is that it does not require large numbers of items to be tested and that it can deal with both censored and uncensored data. We illustrate the use of our approach with some actual accelerated life-test data. © 1992 John Wiley & Sons, Inc. 相似文献
106.
We consider a system of N (nonsymmetric) machine centers of the K-out-of-M : G type that are maintained by a single repairman. [A machine center functions if and only if at least K of the M machines belonging to the center are good (G).] Such systems are commonly found in various manufacturing and service industries. A stochastic model is developed that accommodates generally distributed repair times and repairman walk times, and most repair scheduling disciplines. K-out-of-M : G type systems also appear as a modeling paradigm in reliability analysis and polling systems performance analysis. Several performance measures are derived for machine-repair systems having K-out-of-M-type centers. A simple example system is developed in detail that exposes the computations involved in modeling applications. © 1992 John Wiley & Sons, Inc. 相似文献
107.
Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs. 相似文献
108.
In this article a bicriteria model, formed by the weighted sum of the minisum and minimax functions for a single-location problem, is investigated. It is shown that all efficient solutions generated by either constrained model are also properly efficient. The bicriteria model and the constrained models are theoretically equivalent, but it is more efficient and simpler to generate nondominated solutions using the constrained criterion approach. When solving the bicriteria model, a critical range is found for which all properly efficient solutions are generated. 相似文献
109.
In sensitivity testing for the Department of Defense, the high cost of experimental units necessitates the use of small sample sizes and accentuates the importance of design. This article compares five data collection-estimation procedures. Four of these are modifications of the Robbins-Monro method, and the other is the Langlie. The simulation study is designed as a factorial experiment with response function, sample size, initial design point, gate width, and noise as factors. The estimated V50 and its MSE are the responses compared to assess the small sample behavior of each method. Although there is no single clear-cut winner, the Delayed Robbins-Monro (DRM) with maximum likelihood estimation and the Estimated Quantal Response Curve (Wu [21]) are shown to perform well over a broad variety of conditions. 相似文献
110.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献