首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   450篇
  免费   5篇
  2021年   5篇
  2020年   4篇
  2019年   4篇
  2017年   10篇
  2016年   10篇
  2015年   8篇
  2014年   8篇
  2013年   55篇
  2012年   22篇
  2011年   26篇
  2010年   21篇
  2009年   14篇
  2008年   27篇
  2007年   13篇
  2006年   15篇
  2005年   5篇
  2004年   3篇
  2002年   3篇
  2001年   3篇
  1999年   2篇
  1998年   6篇
  1997年   6篇
  1995年   5篇
  1994年   4篇
  1993年   10篇
  1992年   7篇
  1991年   6篇
  1990年   2篇
  1989年   12篇
  1988年   3篇
  1987年   10篇
  1986年   10篇
  1985年   7篇
  1983年   5篇
  1982年   5篇
  1981年   8篇
  1980年   9篇
  1979年   11篇
  1978年   4篇
  1977年   6篇
  1976年   7篇
  1975年   7篇
  1974年   2篇
  1973年   2篇
  1972年   12篇
  1971年   3篇
  1970年   3篇
  1969年   9篇
  1968年   7篇
  1966年   3篇
排序方式: 共有455条查询结果,搜索用时 281 毫秒
331.
332.
333.
In this article, we consider a situation in which a group of facilities need to be constructed in order to serve a given set of customers. However, the facilities cannot guarantee an absolute coverage to any of the customers. Hence, we formulate this problem as one of maximizing the total service reliability of the system subject to a budgetary constraint. For this problem, we develop and test suitable branch-and-bound algorithms and study the effect of problem parameters on solution difficulty. Some generalizations of this problem are also mentioned as possible extensions.  相似文献   
334.
Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associated levels of two scheduling criteria, schedule makespan (Cmax) and maximum job tardiness (Tmax). We present constructive procedures that quantify the trade-off between Cmax and Tmax. The significance of this trade-off is that the optimal solution for any preference function involving only Cmax and Tmax must be contained among the set of efficient schedules that comprise the trade-off curve. For the special case of two-machine flow shops, we present an algorithm that identifies the exact set of efficient schedules. Heruistic procedures for approximating the efficient set are also provided for problems involving many jobs or larger flow shops. Computational results are reported for the procedures which indicate that both the number of efficient schedules and the error incurred by heuristically approximating the efficient set are quite small.  相似文献   
335.
The discrete evasion game with three-move lag, formulated over 30 years ago, was one of the earliest games with time-lag complications. This game remains unsolved even though it is well known that the game has a value. In this article we obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known.  相似文献   
336.
This article considers the efficient scheduling of a fleet of ships engaged in pickup and delivery of bulk cargoes. Our optimization system begins by generating a menu of candidate schedules for each ship. This menu can contain all feasible solutions, which guarantees we will find an optimal solution or can be heuristically limited to contain only those schedules likely to be in an optimal solution. The problem of choosing from this menu an optimal schedule for the fleet is formulated as a set-packing problem and solved with a dual algorithm. Computational experience is presented based on real data obtained from the Military Sealift Command of the U. S. Navy. Run times for this data were reasonable and solutions were generated with the potential of saving up to about $30 million per year over the manual system currently in place. We also describe a color-graphics interface developed to facilitate interaction with the optimization system.  相似文献   
337.
The purpose of this article is to examine the robustness of the modified Beta distribution as a probability distribution of lot fraction defectives in Bayesian acceptance sampling for statistical quality control. In complex manufacturing systems, a production process may consist of multiple production stages in a serial or nonserial fashion. Hence, inputs to a production station can be a result of subassembly of several inputs, or outputs of some inspection stations for some prior work stages. We investigate the effectiveness of the modified Beta distribution as an approximation to the lot fraction defectives probability of inputs at intermediate work stations. The robustness of the modified Beta distribution simplifies both the determination of the optimal sampling plan for acceptance sampling, and the calibration of distributions resulted from subassembly or inspection operations in complex manufacturing systems.  相似文献   
338.
Statistical quality control of complicated production processes subject to a multiplicity of assignable causes may require the utilization of control charts with multiple control limits. This article presents an approximate semieconomic design of such charts, which is easily implementable in practical situations. Evaluations of the semieconomic control chart design show that the proposed approximate method results in solutions that are very close to the true optima and can be obtained with minimal computational effort.  相似文献   
339.
An approximate method for measuring the service levels of the warehouse-retailer system operating under (s, S) policy is presented. All the retailers are identical and the demand process at each retailer follows a stationary stuttering Poisson process. This type of demand process allows customer orders to be for a random number of units, which gives rise to the undershoot quantity at both the warehouse and retailer levels. Exact analyses of the distribution of the undershoot quantity and the number of orders place by a retailer during the warehouse reordering lead time are derived. By using this distribution together with probability approximation and other heuristic approaches, we model the behavior of the warehouse level. Based on the results of the warehouse level and on an existing framework from previous work, the service level at the retailer level is estimated. Results of the approximate method are then compared with those of simulation. © 1995 John Wiley & Sons, Inc.  相似文献   
340.
For infinite-horizon replacement economy problems it is common practice to truncate the problem at some finite horizon. We develop bounds on the error due to such a truncation. These bounds differ from previous results in that they include both revenues and costs. Bounds are illustrated through a numerical example from a real case in vehicle replacement. © 1994 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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