全文获取类型
收费全文 | 294篇 |
免费 | 15篇 |
国内免费 | 1篇 |
出版年
2020年 | 3篇 |
2019年 | 12篇 |
2018年 | 10篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 4篇 |
2014年 | 11篇 |
2013年 | 62篇 |
2012年 | 5篇 |
2010年 | 7篇 |
2009年 | 4篇 |
2008年 | 2篇 |
2007年 | 6篇 |
2006年 | 2篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2002年 | 7篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 2篇 |
1994年 | 7篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 4篇 |
1972年 | 3篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 2篇 |
排序方式: 共有310条查询结果,搜索用时 15 毫秒
251.
We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016 相似文献
252.
Murat Güngör 《海军后勤学研究》2016,63(4):346-348
For the single‐machine scheduling problem with the objective of simultaneously minimizing total flow time and number of tardy jobs, a lower bound on the number of efficient sequences is known. However, the proof thereof, which makes use of a modified version of Smith's algorithm, is unduly lengthy and sophisticated. Adopting a totally new point of view, we present in this short article a much simpler proof based on the naive idea of pairwise interchange. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 346–348, 2016 相似文献
253.
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 相似文献
254.
The relationship between economic growth and military expenditure has been the subject of a large literature in defence economics. This study analyses the influence of military expenditures on economic growth in a global perspective for the time period 2000–2010 taking spatial dimension into account. The augmented Solow model is employed to investigate the defence-growth nexus using the cross-sectional data relating to 128 countries. Following a traditional regression analysis, spatial variations in the relationships are examined utilizing different spatial econometric specifications estimated by maximum likelihood. The regressions are compared with each other via likelihood ratio tests, and the spatial Durbin model is found to be the most appropriate one suggesting that the typical least-squares model is misspecified. Empirical evidence indicates that military expenditure has a positive effect on economic growth with a significant spatial dependence for the time period under consideration. 相似文献
255.
Ruud H. Teunter 《海军后勤学研究》2001,48(6):484-495
We study a deterministic EOQ model of an inventory system with items that can be recovered (repaired/refurbished/remanufactured). We use different holding cost rates for manufactured and recovered items, and include disposal. We derive simple square root EOQ formulas for both the manufacturing batch quantity and the recovery batch quantity. 相似文献
256.
Building evacuation problems can be represented as dynamic network-flow problems [3]. The underlying network structure of a building evolves through time yielding a time-expanded network (a dynamic network). Usually in such evacuation problems involving time, more than one objective function is appropriate. For example, minimizing the total evacuation time and evacuating a portion of the building as early as possible are two such objectives. In this article we show that lexicographical optimization is applicable in handling such multiple objectives. Minimizing the total evacuation time while avoiding cyclic movements in a building and “priority evacuation” are treated as lexicographical min cost flow problems. 相似文献
257.
The G/G/R machine repair problem with M operating machines, S warm standby spares, and R repairmen is studied as a diffusion process. The steady-state equations are formulated as diffusion equations subject to two reflecting barriers. The approximate diffusion parameters of the diffusion equations are obtained (1) under the assumption that the input characteristics of the problem are defined only by their first two moments rather than their probability distribution function, (2) under the assumption of heavy traffic approximation, that is, when queues of failed machines in the repair stage are almost always nonempty, and (3) using well-known asymptotic results from renewal theory. Expressions for the probability density functions of the number of failed machines in the system are obtained. A study of the derived approximate results, compared to some of the exact results, suggests that the diffusion approach provides a useful method for solving complex machine-repair problems. 相似文献
258.
This article describes an algorithm for solving the static electric utility capacity expansion problem. The advantages of this algorithm are twofold. First, it is simpler and yet more efficient than previous algorithms for the same problem. Second, by making simplifying but realistic assumptions on plant sizes it is possible to use this algorithm for the case where one does not allow fractional plant additions. While the model has n variables, it has a clear two-dimensional geometric representation for understanding its properties, developing an algorithm, and interpreting the optimal solution. This algorithm has been implemented in the Intermediate Future Forecasting (IFFS) capacity expansion model at the Department of Energy. 相似文献
259.
To reduce the time-to-market of newly developed systems, manufacturers increasingly adopt strategies where systems are brought to market while system field reliability is still uncertain. These systems are typically sold under performance-based contracts, which incentivizes potential customers to invest in them despite reliability uncertainty. Such contracts make the manufacturer (partly) responsible for the availability of the system. Subsequently, when field reliability is lower than anticipated, the manufacturer may choose to redesign the system to avoid high contract penalties. Redesign is a costly effort which may substantially increase field reliability. Deciding when to redesign is challenging, especially because the initial failure rate estimate by the system's engineers is refined over time as failure data accrues. We propose a model that endogenizes the failure rate updating to analyze this tactical redesign decision. We study additive and multiplicative redesigns and show that the optimal policy has a control limit structure. We benchmark our optimal policy against a static counterpart numerically, and conclude that basing redesign decisions on the updated estimate of the failure rate can substantially reduce costs. 相似文献
260.
Put-to-light order picking systems invert the basic logic of conventional picker-to-parts systems. Instead of successively visiting the storage positions of the stock keeping units (SKUs) when collecting picking orders, an order picker accompanies successive bins each containing multiple items of a specific SKU along a lane of subsequent orders. Whenever the picker passes an order requiring the current SKU, which is indicated by a light signal, she puts the requested number of items into the bin associated with the order. Such an order picking system is well-suited if the assortment is not overly large and all orders demand similar SKUs, so that it is mainly applied in distribution centers of brick-and-mortar retail chains. This paper evaluates four different setups of put-to-light systems, which, during operations, require the solution of different storage assignment and SKU sequencing problems. We formulate these problems, prove computational complexity, and suggest suited solution algorithms. By applying these algorithms in a comprehensive computational study, we benchmark the impact of the four different setups on picking performance. In this way, warehouse managers receive decision support on how to set up their put-to-light systems. 相似文献