首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   197篇
  免费   0篇
  2023年   2篇
  2019年   2篇
  2018年   2篇
  2017年   5篇
  2016年   3篇
  2015年   2篇
  2014年   2篇
  2013年   46篇
  2011年   1篇
  2009年   3篇
  2008年   4篇
  2007年   2篇
  2006年   1篇
  2004年   4篇
  2003年   2篇
  2002年   6篇
  2001年   2篇
  2000年   2篇
  1999年   3篇
  1998年   3篇
  1997年   4篇
  1996年   3篇
  1995年   6篇
  1994年   5篇
  1993年   4篇
  1992年   5篇
  1991年   6篇
  1990年   5篇
  1989年   2篇
  1988年   3篇
  1987年   7篇
  1986年   4篇
  1985年   5篇
  1984年   2篇
  1983年   3篇
  1982年   4篇
  1981年   3篇
  1980年   3篇
  1978年   1篇
  1977年   1篇
  1976年   2篇
  1975年   2篇
  1974年   4篇
  1973年   3篇
  1972年   2篇
  1971年   1篇
  1970年   1篇
  1969年   3篇
  1968年   1篇
  1967年   2篇
排序方式: 共有197条查询结果,搜索用时 15 毫秒
11.
12.
A method is developed for determining the optimal policy for entry of customers from many independent classes of Poisson arrivals to a first-come, first-serve (for customers admitted to the queue) single-server queue with exponential service times. The solution technique utilizes a semi-Markov formulation or the decision problem.  相似文献   
13.
14.
15.
Production planning for large-scale production systems requiring the allocation of numerous resources is considered. It is demonstrated how the dynamic activity analysis developed by Shephard leads to linear programming solutions of production planning problems. Three types of planning problems are formulated: maximization of output levels for a given time horizon; minimization of production duration for given output histories; and minimization of production costs for given output histories.  相似文献   
16.
17.
18.
We consider the problem of finding a plan that maximizes the expected discounted return when extracting a nonrenewable resource having uncertain reserves. An extraction plan specifies the rate at which the resource is extracted as a function of time until the resource is exhausted or the time horizon is reached. The return per unit of resource extracted may depend on the rate of extraction, time, and the amount of resource previously extracted. We apply a new method called the generalized search optimization technique to find qualitative features of optimal plans and to devise algorithms for the numerical calculation of optimal plans.  相似文献   
19.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc.  相似文献   
20.
We examine the problem of estimating the item fill rate in a periodic inventory system. We show that the traditional expressions for line item fill rate, found in many operations management textbooks, perform well for high fill rates (above 90%), but they consistently underestimate the true fill rate. The problem of underestimation becomes significant as the fill rate falls below 90% and is greatly amplified in cases with very low fill rates (below 50%). We review other more accurate expressions for fill rate, discussing their relative merits. We then develop an exact fill rate expression that is robust for both high and low fill rates. We compare the new expression to others found in the literature via an extensive set of simulation experiments using data that reflect actual inventory systems found at Hewlett-Packard. We also examine the robustness of the expressions to violations in the underlying assumptions. Finally, we develop an alternative fill rate expression that is robust for cases of high demand variability where product returns are allowed. © 1995 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号