全文获取类型
收费全文 | 433篇 |
免费 | 96篇 |
国内免费 | 5篇 |
出版年
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 19篇 |
2018年 | 7篇 |
2017年 | 19篇 |
2016年 | 24篇 |
2015年 | 18篇 |
2014年 | 18篇 |
2013年 | 78篇 |
2012年 | 26篇 |
2011年 | 30篇 |
2010年 | 29篇 |
2009年 | 33篇 |
2008年 | 28篇 |
2007年 | 38篇 |
2006年 | 33篇 |
2005年 | 22篇 |
2004年 | 26篇 |
2003年 | 16篇 |
2002年 | 18篇 |
2001年 | 15篇 |
2000年 | 13篇 |
1999年 | 6篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 3篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有534条查询结果,搜索用时 15 毫秒
331.
We consider a generalized one‐dimensional bin‐packing model where the cost of a bin is a nondecreasing concave function of the utilization of the bin. Four popular heuristics from the literature of the classical bin‐packing problem are studied: First Fit (FF), Best Fit (BF), First Fit Decreasing (FFD), and Best Fit Decreasing (BFD). We analyze their worst‐case performances when they are applied to our model. The absolute worst‐case performance ratio of FF and BF is shown to be exactly 2, and that of FFD and BFD is shown to be exactly 1.5. Computational experiments are also conducted to test the performance of these heuristics. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
332.
333.
We consider a two‐phase service queueing system with batch Poisson arrivals and server vacations denoted by MX/G1‐G2/1. The first phase service is an exhaustive or a gated bulk service, and the second phase is given individually to the members of a batch. By a reduction to an MX/G/1 vacation system and applying the level‐crossing method to a workload process with two types of vacations, we obtain the Laplace–Stieltjes transform of the sojourn time distribution in the MX/G1‐G2/1 with single or multiple vacations. The decomposition expression is derived for the Laplace–Stieltjes transform of the sojourn time distribution, and the first two moments of the sojourn time are provided. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
334.
Ward Whitt 《海军后勤学研究》2007,54(5):476-484
One traditional application of queueing models is to help set staffing requirements in service systems, but the way to do so is not entirely straightforward, largely because demand in service systems typically varies greatly by the time of day. This article discusses ways—old and new—to cope with that time‐varying demand. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
335.
In this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model. We present a branch‐and‐price algorithm for the problem employing the disaggregated formulation, which has exponentially many columns denoting the feasible allocations of weapon systems to each target. A greedy‐style heuristic is used to get some initial columns to start the column generation. A branching strategy compatible with the pricing problem is also proposed. Computational results using randomly generated data show this approach is promising for the targeting problem. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
336.
In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
337.
We consider how a merger between two naturally differentiated dealers affects their interactions with a common supplier and identify conditions under which the merger can increase or decrease the combined net worth of the two firms. Among other things, we find that the attractiveness of merging depends upon the extent to which end demand can be stimulated by either an upstream supplier or the dealers. Specifically, the greater the supplier's ability to invest in stimulating end demand, the more likely it is that the naturally differentiated firms will be better off operating independently than merging. On the other hand, if the greatest opportunities for stimulating demand are through the service that is provided by the dealers, then merging their operations will be more attractive. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
338.
针对寿命周期费用估算和分析时存在的费用不确定性,需要对关键参数进行敏感度分析,否则会影响到结果的正确性.通过分析引起费用不确定性的因素,阐述了敏感度分析的内涵和分析步聚.为了验证该方法,举出示例加以说明.认为:敏感度分析的费用估算与分析中的运用,将对合理决策产生重要作用. 相似文献
339.
Thomas W. Lucas W. David Kelton Paul J. Sánchez Susan M. Sanchez Ben L. Anderson 《海军后勤学研究》2015,62(4):293-303
Decades ago, simulation was famously characterized as a “method of last resort,” to which analysts should turn only “when all else fails.” In those intervening decades, the technologies supporting simulation—computing hardware, simulation‐modeling paradigms, simulation software, design‐and‐analysis methods—have all advanced dramatically. We offer an updated view that simulation is now a very appealing option for modeling and analysis. When applied properly, simulation can provide fully as much insight, with as much precision as desired, as can exact analytical methods that are based on more restrictive assumptions. The fundamental advantage of simulation is that it can tolerate far less restrictive modeling assumptions, leading to an underlying model that is more reflective of reality and thus more valid, leading to better decisions. Published 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 293–303, 2015 相似文献
340.
Complexity and workload considerations in product mix decisions under the theory of constraints
下载免费PDF全文
![点击此处可从《海军后勤学研究》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015 相似文献