首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   240篇
  免费   10篇
  250篇
  2020年   3篇
  2019年   13篇
  2018年   9篇
  2017年   4篇
  2016年   8篇
  2015年   7篇
  2014年   7篇
  2013年   75篇
  2011年   8篇
  2010年   2篇
  2009年   3篇
  2008年   4篇
  2007年   7篇
  2006年   2篇
  2005年   5篇
  2004年   2篇
  2003年   3篇
  2002年   4篇
  2001年   3篇
  1999年   5篇
  1998年   1篇
  1997年   3篇
  1996年   3篇
  1995年   3篇
  1994年   6篇
  1993年   3篇
  1992年   4篇
  1991年   3篇
  1990年   3篇
  1989年   4篇
  1988年   4篇
  1987年   4篇
  1986年   1篇
  1985年   2篇
  1984年   1篇
  1983年   3篇
  1981年   1篇
  1979年   2篇
  1978年   1篇
  1976年   1篇
  1975年   2篇
  1974年   1篇
  1973年   3篇
  1972年   4篇
  1971年   2篇
  1970年   3篇
  1969年   1篇
  1968年   2篇
  1967年   1篇
  1966年   1篇
排序方式: 共有250条查询结果,搜索用时 7 毫秒
31.
The sword which is the subject of this article and which will be referred to as the Capel sword, is a fine example of what has become known as an Irish basket-hilt. Whilst there are other examples in existence, what makes this sword unique and particularly important is the fact that it is known to have been owned by two important Royalist military leaders, Lord Arthur Capel and Sir John Owen. These two extraordinary men came from different backgrounds but their fate was linked through circumstances beyond their control. The story this sword tells is one of comradeship, loyalty, total belief in a cause, betrayal and ultimate sacrifice.  相似文献   
32.
This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016  相似文献   
33.
In this note we consider the familiar bin-packing problem and provide new worst-case results for a number of classical heuristics. We show that the first-fit and best-fit heuristics have an absolute performance ratio of no more than 1.75, and first-fit decreasing and best-fit decreasing heuristics have an absolute performance ratio of 1.5. The latter is the best possible absolute performance ratio for the bin-packing problem, unless P = NP. © 1994 John Wiley & Sons, Inc.  相似文献   
34.
35.
We develop a simple algorithm, which does not require convolutions, for computing the distribution of the residual life when the renewal process is discrete. We also analyze the algorithm for the particular case of lattice distributions, and we show how it can apply to an inventory problem. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 435–443, 1999  相似文献   
36.
In this article we present a queueing-location problem where a location of a service station has to be determined. The two main results of this article are a convexity proof for general distances and a theorem that limits the area in the plane where the solution can lie. We also propose some solution procedures.  相似文献   
37.
The reliability of weapons in combat has been treated by Bhashyam in the context of a stochastic duel characterized by fixed ammunition supplies. negative exponentially distributed firing times and weapon lifetimes, and a fixed number of spare weapons for each duelist. The present paper takes a different approach by starting with the fundamental duel of Ancker and Williams, characterized by unlimited ammunition and by ordinary renewal firing times, and adding to it weapon lifetimes which can be functions of time or of round position in the firing sequence. Probabilities of winning and tieing are derived and it is shown that under certain conditions the weapon lifetimes are equivalent to random time and ammunition limits.  相似文献   
38.
This paper considers the production of two products with known demands over a finite set of periods. The production and inventory carrying costs for each product are assumed to be concave. We seek the minimum cost production schedule meeting all demands, without backlogging, assuming that at most one of the two products can be produced in any period. The optimization problem is first stated as a nonlinear programming problem, which allows the proof of a result permitting the search for the optimal policy to be restricted to those which produce a product only when its inventory level is zero. A dynamic programming formulation is given and the model is then formulated as a shortest route problem in a specially constructed network.  相似文献   
39.
The nonlinear difference equation for the distribution of the busy period for an unbounded discrete time queue of M|G| 1 type is solved numerically by a monotone iterative procedure. A starting solution is found by computing a first passage time distribution in a truncated version of the queue.  相似文献   
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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