全文获取类型
收费全文 | 951篇 |
免费 | 199篇 |
国内免费 | 43篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 18篇 |
2021年 | 43篇 |
2020年 | 24篇 |
2019年 | 9篇 |
2018年 | 13篇 |
2017年 | 33篇 |
2016年 | 21篇 |
2015年 | 45篇 |
2014年 | 57篇 |
2013年 | 109篇 |
2012年 | 66篇 |
2011年 | 64篇 |
2010年 | 63篇 |
2009年 | 88篇 |
2008年 | 64篇 |
2007年 | 68篇 |
2006年 | 48篇 |
2005年 | 48篇 |
2004年 | 43篇 |
2003年 | 30篇 |
2002年 | 35篇 |
2001年 | 44篇 |
2000年 | 19篇 |
1999年 | 31篇 |
1998年 | 16篇 |
1997年 | 12篇 |
1996年 | 13篇 |
1995年 | 9篇 |
1994年 | 11篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 6篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1982年 | 1篇 |
1979年 | 1篇 |
排序方式: 共有1193条查询结果,搜索用时 15 毫秒
181.
The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
182.
An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
183.
We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
184.
We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005 相似文献
185.
计算混沌统计特征量前必须先获得重构相空间的维数,因此给出了最大特征值不变法、几何不变量法、虚假邻点法、预测误差最小法、最小Shannon熵法、经验赋值法六种确定方法,得出了应用最大特征值不变法和最小Shannon熵法的工程案例计算结果。 相似文献
186.
资产维修是社会持续发展的重要技术途径,同时,维修又要消耗资源产生废弃物,对环境造成危害。汽车维修是最庞大的维修行业。以某运输团军用汽车年维修产生的废弃物的统计分析为基础,论述了推行绿色维修的重要性和紧迫性,并针对目前的维修废弃物处理方式及其危害性,从管理及回收处置方面提出了相应的改进意见。 相似文献
187.
根据三波耦合过程中的能量动量守恒,基于非线性晶体的相位匹配理论,利用CsLiB6O10(CLBO)晶体的Sellmeier方程,详细分析了Ⅰ型共线及非共线参变过程中CLBO晶体的角度调谐特性.这对于激光脉冲的激光参量过程的优化具有重要的意义. 相似文献
188.
两栖装甲装备海上抢救,是装备保障的重要组成部分,由于其作业条件的特殊性和装备、器材的局限性,对两栖装甲装备保障有着重要的影响.新材料、新技术在两栖装甲装备海上抢救中的应用,使抢救作业方便、快捷、安全成为现实.从部队的需求、新技术的先进性和充分的试验数据,阐述了新材料的特点和在两栖装甲装备水上抢救中的应用前景. 相似文献
189.
为了合理解决网格划分对坦克动力舱空气流动与传热三维数值计算效率和计算精度的影响,特提出动力舱空气流动计算区域的网格生成方法.对某型坦克动力舱的网格生成实例,显示了这种方法的实用性. 相似文献
190.
层次分析法在野战仓库选址中的运用研究 总被引:3,自引:3,他引:0
野战仓库在现代高技术局部战争中发挥着极其重要的作用,其库址的合理选择,是野战仓库建设中至关重要的一步。采用层次分析法(AHP),结合野战仓库的职能,从地形良好、位置恰当、地幅适当、交通方便四个方面出发,科学地分析了野战仓库选址过程中的各种影响因素,并得出它们在野战仓库选址中的重要性排序;采用层次分析法大大简化了野战仓库的选址过程,具有一定的适用性。 相似文献