全文获取类型
收费全文 | 165篇 |
免费 | 11篇 |
出版年
2021年 | 3篇 |
2020年 | 3篇 |
2019年 | 8篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 2篇 |
2013年 | 24篇 |
2011年 | 5篇 |
2009年 | 2篇 |
2008年 | 2篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 5篇 |
2003年 | 3篇 |
2002年 | 2篇 |
2001年 | 3篇 |
1999年 | 9篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 6篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 3篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 4篇 |
1972年 | 1篇 |
1971年 | 4篇 |
1969年 | 2篇 |
1968年 | 3篇 |
1967年 | 1篇 |
1966年 | 2篇 |
1948年 | 1篇 |
排序方式: 共有176条查询结果,搜索用时 15 毫秒
121.
In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
122.
In this article we consider the unweighted m-center problem with rectilinear distance. We preent an O(nm–2 log n) algorithm for the m-center problem where m ≥ 4. 相似文献
123.
A two-dimensional state space Markov Model of a Manpower System with special structure is analyzed. Examples are given from the military services. The probabilistic properties are discussed in detail with emphasis on computation. The basic equations of manpower stocks and flows are analyzed. 相似文献
124.
T. U. Zahle 《海军后勤学研究》1971,18(2):283-293
To find the hit probability for a series of correlated shots is, with conventional methods, a very tedious job even for the simplest statistical distributions. Experimental data, however, commonly show the shots lying chain-like on smooth curves about the target. For this case this paper introduces a new method of finding the hit probability without the use of correlation coefficients. The method is based on a transformation, where the target is transformed into a point and each bullet into an area the size of the target. 相似文献
125.
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. 相似文献
126.
127.
We consider the problem of temporal expansion of the capacity of, say, a plant or road given estimates of its desired usage (demand). The basic problem is: given a sequence of predicted demands for N time periods, determine the optimal investment decision in each period to minimize a linear investment cost and a strictly convex cost of capacity. The relationship between capacity and the investment decisions is assumed to be linear, but time varying. Constraints on both the individual decisions and on the sum of the decisions are considered. An algorithm for solving this problem is derived. 相似文献
128.
129.
“Relevation” is the name given by Krakowski to the distribution of failure time of a replacement from an aging stock. The present authors have extended this concept to include (i) hierarchal replacement systems and (ii) dependence between lifetimes of original and replacement items. In this article, we present some further developments, including first steps toward a synthesis of (i) and (ii). 相似文献
130.
From an original motivation in quantitative inventory modeling, we develop methods for testing the hypothesis that the service times of an M/G/1 queue are exponentially distributed, given a sequence of observations of customer line and/or system waits. The approaches are mostly extensions of the well-known exponential goodness-of-fit test popularized by Gnedenko, which results from the observation that the sum of a random exponential sample is Erlang distributed and thus that the quotient of two independent exponential sample means is F distributed. 相似文献