全文获取类型
收费全文 | 231篇 |
免费 | 46篇 |
国内免费 | 6篇 |
出版年
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 3篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 1篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 10篇 |
2012年 | 16篇 |
2011年 | 8篇 |
2010年 | 15篇 |
2009年 | 19篇 |
2008年 | 18篇 |
2007年 | 20篇 |
2006年 | 22篇 |
2005年 | 13篇 |
2004年 | 19篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 2篇 |
1989年 | 3篇 |
排序方式: 共有283条查询结果,搜索用时 31 毫秒
201.
202.
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 相似文献
203.
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. 相似文献
204.
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 相似文献
205.
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. 相似文献
206.
This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000. 相似文献
207.
208.
This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm. 相似文献
209.
匈牙利算法在多目标分配中的应用 总被引:9,自引:1,他引:8
在多目标攻击决策中 ,根据 Harold提出的目标优势函数 ,分析了使所有目标机的总优势函数为指派问题 ,运用匈牙利算法对 n对 n的最优目标分配指派问题进行求解 ,并把它推广至 n对 m的多目标分配中。仿真结果表明匈牙利算法对于此类多目标分配指派问题的求解是十分有效的。 相似文献
210.
航空轮胎用橡胶弹性体在服役过程中遭受严苛的动态循环工况。为了研究弹性体在此工况下的力学响应特征和损伤机理,提出基于应力波作用的Mullins效应动态加载实验方法。根据应力波传导与作用特征,采用Hopkinson压杆加载思路,设计和配置了各单元尺寸参数,进而搭建可用于橡胶弹性体材料动态循环加载的实验系统,并开展了航空轮胎用丁苯橡胶的动态循环加载试验。基于试验信号分析发现:加载系统实现了弹性体材料Mullins效应动态应变递增的试验加载。最后开展加载测试参数的影响因素分析,结果表明通过优化系统各单元可实现Mullins效应的动态加、卸载参数的控制。 相似文献