首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   286篇
  免费   5篇
  2021年   4篇
  2019年   8篇
  2018年   5篇
  2017年   4篇
  2015年   3篇
  2014年   4篇
  2013年   44篇
  2010年   4篇
  2009年   3篇
  2008年   6篇
  2006年   2篇
  2005年   2篇
  2004年   5篇
  2003年   4篇
  2002年   3篇
  2001年   4篇
  2000年   4篇
  1998年   5篇
  1997年   4篇
  1996年   9篇
  1995年   4篇
  1994年   2篇
  1993年   4篇
  1992年   5篇
  1991年   8篇
  1990年   5篇
  1989年   8篇
  1988年   8篇
  1987年   7篇
  1986年   7篇
  1985年   6篇
  1984年   6篇
  1983年   2篇
  1982年   4篇
  1981年   5篇
  1980年   10篇
  1979年   4篇
  1978年   6篇
  1977年   4篇
  1976年   5篇
  1975年   6篇
  1974年   4篇
  1973年   2篇
  1972年   3篇
  1971年   8篇
  1970年   4篇
  1969年   4篇
  1968年   5篇
  1967年   4篇
  1966年   6篇
排序方式: 共有291条查询结果,搜索用时 46 毫秒
201.
In multi-commodity inventory systems with variable setup costs, the mixed ordering policy assumes that commodities may be ordered either individually, or may be arbitrarily grouped for joint ordering. Thus, for a two-commodity system, commodity one or commodity two or commodities one and two may be ordered incurring respectively fixed order costs of K, K1, or K2, where max (K1, K2) ≤ K ≤ K1 + K2, This paper considers a two-commodity periodic review system. The stationary characteristics of the system are analyzed, and, for a special case, explicit solutions are obtained for the distribution of the stock levels at the beginning of the periods. In a numerical example, optimal policy variables are computed, and the mixed ordering policy is compared with individual and joint ordering policies.  相似文献   
202.
This paper considers the two different flow shop scheduling problems that arise when, in a two machine problem, one machine is characterized by sequence dependent setup times. The objective is to determine a schedule that minimizes makespan. After establishing the optimally of permutation schedules for both of these problems, an efficient dynamic programming formulation is developed for each of them. Each of these formulations is shown to be comparable, from a computational standpoint, to the corresponding formulation of the traveling salesman problem. Then, the relative merits of the dynamic programming and branch and bound approaches to these two scheduling problems are discussed.  相似文献   
203.
The paper consists essentially of two parts. In the first part a linear economic impact model is presented whose structure is based on subcontracting flows. The structural coefficients are defined in terms of flows per area. The model is derived from two identities that are analogous to the income and expenditure identities of national income accounting. The parameters are prime contracts and when one or several of the prime contracts are changed, the model determines the impacts of such changes on the various regions that have been selected. The impacts can be combined with regional multipliers to derive changes in regional income and regional employment. Fragmentary data for this kind of model have been collected on a one-time basis by DOD in 1965 and some results based on the data are presented. The second part of the paper is concerned with normative economics. A scheme is suggested, called compensated procurement, that outlines how the Department of Defense might employ the impact model in a macroeconomic setting. The basic idea is that a stabilization fund be established to finance an array of potential projects which are contracted for to balance sudden shifts in defense demand. Only short-run stabilization is advocated.  相似文献   
204.
This paper analyses the E/M/c queueing system and shows how to calculate the expected number in the system, both at a random epoch and immediately preceding an arrival. These expectations are expressed in terms of certain initial probabilities which are determined by linear equations. The advantages and disadvantages of this method are also discussed.  相似文献   
205.
Consider a set of task pairs coupled in time: a first (initial) and second (completion) tasks of known durations with a specified time between them. If the operator or machine performing these tasks is able to process only one at a time, scheduling is necessary to insure that no overlap occurs. This problem has a particular application to production scheduling, transportation, and radar operations (send-receive pulses are ideal examples of time-linked tasks requiring scheduling). This article discusses several candidate techniques for schedule determination, and these are evaluated in a specific radar scheduling application.  相似文献   
206.
In this paper we propose a method for estimating reliability growth (or deterioration) using time series analysis. Our method does not call for the specification of a particular model, and estimates the growth in the presence of periodicity. We illustrate our procedure by considering some binomial failure data generated during the testing of a large system of the U.S. Navy.  相似文献   
207.
For a linear fractional programming problem, Sharma and Swarup have constructed a dual problem, also a linear fractional program, in which the objective functions of both primal and dual problems are the same. Craven and Mond have extended this result to a nonlinear fractional programming problem with linear constraints, and a dual problem for which the objective function is the same as that of the primal. This theorem is now further extended from linear to differentiable convex constraints.  相似文献   
208.
209.
210.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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