首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   596篇
  免费   0篇
  596篇
  2021年   11篇
  2019年   24篇
  2018年   12篇
  2017年   16篇
  2016年   12篇
  2015年   12篇
  2014年   14篇
  2013年   137篇
  2009年   6篇
  2008年   5篇
  2007年   6篇
  2006年   5篇
  2005年   9篇
  2004年   8篇
  2003年   6篇
  2002年   7篇
  2001年   5篇
  2000年   9篇
  1998年   11篇
  1997年   16篇
  1996年   9篇
  1995年   5篇
  1994年   11篇
  1993年   4篇
  1992年   7篇
  1991年   13篇
  1990年   5篇
  1989年   9篇
  1988年   9篇
  1987年   16篇
  1986年   10篇
  1985年   8篇
  1984年   5篇
  1983年   8篇
  1982年   9篇
  1981年   5篇
  1980年   7篇
  1979年   11篇
  1978年   7篇
  1977年   9篇
  1976年   8篇
  1975年   7篇
  1974年   7篇
  1973年   12篇
  1972年   6篇
  1971年   7篇
  1970年   8篇
  1969年   7篇
  1968年   6篇
  1967年   8篇
排序方式: 共有596条查询结果,搜索用时 0 毫秒
331.
332.
In this paper, we consider the economic production quantity problem in the presence of imperfect processes. In the literature, the time to shift from the in-control state to the out-of-control state is assumed to be exponentially distributed. In this study, we consider general time to shift distributions and provide distribution-based and distribution-free bounds on the optimal cost. For the exponential case, we compare the optimal solutions to approximate solutions proposed in the literature. A numerical example is used to illustrate the analysis presented and to conduct a sensitivity analysis in order to see the effect of the input parameters on the various solutions to the problem. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 423–433, 1998  相似文献   
333.
334.
335.
Many coherent systems are configurations of identically structured modules, each consisting of a number of different components. The objective is to assemble the modules out of a collection of available components, and to install the modules in the system in a way that maximizes reliability. The greedy assembly rule builds one module out of the best available components, another out of the best remaining components, and so on. This article shows that greedy assembly is optimal whenever the modules have a series structure, no matter what the structure of the system in which the modules will be used might be, provided that the modules, once assembled, are installed in the system in an optimal way. The article also demonstrates that series modules are unique in this regard.  相似文献   
336.
In modern warfare, many believe the decisive factor in winning a battle is seizing the right moment to shift from defense to attack, or vice versa. This paper attempts to bring that perspective to Lanchester's differential equations of warfare, and continues the application of Lanchester's linear law to the analysis of the World War II battle of Ardennes, as reported in earlier issues of Naval Research Logistics by Bracken and by Fricker. A new variable, shift time, accounting for the timing of the shift between defense and attack is explicitly included in our version of the model, and it helps obtain improved goodness of fit to historical data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:653–661, 2001  相似文献   
337.
Adopting the analytical framework of the established interpretive “schools” of Anglo-American relations, this article offers several reflections on UK–US defense relations as they occurred over the significant years of 2000–2005. During those years, trajectories were established on which UK–US defense relations continue to travel today and outcomes emerged which are still being navigated. This article concludes that the Latin phrase, “Flectas Non Frangas” (essentially translated as: “Bend not Break”), is the most appropriate to adopt to characterize the developments undergone in recent UK–US defense relations. Many historical and strategic lessons with contemporary relevance are drawn.  相似文献   
338.
    
This paper presents several models for the location of facilities subject to congestion. Motivated by applications to locating servers in communication networks and automatic teller machines in bank systems, these models are developed for situations in which immobile service facilities are congested by stochastic demand originating from nearby customer locations. We consider this problem from three different perspectives, that of (i) the service provider (wishing to limit costs of setup and operating servers), (ii) the customers (wishing to limit costs of accessing and waiting for service), and (iii) both the service provider and the customers combined. In all cases, a minimum level of service quality is ensured by imposing an upper bound on the server utilization rate at a service facility. The latter two perspectives also incorporate queueing delay costs as part of the objective. Some cases are amenable to an optimal solution. For those cases that are more challenging, we either propose heuristic procedures to find good solutions or establish equivalence to other well‐studied facility location problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
339.
    
This note examines estimation of the traffic intensity in an M/G/1 queue. We show that the ratio of sample mean service times to the sample mean interarrival times has undesirable sampling properties. To remedy this, two alternative estimators are introduced. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009  相似文献   
340.
    
Like airlines and hotels, sports teams and entertainment venues can benefit from revenue management efforts for their ticket sales. Teams and entertainment venues usually offer bundles of tickets early in their selling horizon and put single‐event tickets on sale at a later date; these organizations must determine the best time to offer individual tickets because both types of ticket sales consume the same fixed inventory. We model the optimal a priori timing decision for a seller with a fixed number of identical tickets to switch from selling the tickets as fixed bundles to individual tickets to maximize the revenue realized before the start of the performance season. We assume that bundle and single‐ticket customers each arrive according to independent, nonhomogeneous Markovian death processes with a linear death rate that can vary over time and that the benefit from selling a ticket in a package is higher than from selling the ticket individually. We characterize the circumstances in which it is optimal for the seller to practice mixed bundling and when the seller should only sell bundles or individual tickets, and we establish comparative statics for the optimal timing decision for the special case of constant customer arrival rates. We extend our analytical results to find the optimal time for offering two groups of tickets with high and low demand. Finally, we apply the timing model to a data set obtained from the sports industry. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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