全文获取类型
收费全文 | 250篇 |
免费 | 9篇 |
国内免费 | 1篇 |
出版年
2021年 | 2篇 |
2019年 | 10篇 |
2018年 | 7篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2014年 | 6篇 |
2013年 | 43篇 |
2012年 | 3篇 |
2010年 | 6篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 7篇 |
2004年 | 4篇 |
2002年 | 7篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1971年 | 1篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1949年 | 1篇 |
1948年 | 2篇 |
排序方式: 共有260条查询结果,搜索用时 15 毫秒
191.
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. 相似文献
192.
Tjallie A. M. Scheltinga Sebastiaan J. H. Rietjens Sirp J. De Boer Celeste P. M. Wilderom 《Low Intensity Conflict & Law Enforcement》2005,13(1):54-69
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. 相似文献
193.
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 相似文献
194.
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 相似文献
195.
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. 相似文献
196.
The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We also assume that if a job is not processed to completion before the machine is stopped for maintenance, an additional setup is necessary when the processing is resumed. Our purpose is to schedule the maintenance and jobs to minimize some performance measures. The objective functions that we consider are minimizing the total weighted job completion times and minimizing the maximum lateness. In both cases, maintenance must be performed within a fixed period T, and the time for the maintenance is a decision variable. In this paper, we study two scenarios concerning the planning horizon. First, we show that, when the planning horizon is long in relation to T, the problem with either objective function is NP-complete, and we present pseudopolynomial time dynamic programming algorithms for both objective functions. In the second scenario, the planning horizon is short in relation to T. However, part of the period T may have elapsed before we schedule any jobs in this planning horizon, and the remaining time before the maintenance is shorter than the current planning horizon. Hence we must schedule one maintenance in this planning horizon. We show that the problem of minimizing the total weighted completion times in this scenario is NP-complete, while the shortest processing time (SPT) rule and the earliest due date (EDD) rule are optimal for the total completion time problem and the maximum lateness problem respectively. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 845–863, 1999 相似文献
197.
Patrick H. Liu 《海军后勤学研究》2000,47(6):479-499
This paper studies three tool replacement/operation sequencing strategies for a flexible manufacturing system over a finite time horizon: (1) failure replacement—replace the tool only upon failure, (2) optimal preventive tool replacement for a fixed sequence of operations, and (3) joint scheduling of the optimal preventive tool replacement times and the optimal sequence of operations. Stochastic dynamic decision models are used for strategies 2 and 3. The optimization criterion for strategies 2 and 3 is the minimization of the total expected cost over the finite time horizon. We will show through numerical studies that, with the same amount of information, the total expected costs can be reduced considerably by choosing an optimal strategy. Our conclusion is that in flexible manufacturing, optimal tool replacement and optimal operations sequencing are not separate issues. They should be considered jointly to minimize the expected total cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 479–499, 2000 相似文献
198.
199.
David H. Ucko 《战略研究杂志》2016,39(5-6):847-877
ABSTRACTFollowing frustrating campaigns in Iraq and Afghanistan, Western interventions are becoming more limited, with troops being deployed for short bursts and residual peace-building tasks being left to others. Although this approach limits exposure for the intervening government, it struggles to achieve meaningful political change. Examining the comparatively successful British intervention in Sierra Leone (2000–02), this article identifies the conditions for effectiveness in these campaigns. It challenges the historiography of the case by framing armed confrontations and raids as enablers of politics rather than ends in themselves; indeed, in both the conduct and study of intervention, politics must reign supreme. 相似文献
200.
This article presents an extension of the interactive multicriteria linear-programming method of Zionts and Wallenius [see Management Science, 29 (5) (1983)]. The decision maker's underlying utility function is assumed to be pseudoconcave, and his preference structure is assessed through pairwise comparison questions. In the method of Zionts and Wallenius, the decision maker's preference structure is represented as constraints on the weights on the objectives derived from his responses. This representation is only a linear approximation to the underlying nonlinear utility function. Accordingly, inconsistency among the constraints on the weights arises while solving the problem. Therefore, some of the constraints have to be dropped, resulting in a loss of information on the preference structure, and hence an increase in the total number of questions. In this article we develop a hybrid representation scheme to avoid this problem. The proposed scheme is implemented within the algorithmic framework of the method of Zionts and Wallenius, and its underlying theory is developed. Computational results show that the number of questions required by the Zionts and Wallenius method can be sinificantly reduced using the proposed scheme. 相似文献