首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   688篇
  免费   2篇
  690篇
  2019年   14篇
  2018年   8篇
  2017年   12篇
  2016年   9篇
  2015年   12篇
  2014年   10篇
  2013年   112篇
  2010年   7篇
  2009年   7篇
  2008年   7篇
  2007年   7篇
  2004年   11篇
  2003年   9篇
  2002年   8篇
  2001年   10篇
  2000年   8篇
  1999年   7篇
  1998年   12篇
  1997年   13篇
  1996年   14篇
  1995年   15篇
  1994年   15篇
  1993年   14篇
  1992年   17篇
  1991年   18篇
  1990年   10篇
  1989年   13篇
  1988年   16篇
  1987年   15篇
  1986年   9篇
  1985年   14篇
  1984年   15篇
  1983年   8篇
  1982年   9篇
  1981年   14篇
  1980年   14篇
  1979年   14篇
  1978年   11篇
  1977年   9篇
  1976年   11篇
  1975年   13篇
  1974年   11篇
  1973年   8篇
  1972年   12篇
  1971年   12篇
  1970年   7篇
  1969年   8篇
  1968年   10篇
  1967年   9篇
  1966年   8篇
排序方式: 共有690条查询结果,搜索用时 15 毫秒
311.
312.
We analyze a dual-sourcing inventory model with exponential lead times and constant unit demand in which the order quantity is split in some proportion between two sources of supply. Unlike earlier studies, we do not require that the two sources be identical in terms of the lead-time parameters or the supply prices. We compare the expected total annual costs for the two-source and the traditional single-source models over a wide range of parameter values. We confirm the findings of earlier studies that, under stochastic lead times, dual sourcing yields savings in holding and shortage costs that could outweigh the incremental ordering costs. With this more general model, we demonstrate that savings from dual sourcing are possible even where the mean or the variability of the second source is higher. © 1993 John Wiley & Sons, Inc.  相似文献   
313.
If the processing time of each job in a flow shop also depends on the time spent prior to processing, then the choice of a sequence influences processing times. This nonstandard scheduling problem is studied here for the minimum makespan schedule in a flow shop with two machines. The problem is NP-hard in the strong sense and already contains the main features of the general case [10]. Restricting to the case of permutation schedules, we first determine the optimal release times of the jobs for a given sequence. Permutation schedules are evaluated for this optimal policy, and the scheduling problem is solved using branch-and-bound techniques. We also show the surprising result that the optimal schedule may not be a permutation schedule. Numerical results on randomly generated data are provided for permutation schedules. Our numerical results confirm our preliminary study [10] that fairly good approximate solutions can efficiently be obtained in the case of limited computing time using the heuristics due to Gilmore and Gomory [7]. © 1993 John Wiley & Sons, Inc.  相似文献   
314.
315.
316.
317.
Many attempts have been made in the past to obtain estimates for the weights and ratings values of a multicriteria linear utility function. In particular, the problem arises when both criteria importance and alternatives' ratings are expressed in a qualitative ordinal manner. This article proposes an extreme-point approach for obtaining the overall ratings in the presence of ordinal preferences both for the criteria importance and the alternatives' rankings. In particular it is shown that Borda's method of scores is obtained as a special case. © 1996 John Wiley & Sons, Inc.  相似文献   
318.
In this paper we consider a multiperiod deterministic capacity expansion and shipment planning problem for a single product. The product can be manufactured in several producing regions and is required in a number of markets. The demands for each of the markets are non-decreasing over time and must be met exactly during each time period (i.e., no backlogging or inventorying for future periods is permitted). Each region is assumed to have an initial production capacity, which may be increased at a given cost in any period. The demand in a market can be satisfied by production and shipment from any of the regions. The problem is to find a schedule of capacity expansions for the regions and a schedule of shipments from the regions to the markets so as to minimize the discounted capacity expansion and shipment costs. The problem is formulated as a linear programming model, and solved by an efficient algorithm using the operator theory of parametric programming for the transporation problem. Extensions to the infinite horizon case are also provided.  相似文献   
319.
A manpower planning model is presented that exploits the longitudinal stability of manpower cohorts. The manpower planning process is described. An infinite horizon linear program for calculating minimum cost manpower input plans is presented and found to have a straightforward solution in a great many cases and to yield an easily implemented approximation technique in other cases.  相似文献   
320.
This work is concerned with constructing, analyzing, and finding “mobility chains” for bimatrix games, sequences of equilibrium points along which it is possible for the two players to progress, one equilibrium point at a time, to an equilibrium point that is preferred by both players. The relationship between mobility chains and Nash subsets is established, and some properties of maximal Nash subsets are proved.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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