全文获取类型
收费全文 | 522篇 |
免费 | 8篇 |
专业分类
530篇 |
出版年
2021年 | 5篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2017年 | 10篇 |
2016年 | 13篇 |
2015年 | 10篇 |
2014年 | 10篇 |
2013年 | 72篇 |
2012年 | 22篇 |
2011年 | 27篇 |
2010年 | 22篇 |
2009年 | 15篇 |
2008年 | 27篇 |
2007年 | 15篇 |
2006年 | 16篇 |
2005年 | 5篇 |
2004年 | 5篇 |
2002年 | 5篇 |
2001年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 6篇 |
1990年 | 4篇 |
1989年 | 16篇 |
1988年 | 4篇 |
1987年 | 12篇 |
1986年 | 12篇 |
1985年 | 11篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 8篇 |
1973年 | 4篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 8篇 |
1967年 | 3篇 |
1966年 | 3篇 |
排序方式: 共有530条查询结果,搜索用时 15 毫秒
61.
目标的电磁散射特性研究对于实现雷达探测、识别、跟踪目标起着至关重要的作用,而雷达散射截面(Radar Cross Section,RCS)又是体现目标电磁散射特性的一个重要方面.参数曲面能精确模拟目标的几何外形,提高计算精度.采用参数曲面——双线性表面建模,运用物理光学(Physical Optics,PO)法计算电大... 相似文献
62.
James L. Cook 《Journal of Military Ethics》2016,15(4):321-324
63.
64.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
65.
We consider a reader—writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 483–495, 1998 相似文献
66.
武器系统采购费与维修费权衡的依据分析 总被引:2,自引:2,他引:2
根据武器系统寿命周期费用的理论和方法,建立了系统的费用模型,依据数学分析和优化理论,在已知可用武器系统目标数的前提下,建立了费用优化条件,确定了采购费与维修费的比例限值,用以确定武器系统采购费和维修费的最优比例,从而对系统方案确定的权衡分析提供量化依据. 相似文献
67.
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. 相似文献
68.
69.
Victoria L. Zhang 《海军后勤学研究》1996,43(5):691-708
This article explores ordering policies for inventory systems with three supply modes. This model is particularly interesting because the optimal ordering decision needs to balance the inventory and purchase costs, as well as the costs for earlier and later periods. The latter cost trade-off is present only in inventory systems with three or more supply modes. Therefore, the result not only offers guidelines for the operation of the concerned inventory systems, but also provides valuable insight into the complex cost trade-offs when more supply modes are available. We assume that the difference between the lead times is one period, and the inventory holding and shortage costs are linear. We analyze two cases and obtain the structure of the optimal ordering policy. Moreover, in the first case, explicit formulas are derived to calculate the optimal order-up-to levels. In the second case, although the optimal order-up-to levels are functions of the initial inventory state and are not obtained in closed form, their properties are discussed. We also develop heuristic ordering policies based on the news-vendor model. Our numerical experiments suggest that the heuristic policies perform reasonably well. © 1996 John Wiley & Sons, Inc. 相似文献
70.