全文获取类型
收费全文 | 394篇 |
免费 | 10篇 |
出版年
2021年 | 12篇 |
2019年 | 8篇 |
2017年 | 9篇 |
2016年 | 8篇 |
2015年 | 11篇 |
2014年 | 9篇 |
2013年 | 71篇 |
2010年 | 2篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 5篇 |
2005年 | 4篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 6篇 |
1998年 | 9篇 |
1997年 | 8篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 8篇 |
1992年 | 7篇 |
1991年 | 8篇 |
1990年 | 2篇 |
1989年 | 7篇 |
1988年 | 16篇 |
1987年 | 6篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1980年 | 6篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 2篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1967年 | 2篇 |
1966年 | 3篇 |
排序方式: 共有404条查询结果,搜索用时 62 毫秒
51.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
52.
53.
Whether or not Colombia has improved is a controversial topic. If improvement has occurred, what, if any, lessons from the Colombian model can be learned? The first lesson is that Colombia's problems were caused more by a weak state than by drugs. The second lesson is that improving state capacity requires more than just increased security. The state must also provide the basic social services that citizens require to gain and maintain their support. Additionally, government institutions need to improve their professionalism, protect human rights, and root out impunity and corruption. The alternative is to suffer from new cycles of violence as old foes are vanquished, but new ones emerge. 相似文献
54.
55.
In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
56.
The present paper provides a proof that the Bayes prediction ordering policy developed in [3] is an optimal policy, in the sense that it minimizes the total expected discounted cost of ordering for any finite planning horizon. 相似文献
57.
Paul S. Dwyer 《海军后勤学研究》1975,22(4):751-775
The general solution process of the Hitchcock transportation problem resulting from the application of the method of reduced matrices may give solutions with some negative xij values. This paper is devoted to a review of the reduced matrices method, an examination of suitable interpretation of sets of xij which include some negative values, and ways of interpreting these values in useful modifications of the Hitchcock problem. Such modifications include a) the reshipment problem, b) the overshipment problem, and c) the transshipment problem. Techniques are developed for determining and eliminating cij which are not optimal. These techniques and results are useful in solving the problems indicated above. The natural applicability of the simple and general method of reduced matrices is emphasized. 相似文献
58.
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. 相似文献
59.
This paper describes a linear programming model used to perform cost-effectiveness analysis to determine the requirements for military strategic mobility resources. Expenditures for three classes of economic alternatives are considered: purchase of transportation resources; prepositioning of material; and augmentation of port facilities. The mix of economic alternatives that maximizes the effectiveness of the resultant transportation system is determined for a given investment level. By repeating the analysis for several levels of investment, a cost-effectiveness tradeoff curve can be developed. 相似文献
60.
We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001 相似文献