首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   469篇
  免费   12篇
  国内免费   1篇
  482篇
  2021年   5篇
  2019年   13篇
  2018年   7篇
  2017年   9篇
  2016年   7篇
  2015年   5篇
  2014年   8篇
  2013年   100篇
  2012年   4篇
  2010年   8篇
  2007年   8篇
  2006年   4篇
  2005年   9篇
  2004年   6篇
  2003年   4篇
  2002年   8篇
  2000年   4篇
  1999年   7篇
  1998年   7篇
  1997年   7篇
  1996年   7篇
  1995年   6篇
  1994年   12篇
  1993年   12篇
  1992年   8篇
  1991年   11篇
  1990年   9篇
  1989年   8篇
  1988年   10篇
  1987年   6篇
  1986年   10篇
  1985年   10篇
  1983年   4篇
  1982年   12篇
  1981年   6篇
  1980年   8篇
  1979年   6篇
  1978年   7篇
  1977年   6篇
  1976年   5篇
  1975年   8篇
  1974年   8篇
  1973年   10篇
  1972年   7篇
  1971年   9篇
  1969年   7篇
  1968年   10篇
  1967年   4篇
  1966年   4篇
  1948年   5篇
排序方式: 共有482条查询结果,搜索用时 0 毫秒
311.
In some supply chains serious disruptions are system wide. This happens during periods of severe weather, as when storms cause shuttle tankers serving oil platforms in the North Sea to stop movements of crude oil, barges are frozen in the Mississippi, or all airplanes are grounded after a blizzard. Other notable instances of system‐wide disruption happened after the attack on the World Trade Center when all aircraft were grounded and the natural gas and crude‐oil pipelines were tangled by hurricanes in 2005. We model a situation where shutting down supply facilities is very difficult and expensive because of excessive inventory buildup from an inability to move out the production. We present a planning model that balances the cost of spare capacity versus shutting down production when planning for disruptions. The model uses an assignment model embedded in a simulation. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
312.
Models for integrated production and demand planning decisions can serve to improve a producer's ability to effectively match demand requirements with production capabilities. In contexts with price‐sensitive demands, economies of scale in production, and multiple capacity options, such integrated planning problems can quickly become complex. To address these complexities, this paper provides profit‐maximizing production planning models for determining optimal demand and internal production capacity levels under price‐sensitive deterministic demands, with subcontracting and overtime options. The models determine a producer's optimal price, production, inventory, subcontracting, overtime, and internal capacity levels, while accounting for production economies of scale and capacity costs through concave cost functions. We use polyhedral properties and dynamic programming techniques to provide polynomial‐time solution approaches for obtaining an optimal solution for this class of problems when the internal capacity level is time‐invariant. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
313.
Standard approaches to classical inventory control problems treat satisfying a predefined demand level as a constraint. In many practical contexts, however, total demand is comprised of separate demands from different markets or customers. It is not always clear that constraining a producer to satisfy all markets is an optimal approach. Since the inventory‐related cost of an item depends on total demand volume, no clear method exists for determining a market's profitability a priori, based simply on per unit revenue and cost. Moreover, capacity constraints often limit a producer's ability to meet all demands. This paper presents models to address economic ordering decisions when a producer can choose whether to satisfy multiple markets. These models result in a set of nonlinear binary integer programming problems that, in the uncapacitated case, lend themselves to efficient solution due to their special structure. The capacitated versions can be cast as nonlinear knapsack problems, for which we propose a heuristic solution approach that is asymptotically optimal in the number of markets. The models generalize the classical EOQ and EPQ problems and lead to interesting optimization problems with intuitively appealing solution properties and interesting implications for inventory and pricing management. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.  相似文献   
314.
Revenue management is the process of actively managing inventory or capacity to maximize revenues. The active management typically occurs through managerial levers such as price, promotion, or availability. We present a novel real options approach to revenue management that is specifically suited to the car rental business. We illustrate the concept with actual car rental data. The model produces minimally acceptable prices and inventory release quantities (number of cars available for rent at a given price) as a function of remaining time and available inventory. The pricing and inventory release recommendations of the developed model confirm earlier empirical analysis that suggested current practises discount too deeply early in the booking cycle. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
315.
We consider the single machine parallel batch scheduling problems to minimize makespan and total completion time, respectively, under precedence relations. The complexities of these two problems are reported as open in the literature. In this paper, we settle these open questions by showing that both problems are strongly NP‐hard, even when the precedence relations are chains. When the processing times of jobs are directly agreeable or inversely agreeable with the precedence relations, there is an O(n2) time algorithm to minimize the makespan. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004  相似文献   
316.
Some properties of the geometric process are studied along with those of a related process which we propose to call the α‐series process. It is shown that the expected number of counts at an arbitrary time does not exist for the decreasing geometric process. The decreasing version of the α‐series process does have a finite expected number of counts, under certain conditions. This process also has the same advantages of tractability as the geometric process; it exhibits some properties which may make it a useful complement to the increasing geometric process. In addition, it may be fit to observed data as easily as the geometric process. Applications in reliability and stochastic scheduling are considered in order to demonstrate the versatility of the alternative model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005  相似文献   
317.
In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.  相似文献   
318.
In peace-support operations, employees of international humanitarian organisations often clash with those of the military. A lack of familiarity with each other's practices and values, embedded in their respective organisational cultures, is often seen as the culprit. This article presents and illustrates a road map to manage such cultural differences between cooperating organisations. We found that the military culture, in our Bosnian case study, was seen to operate as a hierarchical culture (characterised by formalisation, stability, predictability and efficiency). The culture of international humanitarian organisations, on the other hand, was depicted as clan-type (characterised by teamwork, participation and consensus). To facilitate the creation of cultural awareness as well as respect for, and reconciliation of, cultural differences we recommend several concrete actions that could improve civil-military cooperation.  相似文献   
319.
The classical work of Gittins, which resulted in the celebrated index result, had applications to research planning as an important part of its motivation. However, research planning problems often have features that are not accommodated within Gittins's original framework. These include precedence constraints on the task set, influence between tasks, stopping or investment options and routes to success in which some tasks do not feature. We consider three classes of Markovian decision models for research planning, each of which has all of these features. Gittins-index heuristics are proposed and are assessed both analytically and computationally. They perform impressively. © 1995 John Wiley & Sons, Inc.  相似文献   
320.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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