全文获取类型
收费全文 | 1036篇 |
免费 | 317篇 |
国内免费 | 47篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 14篇 |
2021年 | 16篇 |
2020年 | 17篇 |
2019年 | 14篇 |
2018年 | 8篇 |
2017年 | 63篇 |
2016年 | 53篇 |
2015年 | 45篇 |
2014年 | 64篇 |
2013年 | 119篇 |
2012年 | 126篇 |
2011年 | 142篇 |
2010年 | 50篇 |
2009年 | 41篇 |
2008年 | 47篇 |
2007年 | 78篇 |
2006年 | 70篇 |
2005年 | 89篇 |
2004年 | 70篇 |
2003年 | 58篇 |
2002年 | 31篇 |
2001年 | 51篇 |
2000年 | 37篇 |
1999年 | 20篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 12篇 |
1995年 | 5篇 |
1994年 | 2篇 |
1993年 | 6篇 |
1992年 | 8篇 |
1991年 | 6篇 |
1990年 | 10篇 |
1989年 | 4篇 |
排序方式: 共有1400条查询结果,搜索用时 15 毫秒
141.
The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001 相似文献
142.
两点源干扰是干扰被动雷达导引头 (PRS)的有效手段。但在实际应用中 ,两点源的功率不可能完全相等 ,这就为PRS对抗两点源的干扰提供了契机。通过理论分析和仿真实验证明 ,当两点源偏离导引头的电轴方向不大的情况下 ,只要保证足够的积累点数 ,导引头进行数据积累取均值 ,其结果并不指向两源的“重心”或“质心”而是指向两源中功率较大者 ,并给出了确定积累点数的解析表达式 相似文献
143.
BTT控制系统半实物仿真试验以BTT试验器为背景,配合BTT控制技术研究可全面验证导弹控制系统设计。给出了半实物仿真试验方案、方法及试验结果分析,试验结果表明BTT控制系统设计满足最小侧滑(近似零侧滑角)倾斜转弯的技术指标要求,半实物仿真试验方法正确。 相似文献
144.
采用分层介质膜的等效模型 ,计算了均匀光纤光栅及线性啁啾光栅的反射谱、透射谱及反射相位跃变 ,结果与采用耦合模理论计算的结果相吻合 ,表明这是分析光纤光栅的光反射特性的一种有效的新方法 . 相似文献
145.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
146.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
147.
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000 相似文献
148.
149.
150.
分布孔径红外系统的研究现状及其展望 总被引:1,自引:0,他引:1
介绍了分布孔径红外系统 ( DAIRS)的基本概念与研制现状 ,讨论了DAIRS在先进战斗机及其它作战平台上的应用 ,并简略介绍了其中涉及的关键技术 ,对 DAIRS系统将来可能的发展趋势作了预测。 相似文献