全文获取类型
收费全文 | 523篇 |
免费 | 17篇 |
专业分类
540篇 |
出版年
2021年 | 11篇 |
2020年 | 5篇 |
2019年 | 22篇 |
2018年 | 10篇 |
2017年 | 15篇 |
2016年 | 16篇 |
2015年 | 14篇 |
2014年 | 13篇 |
2013年 | 111篇 |
2011年 | 5篇 |
2009年 | 9篇 |
2008年 | 7篇 |
2007年 | 5篇 |
2006年 | 5篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 6篇 |
2002年 | 6篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 15篇 |
1996年 | 7篇 |
1994年 | 10篇 |
1992年 | 4篇 |
1991年 | 14篇 |
1990年 | 4篇 |
1989年 | 7篇 |
1988年 | 7篇 |
1987年 | 14篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 8篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 11篇 |
1978年 | 8篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 7篇 |
1973年 | 12篇 |
1972年 | 6篇 |
1971年 | 6篇 |
1970年 | 7篇 |
1969年 | 6篇 |
1968年 | 5篇 |
1967年 | 5篇 |
排序方式: 共有540条查询结果,搜索用时 15 毫秒
21.
The bounded interval generalized assignment model is a “many-for-one” assignment model. Each task must be assigned to exactly one agent; however, each agent can be assigned multiple tasks as long as the agent resource consumed by performing the assigned tasks falls within a specified interval. The bounded interval generalized assignment model is formulated, and an algorithm for its solution is developed. Algorithms for the bounded interval versions of the semiassignment model and sources-to-uses transportation model are also discussed. 相似文献
22.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
23.
Carl M. Harris 《海军后勤学研究》1976,23(4):653-662
This paper considers a traffic problem in which vehicles queue up according to a Poisson process on a single-lane entrance ramp prior to merging into a major stream of vehicular traffic. In order to then prevent the ramp queue from becoming too large, a model is proposed which considers a lowering of the critical gap as the ramp queue size increases. With the critical gap assumed to be a nonincreasing function of the number of vehicles on the ramp at instances that correspond to departure times of lead vehicles from the ramp queue, the resultant model is an M/G/1 queue with state-dependent service times. Some general results are obtained for this model and a specific case discussed in moderate detail. 相似文献
24.
In this paper we discuss the properties of a Bilinear Programming problem, and develop a convergent cutting plane algorithm. The cuts involve only a subset of the variables and preserve the special structure of the constraints involving the remaining variables. The cuts are deeper than other similar cuts. 相似文献
25.
M. K. Rajaraman 《海军后勤学研究》1977,24(3):473-481
The problem of sequencing jobs on parallel processors when jobs have different available times, due dates, penalty costs and waiting costs is considered. The processors are identical and are available when the earliest job becomes available and continuously thereafter. There is a processor cost during the period when the processor is available for processing jobs. The proposed algorithm finds the sequence (or sequences) with minimum total cost (sum of waiting, penalty and processor costs.). A proof of the algorithm and numerical results are given. 相似文献
26.
Under a free-replacement warranty of duration W, the customer is provided, for an initial cost of C, as many replacement items as needed to provide service for a period W. Payments of C are not made at fixed intervals of length W, but in random cycles of length Y = W + γ(W), where γ(W) is the (random) remaining life-time of the item in service W time units after the beginning of a cycle. The expected number of payments over the life cycle, L, of the item is given by MY(L), the renewal function for the random variable Y. We investigate this renewal function analytically and numerically and compare the latter with known asymptotic results. The distribution of Y, and hence the renewal function, depends on the underlying failure distribution of the items. Several choices for this distribution, including the exponential, uniform, gamma and Weibull, are considered. 相似文献
27.
The hyperbolic integer program is treated as a special case of a hyperbolic program with a finite number of feasible points. The continuous hyperbolic program also belongs to this class since its solution can be obtained by considering only the extreme points of the feasible set. A general algorithm for solving the hyperbolic integer program which reduces to solving a sequence of linear integer problems is proposed. When the integer restriction is removed, this algorithm is similar to the Isbell-Marlow procedure. The geometrical aspects of the hyperbolic problem are also discussed and several cutting plane algorithms are given. 相似文献
28.
M. S. Bazaraa 《海军后勤学研究》1973,20(2):357-366
In this study we interpret the exterior penalty function method as a generalized lagrangian metliod which fills duality gaps in nonconvex problems. Geometry and resolution of these gaps from a duality point of view are highlighted. 相似文献
29.
Under certain conditions, the re-supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction. 相似文献
30.
M. E. Nightengale 《海军后勤学研究》1970,17(4):507-514
Frequently there exists an insufficient amount of actual data upon which to base a decision. In this paper a method is presented whereby the subjective opinions of a group of qualified persons are utilized to quantify the relative importance of a finite number of parameters or objectives. A means of testing the consistency among the judges is given which allows the decision maker to determine the validity of the opinions gathered. The application presented here is in the area of Multiple Incentive Contracting. Namely, a method is proposed to facilitate the answering of the question, “What is the value to the purchaser of an incremental change in the performance of a system?” Such a vehicle is not essential to the methodology proposed. 相似文献