全文获取类型
收费全文 | 563篇 |
免费 | 68篇 |
国内免费 | 3篇 |
出版年
2022年 | 5篇 |
2021年 | 12篇 |
2020年 | 6篇 |
2019年 | 8篇 |
2017年 | 13篇 |
2016年 | 11篇 |
2015年 | 16篇 |
2014年 | 12篇 |
2013年 | 122篇 |
2012年 | 18篇 |
2011年 | 14篇 |
2010年 | 24篇 |
2009年 | 13篇 |
2008年 | 23篇 |
2007年 | 12篇 |
2006年 | 7篇 |
2005年 | 8篇 |
2004年 | 11篇 |
2003年 | 6篇 |
2001年 | 8篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 11篇 |
1997年 | 17篇 |
1996年 | 18篇 |
1995年 | 18篇 |
1994年 | 14篇 |
1993年 | 13篇 |
1992年 | 12篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1988年 | 5篇 |
1986年 | 10篇 |
1985年 | 9篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1980年 | 6篇 |
1979年 | 7篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 6篇 |
1974年 | 5篇 |
1973年 | 7篇 |
1972年 | 9篇 |
1971年 | 9篇 |
1970年 | 6篇 |
1969年 | 8篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 5篇 |
排序方式: 共有634条查询结果,搜索用时 15 毫秒
101.
Richard B. White 《The Nonproliferation Review》2014,21(3-4):261-274
The Indian government has not made a public comment about the status of its nuclear weapon program since approving a nuclear doctrine in 2003. However, there is now enough information in the public domain to determine that the command-and-control system for the nuclear program has steadily matured in accordance with the intent of the approved nuclear doctrine. The Indian government has successfully mitigated many of the issues that plague the conventional military. The result is a basic command-and-control system that is focused only on the delivery, if ordered by the prime minister, of nuclear weapons. The system is not as robust as those of the United States and Russia, but is in place and ready as new Indian nuclear weapons enter into operation. The command-and-control system is developing to meet India's needs and political compulsions, but not necessarily as part of a more assertive nuclear policy. 相似文献
102.
103.
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. 相似文献
104.
The use of a single vendor for each inventoried item is usually assumed in most of the inventory models. However, there are situations where the use of more than one vendor should be considered, especially when lead times are stochastic. This research presents a theoretical investigation of the effect of cost structures on the relative performance of sole-sourcing versus dual-sourcing inventory control policies. We show that except for cases where the ordering cost is high, the lead-time variability is low, or the customer service level is low, dual sourcing performs better than sole sourcing under the normally distributed demand and shifted-exponential lead times. Moreover, the computational results indicate the dual sourcing provides a better service level than sole sourcing at the optimal solutions, and that dual sourcing results in larger order quantities than sole sourcing, which suggests that attractive quantity discounts may not be in jeopardy when dual sourcing is employed. Finally, because it is generally known that multiple sourcing can enhance the competition among suppliers, material managers should consider splitting purchase orders when two equally qualified suppliers are available. © 1994 John Wiley & Sons, Inc. 相似文献
105.
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. 相似文献
106.
John W. Chinneck 《海军后勤学研究》1992,39(4):531-543
Nonviable network models have edges which are forced to zero flow simply by the pattern of interconnection of the nodes. The original nonviability diagnosis algorithm [4] is extended here to cover all classes of network models, including pure, generalized, pure processing, nonconserving processing, and generalized processing. The extended algorithm relies on the conversion of all network forms to a pure processing form. Efficiency improvements to the original algorithm are also presented. 相似文献
107.
This article details several procedures for using path control variates to improve the accuracy of simulation-based point and confidence-interval estimators of the mean completion time of a stochastic activity network (SAN). Because each path control variate is the duration of the corresponding directed path in the network from the source to the sink, the vector of selected path controls has both a known mean and a known covariance matrix. This information is incorporated into estimation procedures for both normal and nonnormal responses. To evaluate the performance of these procedures experimentally, we examine the bias, variance, and mean square error of the controlled point estimators as well as the average half-length and coverage probability of the corresponding confidence-interval estimators for a set of SANs in which the following characteristics are systematically varied: (a) the size of the network (number of nodes and arcs); (b) the topology of the network; (c) the percentage of activities with exponentially distributed durations; and (d) the relative dominance of the critical path. The experimental results show that although large improvements in accuracy can be achieved with some of these procedures, the confidence-interval estimators for normal responses may suffer serious loss of coverage probability in some applications. 相似文献
108.
109.
110.
We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献