全文获取类型
收费全文 | 401篇 |
免费 | 13篇 |
国内免费 | 1篇 |
出版年
2021年 | 4篇 |
2019年 | 12篇 |
2018年 | 8篇 |
2017年 | 7篇 |
2016年 | 7篇 |
2014年 | 6篇 |
2013年 | 76篇 |
2012年 | 4篇 |
2010年 | 6篇 |
2007年 | 9篇 |
2006年 | 3篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2002年 | 12篇 |
2000年 | 3篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 7篇 |
1995年 | 5篇 |
1994年 | 10篇 |
1993年 | 12篇 |
1992年 | 9篇 |
1991年 | 13篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 7篇 |
1985年 | 8篇 |
1983年 | 3篇 |
1982年 | 8篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 10篇 |
1977年 | 3篇 |
1976年 | 4篇 |
1975年 | 5篇 |
1974年 | 5篇 |
1973年 | 9篇 |
1972年 | 4篇 |
1971年 | 7篇 |
1970年 | 2篇 |
1969年 | 3篇 |
1968年 | 6篇 |
1967年 | 6篇 |
1966年 | 8篇 |
1949年 | 2篇 |
1948年 | 2篇 |
排序方式: 共有415条查询结果,搜索用时 15 毫秒
231.
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. 相似文献
232.
The kitting problem in multiechelon assembly systems is to allocate on-hand stock and anticipated future deliveries to kits so that cost is minimized. This article structures the kitting problem and describes several preprocessing methods that are effective in refining the formulation. The model is resolved using an optimizing approach based on Lagrangian relaxation, which yields a separable problem that decomposes into a subproblem for each job. The resulting subproblems are resolved using a specialized dynamic programming algorithm, and computational efficiency is enhanced by dominance properties devised for that purpose. The Lagrangian problem is resolved effectively using subgradient optimization and a specialized branching method incorporated in the branch-and-bound procedure. Computational experience demonstrates that the specialized approach outperforms the general-purpose optimizer OSL. The new solution approach facilitates time-managed flow control, prescribing kitting decisions that promote cost-effective performance to schedule. © 1994 John Wiley & Sons. Inc. 相似文献
233.
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. 相似文献
234.
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. 相似文献
235.
Regression modeling for prediction or forecasting purposes is critically dependent on the quality of the data which are used to estimate the model parameters. Extreme response or predictor-variable values can substantially influence least-squares estimates and disproportionately affect predictions. Robust alternatives to least-squares are less sensitive to extreme observations and can provide more precise predictions. In this article diagnostic displays are used to identify extreme observations and to assess the sensitivity of least-squares parameter estimates and predictions to the inclusion of these observations in a data set. The displays are shown to aid in the interpretation of weights which robust estimators assign to influential observations. 相似文献
236.
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. 相似文献
237.
The connectivity of a subgraph of a graph can exceed the connectivity of the graph. We call the largest of the connectivities of all subgraphs the subconnectivity. We then give the exact solution to the extremal problem of determining the maximum number of lines in a p-point graph of subconnectivity two. 相似文献
238.
Joel F. Cassman 《Low Intensity Conflict & Law Enforcement》2002,11(1):1-28
United States policy makers and academic researchers have neglected the deep institutional rivalries between police agencies and military services in Latin America. The problems of police/military coordination have complicated US national goals of democratization, strengthening the rule of law and combating the production and trafficking of illicit drugs in the region. Police agencies stand at the epicenter of dysfunctional criminal justice systems. Although the US policy of engagement with Latin American military services is intended to reorient their roles and missions towards supporting democratically elected civilian governments, US counternarcotics assistance programs have encouraged a wider Latin American military role in drug interdiction. This article develops an analytical model to identify the dimensions of police-military conflict in the context of the fundamental reform of criminal justice systems in Latin America. 相似文献
239.
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 相似文献
240.
In this article, we study the Shewhart chart of Q statistics proposed for the detection of process mean shifts in start‐up processes and short runs. Exact expressions for the run‐length distribution of this chart are derived and evaluated using an efficient computational procedure. The procedure can be considerably faster than using direct simulation. We extend our work to analyze the practice of requiring multiple signals from the chart before responding, a practice sometimes followed with Shewhart charts. The results show that waiting to receive multiple signals severely reduces the probability of quickly detecting shifts in certain cases, and therefore may be considered a risky practice. Operational guidelines for practitioners implementing the chart are discussed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献