全文获取类型
收费全文 | 286篇 |
免费 | 11篇 |
国内免费 | 1篇 |
出版年
2021年 | 3篇 |
2019年 | 11篇 |
2018年 | 7篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 6篇 |
2014年 | 7篇 |
2013年 | 59篇 |
2012年 | 5篇 |
2010年 | 6篇 |
2007年 | 7篇 |
2006年 | 2篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 8篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 8篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1969年 | 2篇 |
1968年 | 5篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1949年 | 1篇 |
1948年 | 2篇 |
排序方式: 共有298条查询结果,搜索用时 15 毫秒
161.
This article analyzes a model of a multiechelon inventory system. The exogenous demands form Markov-modulated Poisson processes. That is, the demand rates are functions of an underlying Markov chain. Each location follows a base-stock policy which is independent of the state of the underlying Markov chain. We employ the exogenous transit mechanism introduced by Zipkin [7] and Svoronos and Zipkin [6]. The transit times between locations have phase-type distributions. An exact procedure to compute steady-state performance measures is presented. © 1992 John Wiley & Sons, Inc. 相似文献
162.
This article deals with the statistical analysis of an N-component series system supported by an active standby and one repair facility. Assuming that the life and repair times of the components are independent exponential random variables, the probability distribution of the first passage to the system failure time is shown to be a convolution of two independent exponential distributions. Three observation schemes are considered to obtain the maximum likelihood estimates of the survival function. Information matrices are supplied. Numerical results based on Monte Carlo simulation are presented. It is noted that component level information (failure rate, repair rate) is not necessary for estimating the survival function of the system. 相似文献
163.
This article presents a mathematical model for manpower scheduling for unbalanced production lines in order to minimize in-process inventory cost. The model extends prior work by adding workers' skill limitations to the system. The model is formulated for a one-period schedule and then extended for multiperiod schedules. An example problem is solved for both single and multiperiods. A heuristic algorithm is also presented for multiperiod and large-scale problems, and computational experiences are reported. 相似文献
164.
A retailer or distributor of finished goods, or the manager of a spare-parts inventory system, must generally forecast the major portion of demand. A specific customer-service level p (fraction of replenishment intervals with no stockout) implies two challenges: achieve the service within a small interval plus or minus, and do so with a minimum-cost investment in inventory. The pth fractile of lead-time demand (LTD) is the reorder point (ROP) for this service measure, and is often approximated by that fractile of a normal distribution. With this procedure, it is easy to set safety stocks for an (s, Q) inventory system. However, Bookbinder and Lordahl [2] and others have identified cases where the normal approximation yields excessive costs and/or lower service than desired. This article employs an order-statistic approach. Using available LTD data, the ROP is simply estimated from one or two of the larger values in the sample. This approach is sufficiently automatic and intuitive for routine implementation in industry, yet is distribution free. The order-statistic method requires only a small amount of LTD data, and makes no assumptions on the form of the underlying LTD distribution, nor even its parameters μ and ρ. We compare the order-statistic approach and the normal approximation, first in terms of customer service and then using a model of expected annual cost. Based upon characteristics of the available LTD data, we suggest a procedure to aid a practitioner in choosine between the normal and order-statistic method. © 1994 John Wiley & Sons, Inc. 相似文献
165.
In this article we develop a heuristic procedure for a multiproduct dynamic lot-sizing problem. In this problem a joint setup cost is incurred when at least one product is ordered in a period. In addition to the joint setup cost a separate setup cost for each product ordered is also incurred. The objective is to determine the product lot sizes, over a finite planning horizon, that will minimize the total relevant cost such that the demand in each period for each product is satisfied without backlogging. In this article we present an effective heuristic procedure for this problem. Computational results for the heuristic procedure are also reported. Our computational experience leads us to conclude that the heuristic procedure may be of considerable value as a decision-making aid to production planners in a real-world setting. © 1994 John Wiley & Sons, Inc. 相似文献
166.
We consider state-age-dependent replacement policies for a multistate deteriorating system. We assume that operating cost rates and replacement costs are both functions of the underlying states. Replacement times and sojourn times in different states are all state-dependent random variables. The optimization criterion is to minimize the expected long-run cost rate. A policy-improvement algorithm to derive the optimal policy is presented. We show that under reasonable assumptions, the optimal replacement policies have monotonic properties. In particular, when the failure-rate functions are nonincreasing, or when all the replacement costs and the expected replacement times are independent of state, we show that the optimal policies are only state dependent. Examples are given to illustrate the structure of the optimal policies in the special case when the sojourntime distributions are Weibull. © 1994 John Wiley & Sons, Inc. 相似文献
167.
An initial point search game on a weighted graph involves a searcher who wants to minimize search and travel costs seeking a hider who wants to maximize these costs. The searcher starts from a specified vertex 0 and searches each vertex in some order. The hider chooses a nonzero vertex and remains there. We solve the game in which the graph is a simple tree, and use this solution to solve a search game on a tree in which each branch is itself a weighted graph with a certain property, and the searcher is obliged to search the entire branch before departing. © 1994 John Wiley & Sons, Inc. 相似文献
168.
Efficient computation of tight bounds is of primary concern in any branch-and-bound procedure for solving integer programming problems. Many successful branch-and-bound approaches use the linear programming relaxation for bounding purposes. Significant interest has been reported in Lagrangian and surrogate duals as alternative sources of bounds. The existence of efficient techniques such as subgradient search for solving Lagrangian duals has led to some very successful applications of Lagrangian duality in solving specially structured problems. While surrogate duals have been theoretically shown to provide stronger bounds, the difficulty of surrogate dual-multiplier search has discouraged their employment in solving integer programs. Based on the development of a new relationship between surrogate and Lagrangian duality, we suggest a new strategy for computing surrogate dual values. The proposed approach allows us to directly use established Lagrangian search methods for exploring surrogate dual multipliers. Computational experience with randomly generated capital budgeting problems validates the economic feasibility of the proposed ideas. 相似文献
169.
In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot‐for‐lot or (S ? 1, S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time, we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 593–610, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10032 相似文献
170.