全文获取类型
收费全文 | 414篇 |
免费 | 111篇 |
国内免费 | 12篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2022年 | 6篇 |
2021年 | 6篇 |
2020年 | 6篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 22篇 |
2016年 | 28篇 |
2015年 | 24篇 |
2014年 | 23篇 |
2013年 | 74篇 |
2012年 | 23篇 |
2011年 | 30篇 |
2010年 | 29篇 |
2009年 | 30篇 |
2008年 | 30篇 |
2007年 | 36篇 |
2006年 | 24篇 |
2005年 | 21篇 |
2004年 | 25篇 |
2003年 | 13篇 |
2002年 | 17篇 |
2001年 | 12篇 |
2000年 | 12篇 |
1999年 | 5篇 |
1998年 | 4篇 |
1997年 | 1篇 |
1996年 | 3篇 |
1992年 | 2篇 |
1990年 | 2篇 |
1989年 | 2篇 |
排序方式: 共有537条查询结果,搜索用时 15 毫秒
431.
In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
432.
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 相似文献
433.
详细介绍了电子可编程模拟器件(EPAC)的主要技术特点及其典型芯片IMP50E30,并给出了它在多路测量中的应用实例. 相似文献
434.
In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017 相似文献
435.
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 相似文献
436.
In this article, we carry out the stochastic comparison between coherent systems through the relative aging order when component lifetimes are independent and identically distributed. We make use of the signature to characterize the structure of coherent systems, and derive several sufficient conditions under which the compared systems with the common size can be ordered in the sense of relative aging. Specially, we present some scenarios wherein the better a coherent system is, the faster it ages. Moreover, we discuss the relative aging of dual systems as well. Several numerical examples are provided to illustrate the theoretical results. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 345–354, 2017 相似文献
437.
针对目前航迹规划过程中评价指标难以统一且指标权重确定过分依赖主观经验的问题,在建立较为完备的UCAV航迹评价指标体系基础上,引入BP神经网络对UCAV备选航迹进行综合评价,从备选航迹的样本数据出发,客观分析航迹的优劣,为决策者提供更加科学合理的参考依据,最后结合仿真算例,验证了该方法的可行性。 相似文献
438.
439.
Snke Hartmann 《海军后勤学研究》2002,49(5):433-448
This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029 相似文献
440.
软件测试中的路径划分技术 总被引:1,自引:0,他引:1
路径覆盖测试准则要优于其它已知的覆盖准则,但由于对一般的软件,路径数目太大,以至实际难以实现。路径划分是路径覆盖技术的一个折中方法。给定的程序P和给定模块的最大路径数目k,按就近原则,现给出了一种划分P的算法,使得每个划分后的模块所包含的路径数目都少于等于k。同时也给出了最佳划分的度量标准和最佳划分方法。 相似文献