首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   373篇
  免费   80篇
  国内免费   14篇
  2024年   1篇
  2023年   3篇
  2022年   4篇
  2021年   7篇
  2020年   10篇
  2019年   7篇
  2018年   6篇
  2017年   13篇
  2016年   13篇
  2015年   24篇
  2014年   17篇
  2013年   70篇
  2012年   19篇
  2011年   24篇
  2010年   21篇
  2009年   27篇
  2008年   27篇
  2007年   27篇
  2006年   17篇
  2005年   20篇
  2004年   16篇
  2003年   12篇
  2002年   11篇
  2001年   13篇
  2000年   10篇
  1999年   11篇
  1998年   7篇
  1997年   8篇
  1996年   4篇
  1995年   1篇
  1994年   3篇
  1993年   1篇
  1992年   1篇
  1991年   3篇
  1990年   3篇
  1989年   2篇
  1988年   2篇
  1987年   1篇
  1969年   1篇
排序方式: 共有467条查询结果,搜索用时 109 毫秒
391.
This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003  相似文献   
392.
This paper deals with search for a target following a Markovian movement or a conditionally deterministic motion. The problem is to allocate the search efforts, when search resources renew with generalized linear constraints. The model obtained is extended to resource mixing management. New optimality equations of de Guenin's style are obtained. Practically, the problem is solved by using an algorithm derived from the FAB method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 117–142, 2002; DOI 10.1002/nav.10009  相似文献   
393.
Substitutable product inventory problem is analyzed using the concepts of stochastic game theory. It is assumed that there are two substitutable products that are sold by different retailers and the demand for each product is random. Game theoretic nature of this problem is the result of substitution between products. Since retailers compete for the substitutable demand, ordering decision of each retailer depends on the ordering decision of the other retailer. Under the discounted payoff criterion, this problem is formulated as a two‐person nonzero‐sum stochastic game. In the case of linear ordering cost, it is shown that there exists a Nash equilibrium characterized by a pair of stationary base stock strategies for the infinite horizon problem. This is the unique Nash equilibrium within the class of stationary base stock strategies. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 359–375, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10018  相似文献   
394.
主要对电传动系统永磁同步电机进行了设计和仿真,首先对电传动和所采用永磁同步电动机进行了概述,给出了电机的基本参数要求,并在这些参数基础上对电机结构进行了初步设计,然后运用Simulink对永磁同步电机进行了建模仿真,获得了较为理想的结果。  相似文献   
395.
The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006  相似文献   
396.
力争主动的胜权艺术是彭德怀抗美援朝军事指挥艺术的重要内容,也是毛泽东军事思想中的一朵奇葩,值得我军不断挖掘继承和发扬光大。  相似文献   
397.
从理论上分析了水声通讯系统的时空处理问题,给出了该系统时空处理增益的计算方法和系统的原理框图,提出并实现了减小误码及干扰抑制方法,最后给出了实验的结论.  相似文献   
398.
用5种不同底质(淤泥、岩石、卵石、沙和沙砾)的湖底混响数据探讨了高频混响具有混沌特性.该结论将有助于提高混响背景下信号检测性能.  相似文献   
399.
We consider an integrated usage and maintenance optimization problem for a k‐out‐of‐n system pertaining to a moving asset. The k‐out‐of‐n systems are commonly utilized in practice to increase availability, where n denotes the total number of parallel and identical units and k the number of units required to be active for a functional system. Moving assets such as aircraft, ships, and submarines are subject to different operating modes. Operating modes can dictate not only the number of system units that are needed to be active, but also where the moving asset physically is, and under which environmental conditions it operates. We use the intrinsic age concept to model the degradation process. The intrinsic age is analogous to an intrinsic clock which ticks on a different pace in different operating modes. In our problem setting, the number of active units, degradation rates of active and standby units, maintenance costs, and type of economic dependencies are functions of operating modes. In each operating mode, the decision maker should decide on the set of units to activate (usage decision) and the set of units to maintain (maintenance decision). Since the degradation rate differs for active and standby units, the units to be maintained depend on the units that have been activated, and vice versa. In order to minimize maintenance costs, usage and maintenance decisions should be jointly optimized. We formulate this problem as a Markov decision process and provide some structural properties of the optimal policy. Moreover, we assess the performance of usage policies that are commonly implemented for maritime systems. We show that the cost increase resulting from these policies is up to 27% for realistic settings. Our numerical experiments demonstrate the cases in which joint usage and maintenance optimization is more valuable. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 418–434, 2017  相似文献   
400.
针对双经纬仪异面交会中目标点并不一定正好在公垂线上的问题,提出了在公垂线附近的空间区域上估计目标点位置的方法。该空间区域为以公垂线为对角线,各边分别平行于双经纬仪测量坐标系三轴的长方体空间区域。在目标点位置估计时考虑到经纬仪高低角与水平角测角精度的不同,以及目标点与经纬仪之间距离对空间点坐标精度的影响。采用蒙特卡洛方法模拟结果表明:新方法的目标点空间位置估计精度不亚于传统公垂线法,在特定情况下甚至能提高5%以上。模拟结果验证了新方法的可行性和有效性。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号