全文获取类型
收费全文 | 569篇 |
免费 | 8篇 |
出版年
2021年 | 7篇 |
2019年 | 8篇 |
2018年 | 11篇 |
2017年 | 7篇 |
2016年 | 14篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 132篇 |
2012年 | 5篇 |
2010年 | 4篇 |
2009年 | 5篇 |
2007年 | 12篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2003年 | 11篇 |
2002年 | 11篇 |
2000年 | 6篇 |
1999年 | 5篇 |
1998年 | 8篇 |
1997年 | 12篇 |
1996年 | 11篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 12篇 |
1990年 | 11篇 |
1989年 | 19篇 |
1988年 | 15篇 |
1987年 | 13篇 |
1986年 | 14篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 14篇 |
1977年 | 6篇 |
1976年 | 8篇 |
1975年 | 6篇 |
1974年 | 11篇 |
1973年 | 5篇 |
1972年 | 6篇 |
1971年 | 10篇 |
1970年 | 8篇 |
1969年 | 8篇 |
1967年 | 6篇 |
1948年 | 4篇 |
排序方式: 共有577条查询结果,搜索用时 15 毫秒
61.
We show the existence of a unique analytic single parameter limiting survival function arising from the repeated composition of a coherent structure as the number of components tends to infinity. Examples include the repeated composition process of the bridge structure. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
62.
The ability to effectively match supply and demand under uncertainty can result in significant revenue benefits in the airline industry. We study the benefits of a Demand Driven Swapping (DDS) approach that takes advantage of the flexibilities in the system and dynamically swaps aircraft as departures near and more accurate demand information is obtained. We analyze the effectiveness of different DDS strategies, characterized by their frequency (how often the swapping decision is revised), in hedging against demand uncertainty. Swapping aircraft several weeks prior to departures will not cause much disturbance to revenue management and operations, but will be based on highly uncertain demands. On the other hand, revising the swapping decision later will decrease the possibility of bad swaps, but at a higher cost of disrupting airport services and operations. Our objective is to provide guidelines on how the flexible (swappable) capacity should be managed in the system. We study analytical models to gain insights into the critical parameters that affect the revenue benefits of the different swapping strategies. Our study determines the conditions under which each of the different DDS strategies is effective. We complement our analysis by testing the proposed DDS strategies on a set of flight legs, using data obtained from United Airlines. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
63.
64.
65.
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. 相似文献
66.
Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the corresponding three machine flow shop problem. Since that time, six other special cases have been solved, two contributed by Arthanari and Mukhopadhyay [1], two by Smith, Panwalkar, and Dudek [3], and two of a different nature by Szwarc [5]. This paper contributes an extension to one of the classes described by Szwarc. 相似文献
67.
This article is concerned with the optimal location of any number (n) of facilities in relation to any number (m) of destinations on the Euclidean plane. The criterion to be satisfied is the minimization of total weighted distances where the distances are rectangular. The destinations may be either single points, lines or rectangular areas. A gradient reduction solution procedure is described which has the property that the direction of descent is determined by the geometrical properties of the problem. 相似文献
68.
Hakimi has considered the problem of finding an optimal location for a single service center, such as a hospital or a police station. He used a graph theoretic model to represent the region being serviced. The communities are represented by the nodes while the road network is represented by the ares of the graph. In his work, the objective is one of minimizing the maximum of the shortest distances between the vertices and the service center. In the present work, the region being serviced is represented by a convex polygon and communities are spread over the entire region. The objective is to minimize the maximum of Euclidian distances between the service center and any point in the polygon. Two methods of solution presented are (i) a geometric method, and (ii) a quadratic programming formulation. Of these, the geometric method is simpler and more efficient. It is seen that for a class of problems, the geometric method is well suited and very efficient while the graph theoretic method, in general, will give only approximate solutions in spite of the increased efforts involved. But, for a different class of problems, the graph theoretic approach will be more appropriate while the geometric method will provide only approximate solutions though with ease. Finally, some feasible applications of importance are outlined and a few meaningful extensions are indicated. 相似文献
69.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
70.
In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure. © 1997 John Wiley & Sons, Inc. 相似文献