全文获取类型
收费全文 | 81篇 |
免费 | 3篇 |
专业分类
84篇 |
出版年
2020年 | 1篇 |
2019年 | 1篇 |
2017年 | 1篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 20篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2007年 | 2篇 |
2006年 | 2篇 |
2004年 | 2篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1983年 | 2篇 |
1979年 | 1篇 |
1977年 | 3篇 |
1975年 | 1篇 |
1973年 | 2篇 |
1968年 | 1篇 |
1967年 | 2篇 |
排序方式: 共有84条查询结果,搜索用时 15 毫秒
41.
Consider a repeated newsvendor problem for managing the inventory of perishable products. When the parameter of the demand distribution is unknown, it has been shown that the traditional separated estimation and optimization (SEO) approach could lead to suboptimality. To address this issue, an integrated approach called operational statistics (OS) was developed by Chu et al., Oper Res Lett 36 (2008) 110–116. In this note, we first study the properties of this approach and compare its performance with that of the traditional SEO approach. It is shown that OS is consistent and superior to SEO. The benefit of using OS is larger when the demand variability is higher. We then generalize OS to the risk‐averse case under the conditional value‐at‐risk (CVaR) criterion. To model risk from both demand sampling and future demand uncertainty, we introduce a new criterion, called the total CVaR, and find the optimal OS under this new criterion. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 206–214, 2015 相似文献
42.
43.
44.
45.
46.
We show that the linear objective function of a search problem can be generalized to a power function and/or a logarithmic function and still be minimized by an index priority rule. We prove our result by solving the differential equation resulting from the required invariance condition, therefore, we also prove that any other generalization of this linear objective function will not lead to an index priority rule. We also demonstrate the full equivalence between two related search problems in the sense that a solution to either one can be used to solve the other one and vice versa. Finally, we show that the linear function is the only function leading to an index priority rule for the single‐machine makespan minimization problem with deteriorating jobs and an additive job deterioration function. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
47.
48.
In this paper we present several 1‐median formulations on a tree network which incorporate dynamic evolution and/or uncertainty of node demands and transportation costs over a planning horizon. Dynamic evolution is modeled using linear demand functions for the nodes and linear length functions for the edges. Uncertainty is modeled with the use of multiple scenarios, where a scenario is a complete specification of the uncertain node demands and/or edge lengths. We formulate our objective using minimax regret like criteria. We use two different criteria, namely, robust deviation and relative robustness. We discuss what motivated the introduction of these objectives, as well as their relation to existing literature and decision making practices. For all of the models presented, we provide low‐order polynomial time algorithms. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 147–168, 1999 相似文献
49.
Optimal allocation and control of limited inspection capacity for multiple production processes are considered. The production processes, which operate independently but share inspection capacity, are subject to random failures and are partially observed through inspection. This study proposes an approach of stochastic allocation, using a Markov decision process, to minimize expected total discounted cost over an infinite time horizon. Both an optimal model and a disaggregate approximation model are introduced. The study provides some structural results and establishes that the control policy is of a threshold type. Numerical experiments demonstrate a significantly decreased amount of computational time required for the disaggregate approach when compared to the optimal solution, while generating very good control policies. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 78–94, 2002; DOI 10.1002/nav.1049 相似文献
50.
The maximum likelihood estimator of the service distribution function of an M/G/∞ service system is obtained based on output time observations. This estimator is useful when observation of the service time of each customer could introduce bias or may be impossible. The maximum likelihood estimator is compared to the estimator proposed by Mark Brown, [2]. Relative to each other, Brown's estimator is useful in light traffic while the maximum likelihood estimator is applicble in heavy trafic. Both estimators are compared to the empirical distribution function based on a sample of service times and are found to have drawbacks although each estimator may have applications in special circumstances. 相似文献