首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   913篇
  免费   2篇
  915篇
  2021年   14篇
  2019年   29篇
  2018年   19篇
  2017年   20篇
  2016年   20篇
  2015年   20篇
  2014年   11篇
  2013年   166篇
  2011年   8篇
  2009年   9篇
  2008年   8篇
  2007年   11篇
  2006年   11篇
  2005年   15篇
  2004年   16篇
  2003年   10篇
  2002年   8篇
  2000年   14篇
  1999年   10篇
  1998年   12篇
  1997年   24篇
  1996年   19篇
  1994年   18篇
  1993年   7篇
  1992年   11篇
  1991年   22篇
  1990年   12篇
  1989年   19篇
  1988年   12篇
  1987年   21篇
  1986年   16篇
  1985年   16篇
  1984年   12篇
  1983年   15篇
  1982年   13篇
  1981年   13篇
  1980年   16篇
  1979年   17篇
  1978年   14篇
  1977年   15篇
  1976年   14篇
  1975年   12篇
  1974年   18篇
  1973年   18篇
  1972年   15篇
  1971年   19篇
  1970年   9篇
  1969年   11篇
  1968年   10篇
  1967年   8篇
排序方式: 共有915条查询结果,搜索用时 0 毫秒
221.
    
In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
222.
    
This study presents power‐of‐two policies for a serial inventory system with constant demand rate and incremental quantity discounts at the most upstream stage. It is shown that an optimal solution is nested and follows a zero‐inventory ordering policy. To prove the effectiveness of power‐of‐two policies, a lower bound on the optimal cost is obtained. A policy that has a cost within 6% of the lower bound is developed for a fixed base planning period. For a variable base planning period, a 98% effective policy is provided. An extension is included for a system with price dependent holding costs. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
223.
    
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011  相似文献   
224.
    
A general class of continuous time nonlinear problems is considered. Necessary and sufficient conditions for the existence of solutions are established and optimal solutions are characterized in terms of a duality theorem. The theory is illustrated by means of an example.  相似文献   
225.
    
In this paper, a branch-and-bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size.  相似文献   
226.
    
Manning the nation's armed services will continue to be a crucial issue for the remainder of the 1980s. With the projected growth of the services during this decade, the downturn in the 17–21-year-old male population, and the possible upturn in the economy, the ability of the services to meet their respective quality and quantity recruiting goals becomes of central concern. The accurate estimation of the supply for various types of recruits becomes especially important when one views the nearly $1 billion budgeted annually for recruiting and the impact that any military pay raises can have on the DOD's manpower costs of over $40 billion annually. In addition, perceived difficulties in recruiting can impact on weapon systems design decisions, authorized manning levels, and exacerbate the debate concerning the draft; hence, it is clear that few issues today warrant more attention than improving the efficiency and effectiveness of military recruiting. This article provides an introduction and review of some of the key issues involved in modeling and estimating the supply of military recruits. It summarizes and compares the findings of selected econometric models, all of which are based on enlistment experience since the introduction of the All-Volunteer Force in 1973. It also presents some new insights and directions for research dealing with simultaneity, validation, generation of rigorous confidence intervals, and data base selection. It concludes by listing some of the research needs to be addressed in the future.  相似文献   
227.
    
SALET EA 《Military review》1948,27(11):24-34
  相似文献   
228.
229.
    
Although industry is expected to design hardware to fit into a general support system and to be capable of arguing life-cycle system costs, adequate information has not been available on the support system in terms of policies and operating decision rules. Policies and operating decisions by users dominate engineering design decisions in determining life-cycle support costs. The relative effect of each of these decision areas on support costs has yet to be resolved empirically. Without an understanding of the sensitivity of support costs to alternative designs, capability is limited in design improvement and support of end items. Life-cycle costing of analysis under cost-effectiveness and the maintainability of integrated logistics support is open to question.  相似文献   
230.
    
The intent of this paper is to demonstrate that the theory of stationary point processes is a useful tool for the analysis of stationary inventory systems. In conventional inventory theory, the equilibrium distributions for a specified inventory policy are obtained, whenever possible, by recursive or limiting procedures, or both. A different and more direct approach, based on stationary point processes, is proposed here. The time instants at which stock delivery is effected are viewed as points of the stationary point process, which possesses uniform statistical properties on the entire real axis; hence the equilibrium statistics of the inventory process can be calculated directly. In order to best illustrate this approach, various examples are given, including some that constitute new results.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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