全文获取类型
收费全文 | 600篇 |
免费 | 17篇 |
出版年
2019年 | 7篇 |
2018年 | 11篇 |
2017年 | 15篇 |
2016年 | 16篇 |
2015年 | 10篇 |
2014年 | 8篇 |
2013年 | 150篇 |
2011年 | 5篇 |
2010年 | 5篇 |
2009年 | 5篇 |
2007年 | 6篇 |
2005年 | 9篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2001年 | 7篇 |
2000年 | 7篇 |
1999年 | 9篇 |
1998年 | 9篇 |
1997年 | 13篇 |
1996年 | 7篇 |
1995年 | 12篇 |
1994年 | 15篇 |
1993年 | 15篇 |
1992年 | 14篇 |
1991年 | 14篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 9篇 |
1987年 | 14篇 |
1986年 | 5篇 |
1985年 | 9篇 |
1984年 | 10篇 |
1983年 | 6篇 |
1982年 | 7篇 |
1981年 | 11篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 6篇 |
1976年 | 9篇 |
1975年 | 10篇 |
1974年 | 10篇 |
1973年 | 6篇 |
1972年 | 11篇 |
1971年 | 9篇 |
1970年 | 5篇 |
1969年 | 5篇 |
1968年 | 7篇 |
1967年 | 6篇 |
排序方式: 共有617条查询结果,搜索用时 15 毫秒
71.
72.
Roger C. Schroeder 《海军后勤学研究》1974,21(3):375-388
Most inventory formulations seek to minimize the sum of ordering costs, holding costs, and stockout costs: however, management often directs inventory policy by specifying a maximum investment level and/or a purchasing budget constraint. Within these limitations, they expect lower level managers to optimize some level of customer satisfaction, such as minimum stockouts or minimum shortages. The author has developed several cases of these “managerial” inventory formulations and has presented some computational results. 相似文献
73.
Least squares estimators of the parameters of the generalized Eyring Model are obtained by using data from censored life tests conducted at several accelerated environments. These estimators are obtained after establishing that the Gauss-Markov conditions for least squares estimation are satisfied. Confidence intervals for the hazard rate at use conditions are obtained after empirically showing that the logarithm of the estimate of the hazard rate at use conditions is approximately normally distributed. The coverage probabilities of the confidence intervals are also verified by a Monte Carlo experiment. The techniques are illustrated by an application to some real data. 相似文献
74.
Johnson [2] in 1954 solved the two machine flow shop problem by giving an argument for a sufficient condition of optimality and by stating an efficient algorithm which produces a solution via satisfaction of the sufficient condition. Moreover, Johnson solved two special cases of the corresponding three machine flow shop problem. Since that time, six other special cases have been solved, two contributed by Arthanari and Mukhopadhyay [1], two by Smith, Panwalkar, and Dudek [3], and two of a different nature by Szwarc [5]. This paper contributes an extension to one of the classes described by Szwarc. 相似文献
75.
Kailash C. Kapur 《海军后勤学研究》1973,20(4):639-644
Necessary and sufficient conditions for max-min problems are given here. In addition to characterization of directional derivatives of the relevant functions, subdifferentiability set for such functions is characterized. 相似文献
76.
Models are formulated for determining continuous review (Q, r) policies for a multiitem inventory subject to constraints. The objective function is the minimization of total time-weighted shortages. The constraints apply to inventory investment and reorder workload. The formulations are thus independent of the normal ordering, holding, and shortage costs. Two models are presented, each representing a convex programming problem. Lagrangian techniques are employed with the first, simplified model in which only the reorder points are optimized. In the second model both the reorder points and the reorder quantities are optimized utilizing penalty function methods. An example problem is solved for each model. The final section deals with the implementation of these models in very large inventory systems. 相似文献
77.
Rendezvous search finds the strategies that players should use in order to find one another when they are separated in a region. Previous papers have concentrated on the case where there are two players searching for one another. This paper looks at the problem when there are more than two players and concentrates on what they should do if some but not all of them meet together. It looks at two strategies—the stick together one and the split up and meet again one. This paper shows that the former is optimal among the class of strategies which require no memory and are stationary, and it gives a method of calculating the expected rendezvous time under it. However, simulation results comparing both strategies suggest that in most situations the split up and meet again strategy which requires some memory leads to faster expected rendezvous times. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:710–721, 2001 相似文献
78.
79.
We consider a reader—writer system consisting of a single server and a fixed number of jobs (or customers) belonging to two classes. Class one jobs are called readers and any number of them can be processed simultaneously. Class two jobs are called writers and they have to be processed one at a time. When a writer is being processed no other writer or readers can be processed. A fixed number of readers and writers are ready for processing at time 0. Their processing times are independent random variables. Each reader and writer has a fixed waiting cost rate. We find optimal scheduling rules that minimize the expected total waiting cost (expected total weighted flowtime). We consider both nonpreemptive and preemptive scheduling. The optimal nonpreemptive schedule is derived by a variation of the usual interchange argument, while the optimal schedule in the preemptive case is given by a Gittins index policy. These index policies continue to be optimal for systems in which new writers enter the system in a Poisson fashion. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 483–495, 1998 相似文献
80.
We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998 相似文献