全文获取类型
收费全文 | 513篇 |
免费 | 19篇 |
专业分类
532篇 |
出版年
2021年 | 12篇 |
2019年 | 14篇 |
2017年 | 12篇 |
2016年 | 11篇 |
2015年 | 17篇 |
2014年 | 10篇 |
2013年 | 90篇 |
2011年 | 7篇 |
2008年 | 6篇 |
2007年 | 7篇 |
2006年 | 6篇 |
2005年 | 7篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2002年 | 7篇 |
2001年 | 9篇 |
2000年 | 5篇 |
1999年 | 11篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1996年 | 6篇 |
1995年 | 7篇 |
1994年 | 11篇 |
1993年 | 10篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 4篇 |
1989年 | 9篇 |
1988年 | 17篇 |
1987年 | 8篇 |
1986年 | 17篇 |
1985年 | 10篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 11篇 |
1980年 | 5篇 |
1979年 | 13篇 |
1978年 | 8篇 |
1977年 | 10篇 |
1975年 | 10篇 |
1974年 | 11篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 6篇 |
1970年 | 4篇 |
1969年 | 7篇 |
1968年 | 6篇 |
1967年 | 3篇 |
1966年 | 5篇 |
排序方式: 共有532条查询结果,搜索用时 15 毫秒
361.
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. 相似文献
362.
The loading problem we consinder is to assign a set of discrete objects, each having a weight, to a set of boxes, each of which has a capacity limit, in such a way that every object is assigned to a box and the number of boxes used is minimized. A characterization of the assignments is offered and used to develop a set of rules for generating nonredundant assignments. The rules are incorporated into an implicit enumeration algorithm. The algorithm is tested against a very good heuristic. Computational experience shows that the algorithm is highly efficient, solving problems of up to 3600 0-1 variables in a CPU second. 相似文献
363.
The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared. 相似文献
364.
A computationally feasible matrix method is presented to find the first-passage probabilities in a Markov chain where a set of states is taboo during transit. This concept has been used to evaluate the reliability of a system whose changes in strength can be thought of as a Markov chain, while the environment in which it is functioning generates stresses which can also be envisaged as another Markov chain. 相似文献
365.
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. 相似文献
366.
S. Christian Albright 《海军后勤学研究》1980,27(1):17-27
We consider a model with M + N identical machines. As many as N of these can be working at any given time and the others act as standby spares. Working machines fail at exponential rate λ, spares fail at exponential rale γ, and failed machines are repaired at exponential rate μ. The control variables are λ. μ, and the number of removable repairman, S, to be operated at any given time. Using the criterion of total expected discounted cost, we show that λ, S, and μ are monotonic functions of the number of failed machines M, N, the discount factor, and for the finite time horizon model, the amount of time remaining. 相似文献
367.
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. 相似文献
368.
This paper studies the one-period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and into decoupled newsboy problems that represent the realization of demand with the usual associated holding and shortage costs. This approach leads to a characterization of optimal policies in terms of the dual of the transportation problem. This method is not directly suitable for the solution for large problems, but the exact solution for small problems can be obtained. For the numerical solutions of large problems, the problem has been formulated as a linear program with column generation. This latter approach is quite robust in the sense that it is easily extended to incorporate capacity constraints and the multiproduct case. 相似文献
369.
This paper presents a method for modeling cyclic inputs to a congested system in a discrete event digital simulation. Specifically, we express the mean of the interarrival time conditional on the last arrival as a linear combination of harmonic components whose coefficients can be determined by stepwise regression. We also assume that the conditional interarrival time normalized by its corresponding mean follows a distribution that is independent of time. The result can, in turn, be used to generate the desired input for a simulation, An example based on a set of actual data is used to illustrate the process of parameter estimation for the model. 相似文献
370.
We consider the problem of minimizing the sum of production, employment smoothing, and inventory costs over a finite number of time periods where demands are known. The fundamental difference between our model and that treated in [1] is that here we permit the smoothing cost to be nonstationary, thereby admitting a model with discounting. We show that the values of the instrumental variables are nondecreasing in time when demands are nondecreasing. We also derive some asymptotic properties of optimal policies. 相似文献