全文获取类型
收费全文 | 170篇 |
免费 | 2篇 |
出版年
2020年 | 3篇 |
2019年 | 7篇 |
2018年 | 8篇 |
2017年 | 5篇 |
2016年 | 5篇 |
2015年 | 5篇 |
2014年 | 3篇 |
2013年 | 61篇 |
2012年 | 2篇 |
2011年 | 1篇 |
2010年 | 1篇 |
2009年 | 1篇 |
2008年 | 3篇 |
2007年 | 1篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 4篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1982年 | 3篇 |
1980年 | 2篇 |
1975年 | 2篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1968年 | 2篇 |
1966年 | 1篇 |
排序方式: 共有172条查询结果,搜索用时 15 毫秒
61.
Recent efforts to improve lower bounds in implicit enumeration algorithms for the general (n/m/G/Fmax) sequencing problem have been directed to the solution of an auxiliary single machine problem that results from the relaxation of some of the interference constraints. We develop an algorithm that obtains optimal and near optimal solutions for this relaxed problem with relatively little computational effort. We report on computational results achieved when this method is used to obtain lower bounds for the general problem. Finally, we show the equivalence of this problem to a single machine sequencing problem with earliest start and due date constraints where the objective is to minimize the maximum lateness. 相似文献
62.
Paul Zipkin 《海军后勤学研究》1986,33(4):763-774
This paper shows that one of the fundamental results of inventory theory is valid under conditions much broader than those treated previously. The result characterizes the distributions of inventory level and inventory position in the standard, continuous-time model with backorders, and leads to the relatively easy calculation of key performance measures. We treat both fixed and random leadtimes, and we examine both stationary and limiting distributions under different assumptions. We consider demand processes described by several general classes of compound-counting processes and a variety of order policies. For the stochastic-leadtime case we provide the first explicit proof of the result, assuming the leadtimes are generated according to a specific, but plausible, scenario. 相似文献
63.
64.
65.
Paul Meyer James 《海军后勤学研究》1968,15(3):459-468
Learning curves have been used extensively to predict future costs in the airframe and other industries. This paper deals with the effect of perturbations induced by design changes on the learning curves. Equations that are developed and applied make it possible to predict future costs accurately in a perturbed environment. The formulations can be used effectively in EDP programs. 相似文献
66.
67.
68.
69.
We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual‐variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K ‐shortest paths finding algorithm that may be efficient in many real cases. An application in hazardous materials transportation is discussed, and the solution methods are illustrated by numerical examples. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
70.