全文获取类型
收费全文 | 794篇 |
免费 | 12篇 |
出版年
2021年 | 14篇 |
2019年 | 11篇 |
2017年 | 18篇 |
2016年 | 15篇 |
2015年 | 17篇 |
2014年 | 16篇 |
2013年 | 120篇 |
2012年 | 23篇 |
2011年 | 28篇 |
2010年 | 23篇 |
2009年 | 14篇 |
2008年 | 31篇 |
2007年 | 17篇 |
2006年 | 19篇 |
2005年 | 9篇 |
2002年 | 8篇 |
2001年 | 9篇 |
1999年 | 5篇 |
1998年 | 13篇 |
1997年 | 14篇 |
1996年 | 6篇 |
1995年 | 10篇 |
1994年 | 12篇 |
1993年 | 16篇 |
1992年 | 14篇 |
1991年 | 14篇 |
1990年 | 4篇 |
1989年 | 19篇 |
1988年 | 17篇 |
1987年 | 16篇 |
1986年 | 23篇 |
1985年 | 16篇 |
1984年 | 6篇 |
1983年 | 10篇 |
1982年 | 8篇 |
1981年 | 14篇 |
1980年 | 12篇 |
1979年 | 20篇 |
1978年 | 10篇 |
1977年 | 11篇 |
1976年 | 8篇 |
1975年 | 15篇 |
1974年 | 9篇 |
1973年 | 7篇 |
1972年 | 18篇 |
1971年 | 7篇 |
1970年 | 7篇 |
1969年 | 14篇 |
1968年 | 10篇 |
1966年 | 6篇 |
排序方式: 共有806条查询结果,搜索用时 15 毫秒
611.
We consider a multiserver queueing system in which arrivals are governed by a Markovian arrival process. The system is attended by K identical exponential servers. Under a dynamic probabilistic service rule which depends on two threshold parameters, this model is studied as a Markov process. The steady-state probability vector is shown to be of (modified) matrix-geometric type. Efficient algorithmic procedures for the computation of the steady-state probability vector and some key performance measures of the system are developed. Some numerical examples are discussed. © 1993 John Wiley & Sons, Inc. 相似文献
612.
S. Chakravarthy 《海军后勤学研究》1992,39(3):345-357
We consider a finite-capacity single-server queue in which arrivals occur one at a time, according to a renewal process. The successive service times are mutually independent and have a common phase-type distribution. The customers are served in groups of size at least L, a preassigned threshold value. Explicit analytic expressions for the steady-state queue-length densities at arrivals and at arbitrary time points, and the throughput of the system are obtained. The Laplace-Stieltjes transform of the stationary waiting-time distribution of an admitted customer at points of arrivals is computed. It is shown to be of phase type when the arrival process is also of phase type. Efficient algorithmic procedures for the steady-state analysis of the model are presented. These procedures are used in arriving at an optimal value for L that minimizes the mean waiting time of an admitted customer. A conjecture on the nature of the mean waiting time is proposed. 相似文献
613.
Many organizations providing service support for products or families of products must allocate inventory investment among the parts (or, identically, items) that make up those products or families. The allocation decision is crucial in today's competitive environment in which rapid response and low levels of inventory are both required for providing competitive levels of customer service in marketing a firm's products. This is particularly important in high-tech industries, such as computers, military equipment, and consumer appliances. Such rapid response typically implies regional and local distribution points for final products and for spare parts for repairs. In this article we fix attention on a given product or product family at a single location. This single-location problem is the basic building block of multi-echelon inventory systems based on level-by-level decomposition, and our modeling approach is developed with this application in mind. The product consists of field-replaceable units (i.e., parts), which are to be stocked as spares for field service repair. We assume that each part will be stocked at each location according to an (s, S) stocking policy. Moreover, we distinguish two classes of demand at each location: customer (or emergency) demand and normal replenishment demand from lower levels in the multiechelon system. The basic problem of interest is to determine the appropriate policies (si Si) for each part i in the product under consideration. We formulate an approximate cost function and service level constraint, and we present a greedy heuristic algorithm for solving the resulting approximate constrained optimization problem. We present experimental results showing that the heuristics developed have good cost performance relative to optimal. We also discuss extensions to the multiproduct component commonality problem. 相似文献
614.
615.
616.
This paper presents an efficient algorithm for scheduling a single-category work force on 4-day or 3-day work weeks. Employees work 4 or 3 days each week, have A out of every B weekends off, and work no more than 5 consecutive days in a work stretch on 4-day work weeks and no more than 4 days in a work stretch on 3-day work weeks. Such conditions often prevail in 7-day-a-week organizations such as hospitals, manufacturing plants, and retail stores. We determine the minimum number of workers required to satisfy the scheduling constraints under any pattern of daily requirements. Then we present the algorithm for assigning days off for each worker, thereby determining the work schedules. We show that the algorithm, by construction, will necessarily satisfy the scheduling constraints. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 839–853, 1998 相似文献
617.
We consider the optimal wagers to be made by a gambler who starts with a given initial wealth. The gambler faces a sequence of two-outcome games, i.e., “win” vs. “lose,” and wishes to maximize the expected value of his terminal utility. It has been shown by Kelly, Bellman, and others that if the terminal utility is of the form log x, where x is the terminal wealth, then the optimal policy is myopic, i.e., the optimal wager is always to bet a constant fraction of the wealth provided that the probability of winning exceeds the probability of losing. In this paper we provide a critique of the simple logarithmic assumption for the utility of terminal wealth and solve the problem with a more general utility function. We show that in the general case, the optimal policy is not myopic, and we provide analytic expressions for optimal wager decisions in terms of the problem parameters. We also provide conditions under which the optimal policy reduces to the simple myopic case. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 639–654, 1997 相似文献
618.
619.
姿态确定系统是卫星姿态控制系统中的重要组成部分,卫星姿态确定的精度直接影响卫星控制精度.为得到高姿态精度,针对由惯性测量单元(Inertial Measurement Unit),红外地平仪和太阳敏感器组成的卫星姿态确定系统,分别采用BP网络算法和径向基(RBF)网络算法对不同的姿态敏感器的输出数据进行融合,并用STK(Satellite Tool Kit)数据进行了仿真.仿真分析结果表明这两种学习算法均可以提高卫星定姿精度,相对而言,RBF网络无论是精度上还是收敛速度上均优于BP网络. 相似文献
620.
This article discusses the behavior of three continuous sampling plans: continuous sampling plan 1 (CSP 1) and continuous sampling plan 2 (CSP 2) developed by Dodge [5] and Dodge and Torrey [7], and multilevel continuous sampling plan 2 (MLP 2) developed by Lieberman and Solomon [11], when the quality of successive units in a continuous production process follows a two-state time-homogeneous Markov chain. We first derive the average outgoing quality (AOQ) expressions of these plans. Exact procedures for determining the average outgoing quality limit (AOQL) can be obtained only for CSP 1. For CSP 2 and MLP 2 plans, iterative procedures have been used to obtain the AOQL contours. For these plans, it is assumed that the serial correlation coefficient between the two consecutive random variables of the Markov chain is known. In addition, estimation procedures for the coefficient are given. We show that if the serial correlation coefficient of the Markov chain is positive (negative), the AOQL is increased (decreased) as compared to the case when the successive units in the production process follows a Bernoulli pattern. Let r denote the number of production units examined in succession which are found to be of good quality and k denote the inverse of the sampling fraction employed when quality is good. Then if r and k are sufficiently small, it is observed from the graph that, for small departures of the serial correlation coefficient from zero, the AOQL values do not differ significantly for each of the three plans; whereas for sufficiently large values of r and k, the AOQL values differ significantly. Various aspects of these plans, such as their operating characteristics 2 (OC 2) and the serial correlation coefficient, are discussed. 相似文献