全文获取类型
收费全文 | 513篇 |
免费 | 10篇 |
出版年
2021年 | 8篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 5篇 |
2016年 | 10篇 |
2015年 | 3篇 |
2014年 | 5篇 |
2013年 | 87篇 |
2012年 | 4篇 |
2009年 | 6篇 |
2007年 | 15篇 |
2005年 | 3篇 |
2004年 | 4篇 |
2003年 | 8篇 |
2002年 | 11篇 |
2000年 | 3篇 |
1999年 | 6篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 14篇 |
1990年 | 11篇 |
1989年 | 20篇 |
1988年 | 18篇 |
1987年 | 13篇 |
1986年 | 16篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 11篇 |
1979年 | 10篇 |
1978年 | 13篇 |
1977年 | 5篇 |
1976年 | 6篇 |
1975年 | 6篇 |
1974年 | 10篇 |
1973年 | 11篇 |
1972年 | 4篇 |
1971年 | 11篇 |
1970年 | 8篇 |
1969年 | 6篇 |
1967年 | 9篇 |
1966年 | 5篇 |
1948年 | 4篇 |
排序方式: 共有523条查询结果,搜索用时 31 毫秒
31.
Dileep R. Sule 《海军后勤学研究》1982,29(3):517-519
The paper extends the machine flow-shop scheduling problem by separating processing time into setup, processing and removal times. 相似文献
32.
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. 相似文献
33.
New closure theorems for shock models in reliability theory are presented. If the number of shocks to failure and the times between the arrivals of shocks have probability distributions of phase type, then so has the time to failure. PH-distributions are highly versatile and may be used to model many qualitative features of practical interest. They are also well-suited for algorithmic implementation. The computational aspects of our results are discussed in some detail. 相似文献
34.
We study via simulation an M/M/1 queueing system with the assumption that a customer's service time and the interarrival interval separating his arrival from that of his predecessor are correlated random variables having a bivariate exponential distribution. We show that positive correlation reduces the mean and variance of the total waiting time and that negative correlation has the opposite effect. By using spectral analysis and a nonparametric test applied to the sample power spectra associated with certain simulated waiting times we show the effect to be statistically significant. 相似文献
35.
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. 相似文献
36.
A generalization of the equi-partitioning problem, termed the 2D-Partition Problem, is formulated. The motivation is an aircraft maintenance scheduling problem with the following characteristics. The complete maintenance overhaul of a single aircraft requires the completion of some 350 tasks. These tasks require a varying number of technicians working at the same time. For large subsets of these 350 tasks, the constraining resource is physical space—tasks must be completed in a physical space of limited size such as the cockpit. Furthermore, there is no precedence relationship among the tasks. For each subset, the problem is to schedule the tasks to minimize makespan. Let m denote the maximum number of technicians that can work at the same time in the physical area under consideration. We present optimization algorithms for m = 2 and 3. © 1996 John Wiley & Sons, Inc. 相似文献
37.
In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters. © 1996 John Wiley & Sons, Inc. 相似文献
38.
39.
Gary R. Waissi 《海军后勤学研究》1993,40(3):393-414
A new algorithm is presented for finding maximal and maximum value flows in directed single-commodity networks. Commonly algorithms developed for this problem find a maximal flow by gradually augmenting (increasing) a feasible flow to a maximal flow. In the presented algorithm, at the beginning of each step or iteration, the flow on arcs is assigned to flow capacity. This may lead to an infeasible flow violating flow conservation at some nodes. During two passes of a MAIN step, consisting of a forward pass and a backward pass, the flow is reduced on some arcs to regain feasibility. The network is then pruned by omitting saturated arcs, and the process is repeated. The parallel implementation of the algorithm applies the two main steps at the same time to the same network. The outputs of the two steps are compared and the processing continues with the higher feasible flow. The algorithm is simple, intuitive, and efficient. © 1993 John Wiley & Sons, Inc. 相似文献
40.
A new class of nonparametric reliability models is introduced and studied. A distribution is said to be better at age s than at age t (sBt) if the residual lifetime at age s is stochastically greater than or equal to the residual lifetime at age t. Applications to various forms of replacement policies, including the cannibalization of failed systems, are noted. For fixed s < t, the problem of estimating a survival curve assumed to belong to the sBt class is addressed using recursive methods. An sBt estimator is derived in closed form, and its uniform strong consistency at an optimal rate of convergence is demonstrated. A simulation study strongly supports the claim that the sBt estimator tends to outperform the empirical survivor function in small- and moderate-size samples. © 1993 John Wiley & Sons, Inc. 相似文献