全文获取类型
收费全文 | 210篇 |
免费 | 10篇 |
出版年
2020年 | 2篇 |
2019年 | 7篇 |
2018年 | 10篇 |
2017年 | 8篇 |
2016年 | 7篇 |
2015年 | 8篇 |
2014年 | 9篇 |
2013年 | 55篇 |
2012年 | 4篇 |
2011年 | 3篇 |
2010年 | 2篇 |
2009年 | 8篇 |
2008年 | 3篇 |
2005年 | 2篇 |
2004年 | 2篇 |
2003年 | 6篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 4篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1986年 | 5篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 6篇 |
1973年 | 2篇 |
1972年 | 4篇 |
1971年 | 4篇 |
1970年 | 3篇 |
1969年 | 4篇 |
1968年 | 3篇 |
1966年 | 1篇 |
1948年 | 1篇 |
排序方式: 共有220条查询结果,搜索用时 109 毫秒
41.
This work is concerned with a particular class of bimatrix games, the set of equilibrium points of which games possess many of the properties of solutions to zero-sum games, including susceptibility to solution by linear programming. Results in a more general setting are also included. Some of the results are believed to constitute interesting potential additions to elementary courses in game theory. 相似文献
42.
The reliability of a serial production line is optimized with respect to the location of a single buffer. The problem was earlier defined and solved by Soyster and Toof for the special case of an even number of machines all having equal probability of failure. In this paper we generalize the results for any number of machines and remove the restriction of identical machine reliabilities. In addition, an analysis of multibuffer systems is presented with a closed form solution for the reliability when both the number of buffers and their capacity is limited. For the general multibuffer system we present an approach for determining system reliability. 相似文献
43.
Data on 23 lots of various aircraft programs were gathered. Total engineering man-hours, and information on performance, weight, area, avionics systems, data, and schedule were subjected to least squares analysis. An equation is presented which indicates a relationship between total engineering manhours and a set of seven predictor variables. While the equation derived could only be used with confidence by the manufacturer whose data was analyzed, this article should be looked upon as demonstrating a method of data analysis which others may also find useful, not only for predicting engineering manhours in major aircraft programs, but also in other situations where there is an abundance of possible predictor variables, and the problem is to sort out a meaningful subset of these variables. In order to demonstrate the viability of the formula obtained, comparisons were made with various bid programs. 相似文献
44.
In this paper applications of results obtained by these authors for a generalized version of a problem proposed by Smirnov, are considered. The areas of application explored are system interface, queueing, transportation flow, and sequential analysis. The included table should be invaluable to the reader in applying these results. Finally the relationship between the limiting and exact expressions relating to this table is also explored. 相似文献
45.
The present study is concerned with the determination of a few observations from a sufficiently large complete or censored sample from the extreme value distribution with location and scale parameters μ and σ, respectively, such that the asymptotically best linear unbiased estimators (ABLUE) of the parameters in Ref. [24] yield high efficiencies among other choices of the same number of observations. (All efficiencies considered are relative to the Cramér-Rao lower bounds for regular unbiased estimators.) The study is on the asymptotic theory and under Type II censoring scheme. For the estimation of μ when σ is known, it has been proved that there exists a unique optimum spacing whether the sample is complete, right censored, left censored, or doubly censored. Several tables are prepared to aid in the numerical computation of the estimates as well as to furnish their efficiencies. For the estimation of σ when μ is known, it has been observed that there does not exist a unique optimum spacing. Accordingly we have obtained a spacing based on a complete sample which yields high efficiency. A similar table as above is prepared. When both μ and σ are unknown, we have considered four different spacings based on a complete sample and chosen the one yielding highest efficiency. A table of the efficiencies is also prepared. Finally we apply the above results for the estimation of the scale and/or shape parameters of the Weibull distribution. 相似文献
46.
47.
The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
48.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献
49.
An important aspect of supply chain management is dealing with demand and supply uncertainty. The uncertainty of future supply can be reduced if a company is able to obtain advance capacity information (ACI) about future supply/production capacity availability from its supplier. We address a periodic‐review inventory system under stochastic demand and stochastic limited supply, for which ACI is available. We show that the optimal ordering policy is a state‐dependent base‐stock policy characterized by a base‐stock level that is a function of ACI. We establish a link with inventory models that use advance demand information (ADI) by developing a capacitated inventory system with ADI, and we show that equivalence can only be set under a very specific and restrictive assumption, implying that ADI insights will not necessarily hold in the ACI environment. Our numerical results reveal several managerial insights. In particular, we show that ACI is most beneficial when there is sufficient flexibility to react to anticipated demand and supply capacity mismatches. Further, most of the benefits can be achieved with only limited future visibility. We also show that the system parameters affecting the value of ACI interact in a complex way and therefore need to be considered in an integrated manner. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
50.