全文获取类型
收费全文 | 379篇 |
免费 | 101篇 |
国内免费 | 83篇 |
出版年
2024年 | 3篇 |
2023年 | 3篇 |
2022年 | 7篇 |
2021年 | 11篇 |
2020年 | 15篇 |
2019年 | 9篇 |
2018年 | 11篇 |
2017年 | 29篇 |
2016年 | 30篇 |
2015年 | 26篇 |
2014年 | 34篇 |
2013年 | 36篇 |
2012年 | 37篇 |
2011年 | 28篇 |
2010年 | 19篇 |
2009年 | 41篇 |
2008年 | 30篇 |
2007年 | 32篇 |
2006年 | 42篇 |
2005年 | 35篇 |
2004年 | 24篇 |
2003年 | 11篇 |
2002年 | 5篇 |
2001年 | 12篇 |
2000年 | 1篇 |
1999年 | 6篇 |
1998年 | 5篇 |
1997年 | 3篇 |
1996年 | 2篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 6篇 |
1989年 | 2篇 |
1988年 | 1篇 |
排序方式: 共有563条查询结果,搜索用时 15 毫秒
451.
452.
453.
454.
In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016 相似文献
455.
The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016 相似文献
456.
457.
针对大型武器装备实装训练成本高,受场地天气影响大的特点,设计了一种基于unity驱动引擎的武器装备虚拟维修训练系统。场景模块采用3DMAX建模,并对虚拟对象设置复合碰撞器,完成对虚拟场景的构建;战技勤操作模块中,先对操作步骤分类,结合Petri网条件—事件模型,解决了虚拟环境下装备操作的标准流程生成问题;拆装训练模块中,采用割集法,结合单一约束解除原理,解决了虚拟拆装训练中拆装序列的生成问题;提出了基于层次分析法的横向评价模型和基于GAHP法的纵向评价模型,增强了对用户训练效果评价的全面性,并实现了纵向自适应评价;在系统中增加了半实物故障排除模块的设计,弥补了传统虚拟训练系统缺少此模块的问题。 相似文献
458.
Robert Erdeniz 《Defence Studies》2016,16(3):248-269
Parts of NATO’s contemporary planning framework called the comprehensive operations planning directive (COPD), and parts of the operation-level planning process should be revised since they suffer from methodological inconsistency. This claim is defended by discussing contradicting methodological properties and heuristics applied when framing and managing a military problem in accordance with the COPD. The methodological inconsistency within the COPD; in other words, simultaneously applying contradictory methodological properties, implies one theoretical and three practical implications. The theoretical implication is summarised in a meta-theoretical framework and explained by discussing five methodological properties: non-linearity, emergence, independently changeable generalisations, invariance and boundaries. The three practical implications of methodology imply that methodology is guiding: the problem-frame, conceptual development and action. To improve military planners’ understanding and management of these four identified implications, NATO is recommended to develop a “handbook of methodology.” The purpose of such a handbook should be to emphasise the utility of methodology when planning military operations. 相似文献
459.
460.
提出了战场信息系统是信息作战战场的核心 ,战场信息系统必须满足战场要素数字化、战场空间一体化、战场结构网络化的要求。我军战场信息系统的基本结构由总部、海军、陆军、空军、第二炮兵五大系统组成。构筑新型战场信息系统 ,首要问题是实现通信现代化 ,组织战场信息系统的建设 ,理顺体制、突出重点、协力发展等几个主要问题 相似文献