全文获取类型
收费全文 | 291篇 |
免费 | 10篇 |
出版年
2021年 | 11篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 5篇 |
2016年 | 4篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 39篇 |
2011年 | 3篇 |
2010年 | 3篇 |
2009年 | 10篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 7篇 |
2003年 | 2篇 |
2002年 | 9篇 |
2001年 | 5篇 |
2000年 | 5篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 8篇 |
1994年 | 3篇 |
1993年 | 5篇 |
1992年 | 4篇 |
1991年 | 8篇 |
1990年 | 4篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 11篇 |
1986年 | 8篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1974年 | 4篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 2篇 |
1970年 | 4篇 |
1969年 | 5篇 |
1968年 | 2篇 |
排序方式: 共有301条查询结果,搜索用时 109 毫秒
91.
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 相似文献
92.
We study the problem of capacity exchange between two firms in anticipation of the mismatch between demand and capacity, and its impact on firm's capacity investment decisions. For given capacity investment levels of the two firms, we demonstrate how capacity price may be determined and how much capacity should be exchanged when either manufacturer acts as a Stackelberg leader in the capacity exchange game. By benchmarking against the centralized system, we show that a side payment may be used to coordinate the capacity exchange decisions. We then study the firms' capacity investment decisions using a biform game framework in which capacity investment decisions are made individually and exchange decisions are made as in a centralized system. We demonstrate the existence and uniqueness of the Nash equilibrium capacity investment levels and study the impact of firms' share of the capacity exchange surplus on their capacity investment levels.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
93.
The subject of this note is the validity of the algorithm described by Aneja and Nair to solve the constrained shortest-path problem. 相似文献
94.
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. 相似文献
95.
A model is developed which may be used to determine the expected total cost of quality control per inspection lot under acceptance sampling by variables where several characteristics are to be simultaneously controlled. Optimization of the model is accomplished through the application of a conventional search procedure. The sensitivity of the model and the optimum solution to the shape of the underlying probability distributions is discussed and associated analyses are presented through an example. 相似文献
96.
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. 相似文献
97.
We consider optimal test plans involving life distributions with failure‐free life, i.e., where there is an unknown threshold parameter below which no failure will occur. These distributions do not satisfy the regularity conditions and thus the usual approach of using the Fisher information matrix to obtain an optimal accelerated life testing (ALT) plan cannot be applied. In this paper, we assume that lifetime follows a two‐parameter exponential distribution and the stress‐life relationship is given by the inverse power law model. Near‐optimal test plans for constant‐stress ALT under both failure‐censoring and time‐censoring are obtained. We first obtain unbiased estimates for the parameters and give the approximate variance of these estimates for both failure‐censored and time‐censored data. Using these results, the variance for the approximate unbiased estimate of a percentile at a design stress is computed and then minimized to produce the near‐optimal plan. Finally, a numerical example is presented together with simulation results to study the accuracy of the approximate variance given by the proposed plan and show that it outperforms the equal‐allocation plan. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 169–186, 1999 相似文献
98.
99.
100.
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource infeasibility. We use the 110-problem data set of Patterson to test our procedure. Our results indicate a significant improvement over the best heuristic results reported to date for these problems (Bell and Han [1]). Two major advantages of the local search algorithm are its ability to handle arbitrary objective functions and constraints and its effectiveness over a wide range of problem sizes. We present a problem example with an objective function and resource constraints which include nonlinear and non-continuous components, which are easily considered by the procedure. The results of our algorithm are significantly better than random solutions to the problem. © 1993 John Wiley & Sons, Inc. 相似文献