全文获取类型
收费全文 | 461篇 |
免费 | 11篇 |
国内免费 | 1篇 |
出版年
2019年 | 10篇 |
2018年 | 14篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 3篇 |
2014年 | 10篇 |
2013年 | 122篇 |
2012年 | 5篇 |
2010年 | 9篇 |
2007年 | 6篇 |
2005年 | 10篇 |
2004年 | 5篇 |
2003年 | 7篇 |
2002年 | 12篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 8篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 10篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 10篇 |
1990年 | 9篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 10篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 6篇 |
1973年 | 4篇 |
1972年 | 6篇 |
1971年 | 4篇 |
1970年 | 2篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 3篇 |
1966年 | 4篇 |
1948年 | 2篇 |
排序方式: 共有473条查询结果,搜索用时 62 毫秒
381.
We consider stochastic scheduling models which have the natural character that jobs improve while being processed, but deteriorate (and may possibly leave the system altogether) while processing is diverted elsewhere. Such restless bandit problems are shown to be indexable in the sense of Whittle. A numerical study which elucidates the strong performance of the resulting index policy is complemented by a theoretical study which demonstrates the optimality of the index policy under given conditions and which develops performance guarantees for the index heuristic more generally. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 706–721, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10036 相似文献
382.
John P. Sullivan 《Low Intensity Conflict & Law Enforcement》2002,11(2):239-253
The nature of crime and conflict is rapidly evolving. Postmodern war is increasingly influenced by non-traditional and irregular combatants: non-state soldiers. These actors are exploiting technology and networked doctrine to spread their influence across traditional geographic boundaries. This emphasis on non-traditional actors accompanies a shift in political and social organization. This shift may well be a shift in state form: from nation-state to market-state. This transition is fueled by rapid developments in technology and the adoption of network organizational forms. Conflict during this transition blurs the distinctions between and among crime, terrorism and warfare. This essay explores the dynamics of terrorism, crime and private armies during this epochal shift. 相似文献
383.
In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048 相似文献
384.
385.
Previous studies criticize the general use of the normal approximation of lead-time demand on the grounds that it can lead to serious errors in safety stock. We reexamine this issue for the distribution of fast-moving finished goods. We first determine the optimal reorder points and quantities by using the classical normal-approximation method and a theoretically correct procedure. We then evaluate the misspecification error of the normal approximation solution with respect to safety stock, logistics-system costs, total costs (logistics costs, including acquisition costs), and fill rates. The results provide evidence that the normal approximation is robust with respect to both cost and service for seven major industry groups. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 165–186, 1997 相似文献
386.
387.
The minimum makespan of the general parallel machine scheduling problem with m machines and n jobs is studied. As for a number of other important combinatorial problems, the theory of empirical processes proves to be a very elegant and powerful tool for the probabilistic analysis of the solution value. It is used in this paper to derive a scheduling constant θ such that, for random processing times, the minimum makespan almost surely grows as θn when n goes to infinity. Moreover, a thorough probabilistic analysis is performed on the difference between the minimum makespan and θn. Explicit expressions for the scheduling constant are given for an arbitrary number of unrelated machines with identically distributed processing times (with an increasing failure rate), and for an arbitrary number of uniform machines and generally distributed processing times. © 1996 John Wiley & Sons, Inc. 相似文献
388.
We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
389.
针对ATML标准中诊断信息描述一致性问题,提出了基于STEP的AI—ESTATE数据类型转换方法。首先介绍了ATML中诊断信息的描述标准,其次分析了AI—ESTATE信息描述的转换方法,然后应用STEP28针对CEM存在的数据类型进行了EXPRESS-XML匹配结构和功能结构一致性研究,最后建立了CEM典型数据类型的XML标准化描述。 相似文献
390.