全文获取类型
收费全文 | 308篇 |
免费 | 15篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 9篇 |
2017年 | 6篇 |
2016年 | 8篇 |
2015年 | 8篇 |
2013年 | 54篇 |
2011年 | 5篇 |
2009年 | 3篇 |
2008年 | 3篇 |
2007年 | 8篇 |
2006年 | 3篇 |
2005年 | 4篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 3篇 |
1999年 | 11篇 |
1998年 | 4篇 |
1997年 | 2篇 |
1996年 | 5篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 8篇 |
1991年 | 12篇 |
1990年 | 5篇 |
1989年 | 5篇 |
1988年 | 8篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 4篇 |
1978年 | 7篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 6篇 |
1973年 | 6篇 |
1972年 | 2篇 |
1971年 | 10篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 4篇 |
1967年 | 5篇 |
1966年 | 7篇 |
排序方式: 共有323条查询结果,搜索用时 31 毫秒
271.
We investigate the strategy of transshipments in a dynamic deterministic demand environment over a finite planning horizon. This is the first time that transshipments are examined in a dynamic or deterministic setting. We consider a system of two locations which replenish their stock from a single supplier, and where transshipments between the locations are possible. Our model includes fixed (possibly joint) and variable replenishment costs, fixed and variable transshipment costs, as well as holding costs for each location and transshipment costs between locations. The problem is to determine how much to replenish and how much to transship each period; thus this work can be viewed as a synthesis of transshipment problems in a static stochastic setting and multilocation dynamic deterministic lot sizing problems. We provide interesting structural properties of optimal policies which enhance our understanding of the important issues which motivate transshipments and allow us to develop an efficient polynomial time algorithm for obtaining the optimal strategy. By exploring the reasons for using transshipments, we enable practitioners to envision the sources of savings from using this strategy and therefore motivate them to incorporate it into their replenishment strategies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:386–408, 2001 相似文献
272.
We address the problem of inventory management in a two‐location inventory system, in which the transshipments are carried out as means of emergency or alternative supply after demand has been realized. This model differs from previous ones as regards its replenishment costs structure, in which nonnegligible fixed replenishment costs and a joint replenishment cost are considered. The single period planning horizon is analyzed, with the form and several properties of the optimal replenishment and transshipment policies developed, discussed and illustrated. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 525–547, 1999 相似文献
273.
We apply the techniques of response surface methodology (RSM) to approximate the objective function of a two‐stage stochastic linear program with recourse. In particular, the objective function is estimated, in the region of optimality, by a quadratic function of the first‐stage decision variables. The resulting response surface can provide valuable modeling insight, such as directions of minimum and maximum sensitivity to changes in the first‐stage variables. Latin hypercube (LH) sampling is applied to reduce the variance of the recourse function point estimates that are used to construct the response surface. Empirical results show the value of the LH method by comparing it with strategies based on independent random numbers, common random numbers, and the Schruben‐Margolin assignment rule. In addition, variance reduction with LH sampling can be guaranteed for an important class of two‐stage problems which includes the classical capacity expansion model. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 753–776, 1999 相似文献
274.
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. 相似文献
275.
276.
Traditional inventory systems treat all demands of a given item equally. This approach is optimal if the penalty costs of all customers are the same, but it is not optimal if the penalty costs are different for different customer classes. Then, demands of customers with high penalty costs must be filled before demands of customers with low penalty costs. A commonly used inventory policy for dealing with demands with different penalty costs is the critical level inventory policy. Under this policy demands with low penalty costs are filled as long as inventory is above a certain critical level. If the inventory reaches the critical level, only demands with high penalty costs are filled and demands with low penalty costs are backordered. In this article, we consider a critical level policy for a periodic review inventory system with two demand classes. Because traditional approaches cannot be used to find the optimal parameters of the policy, we use a multidimensional Markov chain to model the inventory system. We use a sample path approach to prove several properties of this inventory system. Although the cost function is not convex, we can build on these properties to develop an optimization approach that finds the optimal solution. We also present some numerical results. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
277.
This article presents research designed to aid firms who assemble many components into a final product. We assume that purchase quantities are fixed, and that all parts and components are assembled at one stage in a short time. Demand for the final product is represented by a stationary independent and identically distributed random variable; and unmet demand is backordered. Ordering is done on a periodic review basis. We develop infinite horizon, approximate expected cost, and expected service level functions, and we present an algorithm for finding approximately minimum cost reorder points for each part subject to a service level constraint. Extensive results on the accuracy of the approximations are presented. Due to the size of the problem, we present only limited results on the performance of the optimization algorithm. 相似文献
278.
The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting the leader's objective function into a parameterized constraint, and then attempt to solve the resultant problem. This produces a candidate solution that is used to find a point in the BLPP feasible reagion. Incremental improvements are sought, which ultimately lead to a global optimum. An example is presented to highlight the computations and to demonstrate some basic characteristics of the solution. Computational experience indicates that the algorithm is capable of solving problems with up to 50 variables in a reasonable amount of time. 相似文献
279.
280.
Since the 1st oil crisis in 1973, the economies of sub-Saharan Africa have barely kept pace with their burgeoning populations. Women in Sub-Saharan Africa give birth more often than women in any other region of the world, with an average of more than 6.5 live births each. The region's natural increase average 2.5% a year in the 1960s, 2.7% in the 1970s, and in the mid-1980s, it is 3.1% per annum--a rate that will double the regions population in 22 years. National leaders in Sub-Saharan Africa were slow to consider population policy as a key component of the social and economic development effort. The neglect of population issues is reflected in the limited scope of public or private family planning programs in the sub-continent. Donor countries and institutions play an important role in developing the information base by providing technical training to government staff, supporting research, and disseminating information to a broad spectrum of political actors. Some examples of policy reconsiderations in Nigeria, Zambia, Liberia, and Niger are given. These countries are starting to give active consideration to population policies to reduce fertility and high rates of population growth by expanding family planning services, raising the age of marriage, improving the status of women, providing family-life education, and incorporating economic incentives for smaller families into the provision of social services. The highly centralized nature of African governments dictates that the acquiescence of the governmental elite must be obtained before any policy can take hold. Overall, high population growth rates in combination with a stagnating social and economic development effort throughout the region have provided the catalyst for a new look at Sub-Saharan Africa population policy. The ability of African nations to implement policies that reduce fertility is more open to question; no African nation has as yet done so, and the socioeconomics factors contributing to high fertility remain strong. 相似文献