全文获取类型
收费全文 | 316篇 |
免费 | 10篇 |
出版年
2020年 | 3篇 |
2019年 | 14篇 |
2018年 | 10篇 |
2017年 | 5篇 |
2016年 | 8篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 99篇 |
2011年 | 8篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2008年 | 5篇 |
2007年 | 7篇 |
2006年 | 3篇 |
2005年 | 6篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 5篇 |
1998年 | 3篇 |
1997年 | 4篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 6篇 |
1988年 | 8篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1973年 | 4篇 |
1972年 | 4篇 |
1971年 | 2篇 |
1970年 | 3篇 |
1969年 | 2篇 |
1968年 | 3篇 |
排序方式: 共有326条查询结果,搜索用时 62 毫秒
1.
2.
3.
Stig I. Rosenlund 《海军后勤学研究》1980,27(2):207-215
The waiting time in the random order service G/M/m queue is studied. For the Laplace transform we obtain a simpler representation than previously available. For the moments, an explicit recursive algorithm is given and carried out numrically for some cases. This gives rise to the conjecture that the waiting-time distributio can be approximated by the one for M/M/m after a suitable change of scale. 相似文献
4.
Inspection procedures may at times pose a hazard to the system being monitored. In this article, a simple hazardous-inspection model is considered. The character of the optimal ongoing inspection policy (for inspections subsequent to the first) is reviewed, and the possible forms of the optimal initiation policy are established. Efficient computational procedures are developed for calculating optimal policies. Some discussion is included of the counterintuitive nature of some of the results. 相似文献
5.
This paper attempts to resolve the existing confusion concerning missing operations. Scheduling problems are classified in two groups: (i) null-continuous (NC)—comprising the problems where an optimal schedule remains optimal on replacement of arbitrarily small processing times (existing operations) with zeros (missing operations); (ii) null-discontinuous (NDC)—comprising those problems which are not null-continuous. 相似文献
6.
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. 相似文献
7.
In statistical analysis of stationary time series or in steady-state simulation output analysis, it is desired to find consistent estimates of the process variance parameter. Here, we consider variants of the area estimator of standardized time series, namely, the weighted area and the Cramér-von Mises area estimators, and provide their consistency, in the strong sense and mean-square sense. A sharp bound for the (asymptotic) variance of these estimators is obtained. We also present a central limit theorem for the weighted area estimator: this gives a rate of convergence of this estimator, as well as a confidence interval for the variance parameter. © 1995 John Wiley & Sons, Inc. 相似文献
8.
Many Markov chain models have very large state spaces, making the computation of stationary probabilities very difficult. Often the structure and numerical properties of the Markov chain allows for more efficient computation through state aggregation and disaggregation. In this article we develop an efficient exact single pass aggregation/disaggregation algorithm which exploits structural properties of large finite irreducible mandatory set decomposable Markov chains. The required property of being of mandatory set decomposable structure is a generalization of several other Markov chain structures for which exact aggregation/disaggregation algorithms exist. © 1995 John Wiley & Sons, Inc. 相似文献
9.
Jobs with known processing times and due dates have to be processed on a machine which is subject to a single breakdown. The moment of breakdown and the repair time are independent random variables. Two cases are distinguished with reference to the processing time preempted by the breakdown (no other preemptions are allowed): (i) resumption without time losses and (ii) restart from the beginning. Under certain compatible conditions, we find the policies which minimize stochastically the number of tardy jobs. 相似文献
10.
In this article we present a queueing-location problem where a location of a service station has to be determined. The two main results of this article are a convexity proof for general distances and a theorem that limits the area in the plane where the solution can lie. We also propose some solution procedures. 相似文献