全文获取类型
收费全文 | 450篇 |
免费 | 5篇 |
专业分类
455篇 |
出版年
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2017年 | 10篇 |
2016年 | 10篇 |
2015年 | 8篇 |
2014年 | 8篇 |
2013年 | 55篇 |
2012年 | 22篇 |
2011年 | 26篇 |
2010年 | 21篇 |
2009年 | 14篇 |
2008年 | 27篇 |
2007年 | 13篇 |
2006年 | 15篇 |
2005年 | 5篇 |
2004年 | 3篇 |
2002年 | 3篇 |
2001年 | 3篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1995年 | 5篇 |
1994年 | 4篇 |
1993年 | 10篇 |
1992年 | 7篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 12篇 |
1988年 | 3篇 |
1987年 | 10篇 |
1986年 | 10篇 |
1985年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 4篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 7篇 |
1974年 | 2篇 |
1973年 | 2篇 |
1972年 | 12篇 |
1971年 | 3篇 |
1970年 | 3篇 |
1969年 | 9篇 |
1968年 | 7篇 |
1966年 | 3篇 |
排序方式: 共有455条查询结果,搜索用时 15 毫秒
81.
82.
A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods. 相似文献
83.
We consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date. We present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date, and an implicit enumeration procedure when the assumptions do not hold. We also establish the similarity of this problem to the two parallel machines mean flow time problem. 相似文献
84.
85.
This paper investigates the effect of the optimal solution of a (capacitated) generalized transportation problem when the data of the problem (the rim conditions—i.e., the available time of machine types and demands of product types, the per unit production costs, the per unit production time and the upper bounds) are continuously varied as a linear function of a single parameter. Operators that effect the transformation of optimal solution associated with such data changes, are shown to be a product of basis preserving operators (described in our earlier papers) that operate on a sequence of adjacent basis structures. Algorithms are furnished for the three types of operators—rim, cost, and weight. The paper concludes with a discussion of the production and managerial interpretations of the operators and a comment on the “production paradox”. 相似文献
86.
This paper develops bounds on the uncertainties in system availabilities or reliabilities which have been computed from structural (series, parallel, etc.) relations among uncertain subsystem availabilities or reliabilities. It is assumed that the highly available (reliable) subsystems have been tested or simulated to determine their unavailabilities (unreliabilities) to within some small percentages of uncertainty. It is shown that series, parallel and r out of n structures which are nominally highly available will have unavailability uncertainties whose percentages errors are of the same order as the subsystem uncertainties. Thus overall system analysis errors, even for large systems, are of the same order of magnitude as the uncertainties in the component probabilities. Both systematic (bias type) uncertainties and independent random uncertainties are considered. 相似文献
87.
Suppose x1, x2, … are independently distributed random variables with Pr (xi = 1) = Pr(xi = ?1) = 1/2, and let sn =
88.
89.
90.
This paper presents a linear programming model of a fleet of vessels which is required to transport quantities of cargo, such as coal, iron ore, limestone, and salt from certain producing ports to specific destination ports. This model has been implemented and is currently being used both for planning purposes and as an aid in scheduling the trips to be made by each vessel. 相似文献