全文获取类型
收费全文 | 585篇 |
免费 | 16篇 |
出版年
2020年 | 9篇 |
2019年 | 11篇 |
2018年 | 7篇 |
2017年 | 17篇 |
2016年 | 13篇 |
2015年 | 11篇 |
2014年 | 10篇 |
2013年 | 127篇 |
2011年 | 7篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2007年 | 7篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 6篇 |
1999年 | 8篇 |
1998年 | 10篇 |
1997年 | 11篇 |
1996年 | 8篇 |
1995年 | 15篇 |
1994年 | 15篇 |
1993年 | 12篇 |
1992年 | 18篇 |
1991年 | 19篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 14篇 |
1984年 | 11篇 |
1983年 | 8篇 |
1982年 | 6篇 |
1981年 | 9篇 |
1980年 | 10篇 |
1979年 | 12篇 |
1978年 | 10篇 |
1977年 | 7篇 |
1976年 | 8篇 |
1975年 | 11篇 |
1974年 | 13篇 |
1973年 | 10篇 |
1972年 | 9篇 |
1971年 | 7篇 |
1970年 | 6篇 |
1969年 | 4篇 |
1968年 | 7篇 |
1967年 | 5篇 |
排序方式: 共有601条查询结果,搜索用时 218 毫秒
41.
Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
42.
This paper studies capacity expansions for a production facility that faces uncertain customer demand for a single product family. The capacity of the facility is modeled in three tiers, as follows. The first tier consists of a set of upper bounds on production that correspond to different resource types (e.g., machine types, categories of manpower, etc.). These upper bounds are augmented in increments of fixed size (e.g., by purchasing machines of standard types). There is a second‐tier resource that constrains the first‐tier bounds (e.g., clean room floor space). The third‐tier resource bounds the availability of the second‐tier resource (e.g., the total floor space enclosed by the building, land, etc.). The second and third‐tier resources are expanded at various times in various amounts. The cost of capacity expansion at each tier has both fixed and proportional elements. The lost sales cost is used as a measure for the level of customer service. The paper presents a polynomial time algorithm (FIFEX) to minimize the total cost by computing optimal expansion times and amounts for all three types of capacity jointly. It accommodates positive lead times for each type. Demand is assumed to be nondecreasing in a “weak” sense. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
43.
Timothy C. Barkdoll Donald P. Gaver Kevin D. Glazebrook Patricia A. Jacobs Sergio Posadas 《海军后勤学研究》2002,49(8):723-742
Blue strike aircraft enter region ? to attack Red targets. In Case 1, Blue conducts (preplanned) SEAD to establish air superiority. In the (reactive) SEAD scenario, which is Case 2, such superiority is already in place, but is jeopardized by prohibitive interference from Red, which threatens Blue's ability to conduct missions. We utilize both deterministic and stochastic models to explore optimal tactics for Red in such engagements. Policies are developed which will guide both Red's determination of the modes of operation of his engagement radar, and his choice of Blue opponent to target next. An index in the form of a simple transaction kill ratio plays a major role throughout. Published 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 723–742, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10046 相似文献
44.
Adam D. Bramoweth James Luther Barbara H. Hanusa Jon D. Walker Charles W. Atwood Jr. Anne Germain 《Defence and Peace Economics》2018,29(1):78-90
AbstractInsomnia is prevalent among Veterans with post-traumatic stress disorder (PTSD), it exacerbates PTSD symptoms, and it contributes to impaired functioning and quality of life. To improve treatment outcomes, it is important to identify risk factors for insomnia and sedative-hypnotic use. Classification and regression trees and logistic regression models were used to identify variables associated with insomnia or sedative-hypnotic use. Key findings include low insomnia diagnosis rates (3.5–5.6%) and high rates of sedative-hypnotics (44.2–49.0%). Younger Veterans and those without a breathing-related sleep disorder (BRSD) were more likely to receive an insomnia diagnosis. Veterans with greater service connection and those with an alcohol/substance use disorder were more likely to be prescribed sedative-hypnotics. Interaction terms may have identified potential groups at risk of being under-diagnosed with insomnia (i.e. non-black Veterans with psychiatric co-morbidity, black Veterans without psychiatric co-morbidity) as well as groups at risk for sedative-hypnotic use (i.e. younger Veterans without BRSD). In sum, Veterans with PTSD have high rates of sedative-hypnotic use despite minimal evidence they are effective. This is counter to recommendations indicating behavioral interventions are the first-line treatment. Policy changes are needed to reduce use of sedative-hypnotics and increase access to behavioral insomnia interventions. 相似文献
45.
Roger C. Schroeder 《海军后勤学研究》1974,21(3):375-388
Most inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results. 相似文献
46.
This paper presents a model for choosing a minimum-cost mix of strategic defenses to assure that specified production capacities for several economic sectors survive after a nuclear attack. The defender selects a mix of strategic defenses for each of several geographic regions. The attacker chooses an allocation of attacking weapons to geographic regions, within specified weapon inventories. The attack is optimized against any economic sector. This formulation allows the defense planner the capability to assess the results of the optimal defense structure for a “worst case” attack. The model is a mathematical program with nonlinear programming problems in the constraints; an example of its application is given and is solved using recently developed optimization techniques. 相似文献
47.
James G. Taylor 《海军后勤学研究》1974,21(1):79-106
The optimization of the dynamics of combat (optimal distribution of fire over enemy target types) is studied through a sequence of idealized models by use of the mathematical theory of optimal control. The models are for combat over a period of time described by Lanchester-type equations with a choice of tactics available to one side and subject to change with time. The structure of optimal fire distribution policies is discussed with reference to the influence of combatant objectives, termination conditions of the conflict, type of attrition process, and variable attrition-rate coefficients. Implications for intelligence, command and control systems, and human decision making are pointed out. The use of such optimal control models for guiding extensions to differential games is discussed. 相似文献
48.
A basic problem in scheduling involves the sequencing of a set of independent tasks at a single facility with the objective of minimizing mean tardiness. Although the problem is relatively simple, the determination of an optimal sequence remains a challenging combinatorial problem. A number of algorithms have been developed for finding solutions, and this paper reports a comparative evaluation of these procedures. Computer programs for five separate algorithms were written and all were run on a data base designed to highlight computational differences. Optimizing algorithms developed by Emmons and by Srinivasan appeared to be particularly efficient in the comparative study. 相似文献
49.
Least squares estimators of the parameters of the generalized Eyring Model are obtained by using data from censored life tests conducted at several accelerated environments. These estimators are obtained after establishing that the Gauss-Markov conditions for least squares estimation are satisfied. Confidence intervals for the hazard rate at use conditions are obtained after empirically showing that the logarithm of the estimate of the hazard rate at use conditions is approximately normally distributed. The coverage probabilities of the confidence intervals are also verified by a Monte Carlo experiment. The techniques are illustrated by an application to some real data. 相似文献
50.
A method is presented to locate and allocate p new facilities in relation to n existing facilities. Each of the n existing facilities has a requirement flow which must be supplied by the new facilities. Rectangular distances are assumed to exist between all facilities. The algorithm proceeds in two stages. In the first stage a set of all possible optimal new facility locations is determined by a set reduction algorithm. The resultant problem is shown to be equivalent to finding the p-median of a weighted connected graph. In the second stage the optimal locations and allocations are obtained by using a technique for solving the p-median problem. 相似文献