全文获取类型
收费全文 | 1062篇 |
免费 | 22篇 |
出版年
2021年 | 12篇 |
2019年 | 27篇 |
2018年 | 14篇 |
2017年 | 32篇 |
2016年 | 23篇 |
2015年 | 27篇 |
2014年 | 29篇 |
2013年 | 227篇 |
2010年 | 10篇 |
2009年 | 12篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 11篇 |
2005年 | 13篇 |
2004年 | 12篇 |
2002年 | 15篇 |
2001年 | 12篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 22篇 |
1997年 | 18篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 25篇 |
1993年 | 22篇 |
1992年 | 17篇 |
1991年 | 24篇 |
1990年 | 12篇 |
1989年 | 20篇 |
1988年 | 30篇 |
1987年 | 22篇 |
1986年 | 35篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 13篇 |
1981年 | 16篇 |
1980年 | 12篇 |
1979年 | 17篇 |
1978年 | 17篇 |
1977年 | 9篇 |
1976年 | 9篇 |
1975年 | 15篇 |
1974年 | 14篇 |
1973年 | 12篇 |
1972年 | 15篇 |
1971年 | 9篇 |
1970年 | 13篇 |
1969年 | 12篇 |
1967年 | 8篇 |
排序方式: 共有1084条查询结果,搜索用时 46 毫秒
71.
We model a two-echelon multi-indentured repairable-item inventory system where each “base” has a maximum number of identical online machines, and each machine consists of several module types. Machine failures are due to module failures and occur according to an exponential distribution. When a machine fails, the failed module is replaced by an identical spare module if one is available. Otherwise, the module is backordered. All failed modules go to a single “depot” repair facility which consists of a finite number of identical repairmen who are able to repair any module type in an exponentially distributed time, although the repair rates for different module types may differ. The principal contribution of this article is an approximation algorithm for calculating the steady-state characteristics of the system. In comparison with simulation results, the algorithm is quite accurate and computationally efficient. © 1993 John Wiley & Sons, Inc. 相似文献
72.
73.
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. 相似文献
74.
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. 相似文献
75.
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. 相似文献
76.
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. 相似文献
77.
This article considers the problem of equipment replacement in which the replacement decision at a particular time must take into account (i) the state of the existing machine in use, (ii) the available replacement alternatives at the time, (iii) the future advances in the relevant technologies with regard to the equipment under consideration, and (iv) costs of switching between different technologies. A methodology that attains minimal forecast horizons for the problem is developed. A numerical example illustrates the methodology. 相似文献
78.
The problem considered is that of finding the set of efficient sequences of jobs on a single machine with respect to the total flow time and the number of tardy jobs. We present some properties of an existing algorithm and the problem itself. 相似文献
79.
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. 相似文献
80.
This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc. 相似文献