全文获取类型
收费全文 | 564篇 |
免费 | 13篇 |
出版年
2021年 | 6篇 |
2019年 | 13篇 |
2018年 | 9篇 |
2017年 | 11篇 |
2016年 | 9篇 |
2015年 | 9篇 |
2014年 | 5篇 |
2013年 | 104篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2008年 | 10篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 12篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 5篇 |
2000年 | 7篇 |
1998年 | 7篇 |
1997年 | 6篇 |
1996年 | 17篇 |
1995年 | 7篇 |
1994年 | 9篇 |
1993年 | 7篇 |
1992年 | 10篇 |
1991年 | 18篇 |
1990年 | 6篇 |
1989年 | 12篇 |
1988年 | 11篇 |
1987年 | 14篇 |
1986年 | 16篇 |
1985年 | 18篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 12篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 9篇 |
1975年 | 7篇 |
1974年 | 8篇 |
1972年 | 11篇 |
1971年 | 12篇 |
1970年 | 11篇 |
1969年 | 8篇 |
1968年 | 9篇 |
1967年 | 9篇 |
1966年 | 9篇 |
排序方式: 共有577条查询结果,搜索用时 15 毫秒
181.
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110-problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non-continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc. 相似文献
182.
对设计加工研制的Tesla变压器,根据Smith建议的测量方法,解决了对紧凑Teala变压器耦合系数进行比较准确地测量的问题,实测耦合系数高达0.9,并对耦合系数稍低于理论设计值的原因进行了探讨,同时分析给出了物理原因.此外,根据Teala变压器电路在初次级初、次级短路和低电压充电情形下的实测电压波形,估算出Tesla变压器电路各参数数值.这些数值与理论计算值吻合,并能满足实际高压充电的要求. 相似文献
183.
Donald D. Eisenstein 《海军后勤学研究》2008,55(4):350-362
Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
184.
We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
185.
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
186.
187.
188.
It has been argued that the discovery of a new natural resource greatly increases the risk of conflict. This research aims to study the effect of natural resources on military spending, using the data from rentier states in the Middle East and North Africa (MENA) countries from 1987 to 2012. In considering the ‘resource curse,’ the types of natural resources matter. Our empirical results demonstrate that the ‘resource curse’ arising from the abundance of certain natural resources, particularly oil and forest resources, leads to increases in military spending. In contrast, the rent from coal and natural gas has a negative impact on military spending, while the rent from minerals has no impact on military spending, controlling for GDP growth and per capita income. 相似文献
189.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
190.
This article examines challenges in international nuclear safeguards pertaining to the timely detection of highly enriched uranium production at large-scale gas centrifuge enrichment plants. To establish where present gas centrifuge enrichment plant safeguards measures and approaches could be strengthened, we have created a discrete time model for simulating hypothetical misuse scenarios, both through transient phases and at steady-state. We find that timely detection of misuse at modern large-scale facilities presents a challenge for international safeguards. A toolbox of unattended measurement systems, along with remote monitoring, however, could be used to improve detection timeliness, enabling the initiation of follow-up activities, potentially on a rapid time scale. These measures, which would need very low false alarm rates, should be implemented in a graded approach, depending on the characteristics of each enrichment plant and an analysis of plausible acquisition paths for the State in which it is situated. Some of these technologies could provide significant benefit to plant operators. 相似文献