全文获取类型
收费全文 | 393篇 |
免费 | 8篇 |
出版年
2020年 | 3篇 |
2019年 | 8篇 |
2018年 | 6篇 |
2017年 | 8篇 |
2016年 | 9篇 |
2015年 | 7篇 |
2014年 | 4篇 |
2013年 | 99篇 |
2011年 | 5篇 |
2009年 | 7篇 |
2008年 | 5篇 |
2007年 | 4篇 |
2006年 | 3篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 5篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 4篇 |
1997年 | 5篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 14篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 13篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1978年 | 4篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 5篇 |
1973年 | 4篇 |
1972年 | 14篇 |
1971年 | 6篇 |
1970年 | 8篇 |
1969年 | 7篇 |
1968年 | 5篇 |
1967年 | 5篇 |
1966年 | 3篇 |
排序方式: 共有401条查询结果,搜索用时 15 毫秒
301.
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. 相似文献
302.
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 相似文献
303.
George E. Monahan 《海军后勤学研究》1996,43(6):821-837
This article reviews procedures for computing saddle points of certain continuous concave-convex functions defined on polyhedra and investigates how certain parameters and payoff functions influence equilibrium solutions. The discussion centers on two widely studied applications: missile defense and market-share attraction games. In both settings, each player allocates a limited resource, called effort, among a finite number of alternatives. Equilibrium solutions to these two-person games are particularly easy to compute under a proportional effectiveness hypothesis, either in closed form or in a finite number of steps. One of the more interesting qualitative properties we establish is the identification of conditions under which the maximizing player can ignore the values of the alternatives in determining allocation decisions. © 1996 John Wiley & Sons, Inc. 相似文献
304.
We investigate the problem of determining lot sizes for multiple items when the expected percentage of acceptable output increases with the duration of the production run, usually due to adjustments made during the early part of the production run. Such problems arise in metal stamping, textile finishing processes, and a variety of other industries. The goal is to minimize the total cost of production, inventory holding costs, and setup costs (where applicable). We develop a heuristic procedure based on a Lagrangian relaxation that differs from relaxations used in earlier studies. We use various properties of the objective function to guide the adjustment of the initial solution from the relaxation toward feasibility. Computational results indicate that, on the average, the heuristic produces solutions within 4.9% of the lower bound obtained from the Lagrangian relaxation. © 1996 John Wiley & Sons, Inc. 相似文献
305.
Because Pakistan has varying climates and terrains, the Pakistan Army rotates its units between peacetime locations so that no unit endures inequitable hardship or enjoys unfair advantage. Army policy specifies strict constraints on unit rotations, such as the length of a unit's stay in any location, the number of units moving at any time, and the allowable replacements for any moving unit. Scheduling rotations manually in accordance with these rules, as is currently practiced, is extremely difficult and time consuming. This article presents an integer programming model that finds feasible, minimum-cost schedules for the Pakistan Army's desired planning horizons. The model also ensures that the units are positioned at the end of the planning horizon so that feasible schedules exist for future planners. The model is implemented with commercially available optimization software. Schedules are obtained for realistic test problems in less than an hour on a personal computer. © 1995 John Wiley & Sons, Inc. 相似文献
306.
An approximate method for measuring the service levels of the warehouse-retailer system operating under (s, S) policy is presented. All the retailers are identical and the demand process at each retailer follows a stationary stuttering Poisson process. This type of demand process allows customer orders to be for a random number of units, which gives rise to the undershoot quantity at both the warehouse and retailer levels. Exact analyses of the distribution of the undershoot quantity and the number of orders place by a retailer during the warehouse reordering lead time are derived. By using this distribution together with probability approximation and other heuristic approaches, we model the behavior of the warehouse level. Based on the results of the warehouse level and on an existing framework from previous work, the service level at the retailer level is estimated. Results of the approximate method are then compared with those of simulation. © 1995 John Wiley & Sons, Inc. 相似文献
307.
Given a set of jobs, a processing time and a weight for each job, several parallel and identical machines, and a common due date that is not too early to constrain the scheduling decision, we want to find an optimal job schedule so as to minimize the maximum weighted absolute lateness. We show that this problem is NP-complete even for the single-machine case, and is strongly NP-complete for the general case. We present a polynomial time heuristic for this problem and analyze its worst-case performance. Empirical testing of the heuristic is reported, and the results suggest that the performance is asymptotically optimal as the number of jobs tends to infinity. © 1994 John Wiley & Sons, Inc. 相似文献
308.
This article examines the ship-to-shore transfer of cargo from ships that are located offshore. In these situations, cargo is transferred from the ships to smaller craft, which in turn transport the cargo the remaining distance to shore. These craft cycle back and forth from the ship to the shore until the transfer is complete. Queueing of these craft often occurs, as they must wait at either the ship or the shore for a loading or unloading position to become free. Two different methods of modeling this ship-to-shore transfer of cargo are developed and applied. One is an analytic queueing model and the other is a more traditional simulation model. The analytic model is found to produce results quite similar to the simulation model. Examples are shown that use these models to analyze trade-offs between variables affecting the ship-to-shore transfer of cargo and the total time to transfer a given amount of cargo ashore. © 1994 John Wiley & Sons, Inc. 相似文献
309.
The article presents a Bayesian analysis for the environmental stress screening problem. The decision problem of deriving optimal stress screen durations is solved. Given a screen duration, the optimal stress level can also be determined. Indicators of the quality of a screen of any duration are derived. A statistical model is presented which allows a posterior density for the rate of early failures of the production process to be calculated. This enables the user to update his opinion about the quality of the process. © 1994 John Wiley & Sons, Inc. 相似文献
310.
Lawrence E. Cline 《Defense & Security Analysis》2019,35(3):241-260
Most counterinsurgency campaigns have featured the use of some form of local defense forces. Such forces have had a somewhat mixed record, both in their usefulness in actually countering insurgents and in their longer-term impact on internal security. This article focuses on historical cases that provide lessons for the best operational and strategic uses of local defense forces and measures to control their activities. 相似文献