首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   367篇
  免费   21篇
  国内免费   1篇
  2021年   5篇
  2019年   7篇
  2018年   5篇
  2017年   6篇
  2016年   7篇
  2015年   9篇
  2014年   8篇
  2013年   69篇
  2012年   7篇
  2011年   6篇
  2010年   7篇
  2007年   6篇
  2006年   7篇
  2004年   4篇
  2003年   5篇
  2002年   4篇
  2001年   3篇
  2000年   4篇
  1999年   6篇
  1998年   4篇
  1997年   5篇
  1996年   8篇
  1995年   5篇
  1994年   6篇
  1993年   10篇
  1992年   10篇
  1991年   8篇
  1990年   4篇
  1989年   9篇
  1988年   5篇
  1987年   7篇
  1986年   8篇
  1985年   10篇
  1984年   5篇
  1983年   4篇
  1982年   5篇
  1981年   4篇
  1980年   8篇
  1979年   7篇
  1978年   9篇
  1976年   7篇
  1975年   10篇
  1974年   6篇
  1973年   9篇
  1972年   5篇
  1971年   4篇
  1970年   5篇
  1969年   4篇
  1968年   5篇
  1967年   3篇
排序方式: 共有389条查询结果,搜索用时 46 毫秒
321.
Estimation of warranty costs, in the event of product failure within the warranty period, is of importance to the manufacturer. Costs associated with replacement or repair of the product are usually drawn from a warranty reserve fund created by the manufacturer. Considering a stochastic sales process, first and second moments (and thereby the variance) are derived for the manufacturer's total discounted warranty cost of a single sale for single‐component items under four different warranty policies from a manufacturer's point of view. These servicing strategies represent a renewable free‐replacement, nonrenewable free‐replacement, renewable pro‐rata, and a nonrenewable minimal‐repair warranty plans. The results are extended to determine the mean and variance of total discounted warranty costs for the total sales over the life cycle of the product. Furthermore, using a normal approximation, warranty reserves necessary for a certain protection level, so that reserves are not completely depleted, are found. Results and their managerial implications are studied through an extensive example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 499–513, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10023  相似文献   
322.
The problem considered in this article is a generalization of the familiar makespan problem, in which n jobs are allocated among m parallel processors, so as to minimize the maximum time (or cost) on any processor. Our problem is more general, in that we allow the processors to have (a) different initial costs, (b) different utilization levels before new costs are incurred, and (c) different rates of cost increase. A heuristic adapted from the bin-packing problem is shown to provide solutions which are close to optimal as the number of iterations is allowed to increase. Computational testing, over a large number of randomly generated problem instances, suggests that heuristic errors are, on average, very small.  相似文献   
323.
Given a positive integer R and a weight for each vertex in a graph, the maximum-weight connected graph (MCG) problem is to find a connected subgraph with R vertices that maximizes the sum of the weights. The MCG problem is strongly NP-complete, and we study a special case of it: the constrained MCG (CMCG) problem, which is the MCG problem with a constraint of having a predetermined vertex included in the solution. We first show that the Steiner tree problem is a special case of the CMCG problem. Then we present three optimization algorithms for the CMCG problem. The first two algorithms deal with special graphs (tree and layered graphs) and employ different dynamic programming techniques, solving the CMCG problem in polynomial times. The third one deals with a general graph and uses a variant of the Balas additive method with an imbedded connectivity test and a pruning method. We also present a heuristic algorithm for the CMCG problem with a general graph and its bound analysis. We combine the two algorithms, heuristic and optimization, and present a practical solution method to the CMCG problem. Computational results are reported and future research issues are discussed. © 1996 John Wiley & Sons, Inc.  相似文献   
324.
325.
We present a family of tests to detect the presence of a transient mean in a simulation process. These tests compare variance estimators from different parts of a simulation run, and are based on the methods of batch means and standardized time series. Our tests can be viewed as natural generalizations of some previously published work. We also include a power analysis of the new tests, as well as some illustrative examples. © 1994 John Wiley & Sons, Inc.  相似文献   
326.
This article addresses the problem of scheduling the United States Navy's Atlantic Fleet to satisfy overseas strategic requirements. An integer programming formulation is developed but results in a model with prohibitive size. This fact and the qualitative nature of additional secondary objectives and constraints suggest an interactive optimization approach. A system that solves a natural relaxation of the integer program within an interactive environment is discussed.  相似文献   
327.
Mediators increase the effectiveness of negotiation processes. The art of mediation includes interpersonal skills, ability to convince, and proficiency in argumentation. The science of mediation represents an analytical approach to problem solving, a systematic analysis of the process, of players' positions, and of their goals, aspirations, and concessions. Analytical tools for mediation can be used by mediators, but these tools can also support negotiators in their analysis, verification of their positions, and choices. The knowledge of effective and safe alternatives, of sets of compromises, and the knowledge of the possible outcomes of concessions may be used to develop an effective strategy and to increase a negotiator's bargaining power. Models to analyze alternatives, to verify concessions made by the opponents, to determine effective alternatives, and to search for solutions that yield mutual gains, to aggregate opponents' proposals, to look for coalition members, and to simulate some of the actions of a mediator are discussed in the article.  相似文献   
328.
In this article we investigate the problem of locating a facility among a given set of demand points when the weights associated with each demand point change in time in a known way. It is assumed that the location of the facility can be changed one or more times during the time horizon. We need to find the time “breaks” when the location of the facility is to be changed, and the location of the facility during each time segment between breaks. We investigate the minisum Weber problem and also minimax facility location. For the former we show how to calculate the objective function for given time breaks and optimally solve the rectilinear distance problem with one time break and linear change of weights over time. Location of multiple time breaks is also discussed. For minimax location problems we devise two algorithms that solve the problem optimally for any number of time breaks and any distance metric. These algorithms are also applicable to network location problems.  相似文献   
329.
This article defines and develops a simulation optimization system based upon response surface classification and the integration of multiple search strategies. Response surfaces are classified according to characteristics that indicate which search technique will be most successful. Typical surface characteristics include statistical measures and topological features, while search techniques encompass response surface methodology, simulated annealing, random search, etc. The classify-then-search process flow and a knowledge-based architecture are developed and then demonstrated with a detailed computer example. The system is useful not only as an approach to optimizing simulations, but also as a means for integrating search techniques and thereby providing the user with the most promising path toward an optimal solution. © 1995 John Wiley & Sons, Inc.  相似文献   
330.
It is shown that two recent results of Baxter and Harche [1] on monotone and balanced optimal assemblies hold only under conditions that are more restrictive than those originally proposed by the authors. We describe such additional conditions, illustrate why they are needed, and establish their sufficiency. We also consider a recent result by Malon [11] and demonstrate that, while the result itself is correct, its two proofs were incomplete. A complete proof of an extension of the result is then suggested. © 1995 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号