全文获取类型
收费全文 | 207篇 |
免费 | 41篇 |
出版年
2021年 | 2篇 |
2019年 | 8篇 |
2018年 | 4篇 |
2017年 | 5篇 |
2016年 | 13篇 |
2015年 | 14篇 |
2014年 | 9篇 |
2013年 | 59篇 |
2012年 | 9篇 |
2011年 | 7篇 |
2010年 | 5篇 |
2009年 | 7篇 |
2008年 | 9篇 |
2007年 | 12篇 |
2006年 | 8篇 |
2005年 | 12篇 |
2004年 | 10篇 |
2003年 | 13篇 |
2002年 | 10篇 |
2001年 | 6篇 |
2000年 | 5篇 |
1999年 | 7篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 2篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 2篇 |
1981年 | 1篇 |
排序方式: 共有248条查询结果,搜索用时 78 毫秒
241.
We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
242.
This article studies the problem of designing Bayesian sampling plans (BSP) with interval censored samples. First, an algorithm for deriving the conventional BSP is proposed. The BSP is shown to possess some monotonicity. Based on the BSP and using the property of monotonicity, a new sampling plan modified by the curtailment procedure is proposed. The resulting curtailed Bayesian sampling plan (CBSP) can reduce the duration time of life test experiment, and it is optimal in the sense that its associated Bayes risk is smaller than the Bayes risk of the BSP if the cost of the duration time of life test experiment is considered. A numerical example to compute the Bayes risks of BSP and CBSP and related quantities is given. Also, a Monte Carlo simulation study is performed to illustrate the performance of the CBSP compared with the BSP. The simulation results demonstrate that our proposed CBSP has better performance because it has smaller risk. The CBSP is recommended. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 604–616, 2015 相似文献
243.
We apply dynamic proximity calculations (density and clustering) from dynamic computational geometry to a military application. The derived proximity information serves as an abstract view of a current situation in the battlefield that can help a military commander achieve situation awareness. We employ Delaunay triangulation as a computational tool in our framework, and study its dynamic update in depth. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
244.
We develop a simple, approximately optimal solution to a model with Erlang lead time and deterministic demand. The method is robust to misspecification of the lead time and has good accuracy. We compare our approximate solution to the optimal for the case where we have prior information on the lead‐time distribution, and another where we have no information, except for computer‐generated sample data. It turns out that our solution is as easy as the EOQ's, with an accuracy rate of 99.41% when prior information on the lead‐time distribution is available and 97.54–99.09% when only computer‐generated sample information is available. Apart from supplying the inventory practitioner with an easy heuristic, we gain insights into the efficacy of stochastic lead time models and how these could be used to find the cost and a near‐optimal policy for the general model, where both demand rate and lead time are stochastic. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
245.
This article analyzes a capacity/inventory planning problem with a one‐time uncertain demand. There is a long procurement leadtime, but as some partial demand information is revealed, the firm is allowed to cancel some of the original capacity reservation at a certain fee or sell off some inventory at a lower price. The problem can be viewed as a generalization of the classic newsvendor problem and can be found in many applications. One key observation of the analysis is that the dynamic programming formulation of the problem is closely related to a recursion that arises in the study of a far more complex system, a series inventory system with stochastic demand over an infinite horizon. Using this equivalence, we characterize the optimal policy and assess the value of the additional demand information. We also extend the analysis to a richer model of information. Here, demand is driven by an underlying Markov process, representing economic conditions, weather, market competition, and other environmental factors. Interestingly, under this more general model, the connection to the series inventory system is different. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 2012 相似文献
246.
The scan statistic based on likelihood ratios (LRs) have been widely discussed for detecting spatial clusters. When developing the scan statistic, it uses the maximum likelihood estimates of the incidence rates inside and outside candidate clusters to substitute the true values in the LR statistic. However, the parameter estimation has a significant impact on the sensitivity of the scan statistic, which favors the detection of clusters in areas with large population sizes. By presenting the effects of parameter estimation on Kulldorff's scan statistic, we suggest a standardized scan statistic for spatial cluster detection. Compared to the traditional scan statistic, the standardized scan statistic can account for the varying mean and variance of the LR statistic due to inhomogeneous background population sizes. Extensive simulations have been performed to compare the power of the two cluster detection methods with known or/and estimated parameters. The simulation results show that the standardization can help alleviate the effects of parameter estimation and improve the detection of localized clusters. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
247.
In a typical assemble‐to‐order system, a customer order may request multiple items, and the order may not be filled if any of the requested items are out of stock. A key customer service measure when unfilled orders are backordered is the order‐based backorder level. To evaluate this crucial performance measure, a fundamental question is whether the stationary joint inventory positions follow an independent and uniform distribution. In this context, this is equivalent to the irreducibility of the Markov chain formed by the joint inventory positions. This article presents a necessary and sufficient condition for the irreducibility of such a Markov chain through a set of simultaneous Diophantine equations. This result also leads to sufficient conditions that are more general than those in the published reports. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
248.