全文获取类型
收费全文 | 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条查询结果,搜索用时 15 毫秒
21.
This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc. 相似文献
22.
A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher must choose one cell in which to search in each time period. The set of cells available for search depends upon the cell chosen in the last time period. The problem is to find a search path, i.e., a sequence of search cells, that either maximizes the probability of detection or minimizes the mean number of time periods required for detection. The search problem is modelled as a partially observable Markov decision process and several approximate solutions procedures are proposed. © 1995 John Wiley & Sons, Inc. 相似文献
23.
Until only recently, the mechanism behind determining item price has been ignored and the discount price taken as a given in quantity-discount inventory decision problems. Inventory subject to declining demand further complicates both pricing and replenishment decisions. This article provides the vendor with the means for optimally determining both the discount price and replenishment order frequency for all buyers in the system in an environment of declining demand. In the multiple-buyer case, we provide an efficient algorithm for classifying buyers into homogeneous subgroups to further enhance joint cost savings among all system participants. 相似文献
24.
25.
Let p(⩾0.5) denote the probability that team A beats B in a single game. The series continues until either A or B wins n games. Assuming that these games are independent replications, we study some features of the distribution of Xn, the number of games played in the series. It is shown that Xn is unimodal, has an IFRA distribution, and is stochastically decreasing in p. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum-likelihood estimator of p based on Xn is unique. 相似文献
26.
Boland, Proschan, and Tong [2] used the notion of criticality of nodes in a coherent system to study the optimal component arrangement of reliability structures. They also provided a sufficient minimal cut (path) based criterion for verifying the criticality ordering of two nodes. We develop a necessary and sufficient condition for two nodes to be comparable and provide specific examples illustrating our result's applicability. As a corollary, certain optimal arrangement properties of well-known systems are derived. © 1994 John Wiley & Sons, Inc. 相似文献
27.
Let Yi ∽ N(θi, σ), i = 1, …, p, be independently distributed, where θi and σ are unknown. A Bayesian approach is used to estimate the first two moments of the minimum order statistic, W = min (Y1, …, Yp). In order to compute the Bayes estimates, one has to evaluate the predictive densities of the Yi's conditional on past data. Although the required predictive densities are complicated in form, an efficient algorithm to calculate them has been developed and given in the article. An application of the Bayesian method in a continuous-review control model with multiple suppliers is discussed. © 1994 John Wiley & Sons, Inc. 相似文献
28.
AbstractThe Military Compensation and Retirement Modernization Commission was established by the Congress in 2013 to perform a systematic review of military compensation to address rising costs and other trends. Their recommendation for reforming the TRICARE health care program was sweeping, and differed greatly from earlier proposals that focused on increasing beneficiary cost shares. Specifically, the commission proposed overhauling the current benefit delivery model and replacing it with a premium-based insurance model offering a menu of DoD-sponsored private health plans. The analysis presented here is based on work that supported the commission by estimating the budgetary impact of its proposed reforms. Results indicate that movement towards the premium-based model would produce an annual budgetary cost savings in the $2 billion to $4 billion range, with a best savings estimate of $3.2 billion. 相似文献
29.
The present article discusses the properties of the mean residual life function in a renewal process. We examine the relationship this function has with the failure rate function and the conventional mean, variance and coefficient of variation of residual life. We also discuss some monotonicity properties of the mean residual life function. A partial order based on the renewal mean residual function is introduced along with its interrelationship with some existing stochastic orders. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
30.
We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献