全文获取类型
收费全文 | 505篇 |
免费 | 17篇 |
出版年
2021年 | 10篇 |
2020年 | 5篇 |
2019年 | 13篇 |
2018年 | 5篇 |
2017年 | 7篇 |
2016年 | 12篇 |
2015年 | 9篇 |
2014年 | 7篇 |
2013年 | 77篇 |
2011年 | 6篇 |
2009年 | 6篇 |
2007年 | 15篇 |
2005年 | 5篇 |
2004年 | 7篇 |
2003年 | 9篇 |
2002年 | 8篇 |
2001年 | 5篇 |
1999年 | 10篇 |
1998年 | 9篇 |
1997年 | 10篇 |
1996年 | 10篇 |
1995年 | 4篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 13篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 18篇 |
1987年 | 8篇 |
1986年 | 15篇 |
1985年 | 8篇 |
1984年 | 6篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 9篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1975年 | 5篇 |
1974年 | 12篇 |
1973年 | 5篇 |
1972年 | 4篇 |
1971年 | 10篇 |
1970年 | 6篇 |
1969年 | 7篇 |
1968年 | 4篇 |
1967年 | 6篇 |
1948年 | 5篇 |
排序方式: 共有522条查询结果,搜索用时 31 毫秒
51.
Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered. 相似文献
52.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
53.
54.
In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
55.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
56.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
57.
This paper proposes a kurtosis correction (KC) method for constructing the X? and R control charts for symmetrical long‐tailed (leptokurtic) distributions. The control charts are similar to the Shewhart control charts and are very easy to use. The control limits are derived based on the degree of kurtosis estimated from the actual (subgroup) data. It is assumed that the underlying quality characteristic is symmetrically distributed and no other distributional and/or parameter assumptions are made. The control chart constants are tabulated and the performance of these charts is compared with that of the Shewhart control charts. For the case of the logistic distribution, the exact control limits are derived and are compared with the KC method and the Shewhart method. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
58.
59.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
60.