全文获取类型
收费全文 | 507篇 |
免费 | 13篇 |
出版年
2021年 | 11篇 |
2019年 | 24篇 |
2018年 | 12篇 |
2017年 | 11篇 |
2016年 | 13篇 |
2015年 | 13篇 |
2014年 | 12篇 |
2013年 | 103篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2008年 | 5篇 |
2007年 | 8篇 |
2006年 | 5篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 15篇 |
1996年 | 7篇 |
1994年 | 10篇 |
1992年 | 4篇 |
1991年 | 13篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 8篇 |
1987年 | 14篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 6篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 5篇 |
排序方式: 共有520条查询结果,搜索用时 15 毫秒
161.
We study the one-warehouse multi-retailer problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem into single-facility subproblems, then propose approximation algorithms by judiciously recombining the subproblem solutions. For piecewise linear concave batch order costs with a constant number of slopes we obtain a constant-factor approximation, while for general concave batch costs we propose an approximation within a logarithmic factor of optimality. We also extend some results to subadditive order and/or holding costs. 相似文献
162.
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 相似文献
163.
For various parameter combinations, the logistic–exponential survival distribution belongs to four common classes of survival distributions: increasing failure rate, decreasing failure rate, bathtub‐shaped failure rate, and upside‐down bathtub‐shaped failure rate. Graphical comparison of this new distribution with other common survival distributions is seen in a plot of the skewness versus the coefficient of variation. The distribution can be used as a survival model or as a device to determine the distribution class from which a particular data set is drawn. As the three‐parameter version is less mathematically tractable, our major results concern the two‐parameter version. Boundaries for the maximum likelihood estimators of the parameters are derived in this article. Also, a fixed‐point method to find the maximum likelihood estimators for complete and censored data sets has been developed. The two‐parameter and the three‐parameter versions of the logistic–exponential distribution are applied to two real‐life data sets. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
164.
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 相似文献
165.
Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003. 相似文献
166.
In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003 相似文献
167.
In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038 相似文献
168.
169.
AirSea Battle (ASB) has generated significant publicity, controversy, and debate among scholars, analysts, commentators, and observers of US defense strategy. However, a research gap exists concerning formal analysis of the impact of the operational concept on the relationship between the US Air Force (USAF) and the US Navy (USN). The impact of the ASB operational concept on the USAF–USN relationship is examined across the issue areas of strategy, budgets, weapons procurement, and training. These four issue areas represent important areas of historical conflict and competition between the Air Force and Navy. The conclusion is that ASB is ushering in a new era of Air Force–Navy partnership that advances the inter-service dynamic from “jointness” toward integration. The emergent USAF–USN partnership therefore represents a significant development in US defense politics and defense strategy. 相似文献
170.
The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017 相似文献