全文获取类型
收费全文 | 324篇 |
免费 | 74篇 |
国内免费 | 28篇 |
出版年
2023年 | 1篇 |
2022年 | 5篇 |
2021年 | 1篇 |
2020年 | 5篇 |
2019年 | 10篇 |
2018年 | 3篇 |
2017年 | 13篇 |
2016年 | 25篇 |
2015年 | 11篇 |
2014年 | 17篇 |
2013年 | 17篇 |
2012年 | 37篇 |
2011年 | 19篇 |
2010年 | 22篇 |
2009年 | 27篇 |
2008年 | 25篇 |
2007年 | 32篇 |
2006年 | 34篇 |
2005年 | 13篇 |
2004年 | 22篇 |
2003年 | 11篇 |
2002年 | 6篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 6篇 |
1998年 | 3篇 |
1997年 | 5篇 |
1996年 | 12篇 |
1995年 | 5篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 3篇 |
排序方式: 共有426条查询结果,搜索用时 15 毫秒
301.
302.
303.
304.
李婷 《兵团教育学院学报》2012,(3):78-80
本文针对初中生的特点,提出作业布置应具备科学针对性、层次分明性、综合性、新颖趣味性、实践性,提出通过作业评价方式的改变,促进学生学习成绩的提高和个人的发展。 相似文献
305.
舰载弹炮结合近程反导武器系统火力分配模型研究 总被引:1,自引:0,他引:1
为最大程度发挥弹炮结合武器系统的作战效能,引入优化设计方法求取最大毁伤概率,建立了基于毁伤概率的火力分配模型。该模型将弹炮结合武器系统导弹和火炮的火力分配转化为导弹火力分配。根据导弹杀伤纵深和发射间隔确定导弹发射数量。根据导弹在杀伤区内毁伤概率特性,确定导弹发射时机。 相似文献
306.
Nicholas G. Hall Gilbert Laporte Esaignani Selvarajah Chelliah Sriskandarajah 《海军后勤学研究》2005,52(3):261-275
We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
307.
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. 相似文献
308.
任务分配是进行计算机辅助决策的重要内容之一。本文从目标航迹分段着手,建立一种新的分配模型,解决了目标流的多次分配问题,并给出了具体应用实例。 相似文献
309.
A problem we call recurrent construction involves manufacturing large, complex, expensive products such as airplanes, houses, and ships. Customers order configurations of these products well in advance of due dates for delivery. Early delivery may not be permitted. How should the manufacturer determine when to purchase and release materials before fabrication, assembly, and delivery? Major material expenses, significant penalties for deliveries beyond due dates, and long product makespans in recurrent construction motivate choosing a release timetable that maximizes the net present value of cash flows. Our heuristic first projects an initial schedule that dispatches worker teams to tasks for the backlogged products, and then solves a series of maximal closure problems to find material release times that maximize NPV. This method compares favorably with other well‐known work release heuristics in solution quality for large problems over a wide range of operating conditions, including order strength, cost structure, utilization level, batch policy, and uncertainty level. Computation times exhibit near linear growth in problem size. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
310.
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. 相似文献