首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   569篇
  免费   44篇
  613篇
  2021年   16篇
  2019年   20篇
  2018年   10篇
  2017年   11篇
  2016年   12篇
  2015年   12篇
  2014年   13篇
  2013年   97篇
  2009年   8篇
  2008年   8篇
  2007年   7篇
  2006年   6篇
  2005年   11篇
  2004年   10篇
  2003年   6篇
  2002年   7篇
  2000年   10篇
  1999年   24篇
  1998年   26篇
  1997年   28篇
  1996年   10篇
  1995年   6篇
  1994年   15篇
  1993年   8篇
  1992年   9篇
  1991年   16篇
  1990年   6篇
  1989年   12篇
  1988年   7篇
  1987年   14篇
  1986年   8篇
  1985年   6篇
  1984年   5篇
  1983年   9篇
  1982年   11篇
  1981年   5篇
  1980年   7篇
  1979年   11篇
  1978年   7篇
  1977年   8篇
  1976年   7篇
  1975年   7篇
  1974年   7篇
  1973年   12篇
  1972年   6篇
  1971年   6篇
  1970年   7篇
  1969年   6篇
  1968年   5篇
  1967年   5篇
排序方式: 共有613条查询结果,搜索用时 0 毫秒
51.
The Joint Replenishment Problem (JRP) involves production planning for a family of items. The items have a coordinated cost structure whereby a major setup cost is incurred whenever any item in the family is produced, and an item-specific minor setup cost is incurred whenever that item is produced. This paper investigates the performance of two types of cyclical production schedules for the JRP with dynamic demands over a finite planning horizon. The cyclical schedules considered are: (1) general cyclical schedules—schedules where the number of periods between successive production runs for any item is constant over the planning horizon—and (2) power-of-two schedules—a subset of cyclical schedules for which the number of periods between successive setups must be a power of 2. The paper evaluates the additional cost incurred by requiring schedules to be cyclical, and identifies problem characteristics that have a significant effect on this additional cost. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 577–589, 1997.  相似文献   
52.
讨论了基于价格/风险模型制订网络安全策略的方法和步骤,并指出了安全策略实施过程中应注意的问题。  相似文献   
53.
An approximation for analyzing transient and nonstationary two-priority non-preemptive queueing systems is presented. This system has a three-dimensional state space, and through use of state-space partitioning in conjunction with use of conditional surrogate distributions with constant parameters an approximation is designed. Regardless of system capacity K, the approximation requires the numerical solution of only ten differential equations, compared to the K2 + K+1 Kolmogorov-forward equations required for the classic solution. Time-dependent approximations of the mean number of entities of type i and of the probability of a type-i entity being in service are obtained. Empirical test results over a wide range of systems indicate the approximation is quite accurate.  相似文献   
54.
The methodology of determining simultaneous visibility probabilities and points on line segments is extended to problems of three-dimensional spaces, with Poisson random fields of obscuring spheres. Required functions are derived analytically and a numerical example is given for a special case of a standard Poisson field, with uniform distribution of sphere diameters.  相似文献   
55.
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts.  相似文献   
56.
The problem of sequencing jobs on parallel processors when jobs have different available times, due dates, penalty costs and waiting costs is considered. The processors are identical and are available when the earliest job becomes available and continuously thereafter. There is a processor cost during the period when the processor is available for processing jobs. The proposed algorithm finds the sequence (or sequences) with minimum total cost (sum of waiting, penalty and processor costs.). A proof of the algorithm and numerical results are given.  相似文献   
57.
Classical inventory models generally assume either no backlogging of demands or unlimited backlogging. This paper treats the case wherein backlogged customers are willing to wait for a random period of time for service. A broad class of such models is discussed, with a more complete analysis performed on a simple subclass. Steady state equations are derived and solved assuming exponentially distributed interarrival times of customers, order delivery lead times, and customer patience.  相似文献   
58.
Computerized Scheduling of Seagoing Tankers The tanker scheduling problem considered in this paper is that of the Defense Fuel Supply Center (DFSC) and the Military Sealift Command (MSC) in the worldwide distribution of bulk petroleum products. Routes and cargoes which meet delivery schedule dates for a multiplicity of product requirements at minimum cost are to be determined for a fleet of tankers. A general mathematical programming model is presented, and then a mixed integer model is developed which attempts to reflect the true scheduling task of DFSC and MSC as closely as possible. The problem is kept to within a workable size by the systematic construction of a set of tanker routes which does not contain many possible routes that can be judged unacceptable from practical considerations alone.  相似文献   
59.
In this paper we address the question of deriving deep cuts for nonconvex disjunctive programs. These problems include logical constraints which restrict the variables to at least one of a finite number of constraint sets. Based on the works of Balas. Glover, and Jeroslow, we examine the set of valid inequalities or cuts which one may derive in this context, and defining reasonable criteria to measure depth of a cut we demonstrate how one may obtain the “deepest” cut. The analysis covers the case where each constraint set in the logical statement has only one constraint and is also extended for the case where each of these constraint sets may have more than one constraint.  相似文献   
60.
The bounded interval generalized assignment model is a “many-for-one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources-to-uses transportation model are also discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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