全文获取类型
收费全文 | 377篇 |
免费 | 9篇 |
出版年
2021年 | 7篇 |
2020年 | 4篇 |
2019年 | 13篇 |
2018年 | 7篇 |
2017年 | 7篇 |
2015年 | 5篇 |
2014年 | 4篇 |
2013年 | 57篇 |
2010年 | 5篇 |
2009年 | 6篇 |
2008年 | 7篇 |
2007年 | 3篇 |
2005年 | 3篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 5篇 |
2001年 | 4篇 |
2000年 | 5篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 10篇 |
1995年 | 6篇 |
1994年 | 3篇 |
1993年 | 6篇 |
1992年 | 6篇 |
1991年 | 11篇 |
1990年 | 5篇 |
1989年 | 14篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 11篇 |
1985年 | 6篇 |
1984年 | 9篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1975年 | 6篇 |
1974年 | 6篇 |
1972年 | 4篇 |
1971年 | 8篇 |
1970年 | 6篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 6篇 |
排序方式: 共有386条查询结果,搜索用时 15 毫秒
111.
112.
In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
113.
Jeffrey D. Simon 《Defense & Security Analysis》1998,14(3):331-333
114.
K. D. Glazebrook 《海军后勤学研究》1984,31(2):251-264
A single machine is available to process a collection of stochastic jobs. There may be technological constraints on the job set. The machine sometimes breaks down. Costs are incurred and rewards are earned during processing. We seek strategies for processing the jobs which maximize the total expected reward earned. 相似文献
115.
D. Siegmund 《海军后勤学研究》1979,26(1):57-67
One-sided sequential tests for the mean of an exponential distribution are proposed, and the related confidence intervals are computed. The tests behave like the classical sequential probability-ration test when the mean is small and like a fixed-time test when the mean is large and accurate estimation is important. 相似文献
116.
A Markovian model is presented for the development of an optimal repair-replacement policy for the situation requiring a decision only at failure. The problem is characterized by the presence of growth which is integrated into the formulation. The model is applied to an actual problem, with data analysis and results given. Substantial savings are indicated. 相似文献
117.
Hanif D. Sherali 《海军后勤学研究》1981,28(3):447-462
In this paper we consider dual angular and angular structured mixed integer programs which arise in some practical applications. For these problems we describe efficient methods for generating a desirable set of Benders' cuts with which one may initialize the partitioning scheme of Benders. Our research is motivated by the computational experience of McDaniel and Devine who have shown that the set of Benders' cuts which are binding at the optimum to the linear relaxation of the mixed integer program, play an important role in determining an optimal mixed integer solution. As incidental results in our development, we provide some useful remarks regarding Benders' and Dantzig-Wolfe's decomposition procedures. The computational experience reported seems to support the expedients recommended in this paper. 相似文献
118.
This paper deals with the problem of scheduling items (tasks, employees, equipment, etc.) over a finite time horizon so as to minimize total cost expenditures while maintaining a predefined separation between certain items. The problem is cyclic, because the same schedule will be repeated over several consecutive time periods of equal length. Thus, requirements are present to maintain the separation of items not only within the individual time periods considered, but also between items in adjoining periods. A special purpose branch-and-bound algorithm is developed to solve this scheduling problem by taking advantage of its cyclic nature. Computational results are given. 相似文献
119.
This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. Sufficient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processing times. It is shown that when coefficient of variation of random processing times are bounded by a certain value, an optimal sequence is V-shaped. © 1997 John Wiley & Sons, Inc. 相似文献
120.
Ronald D. Fricker 《海军后勤学研究》1998,45(1):1-22
This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998 相似文献