全文获取类型
收费全文 | 400篇 |
免费 | 22篇 |
出版年
2021年 | 11篇 |
2020年 | 6篇 |
2019年 | 10篇 |
2018年 | 6篇 |
2017年 | 7篇 |
2016年 | 10篇 |
2015年 | 11篇 |
2014年 | 8篇 |
2013年 | 59篇 |
2012年 | 4篇 |
2011年 | 8篇 |
2010年 | 5篇 |
2009年 | 9篇 |
2007年 | 10篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 11篇 |
2003年 | 7篇 |
2002年 | 10篇 |
2001年 | 8篇 |
2000年 | 6篇 |
1999年 | 14篇 |
1998年 | 7篇 |
1997年 | 4篇 |
1996年 | 4篇 |
1995年 | 11篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 12篇 |
1990年 | 6篇 |
1989年 | 8篇 |
1988年 | 9篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 3篇 |
1984年 | 7篇 |
1983年 | 3篇 |
1981年 | 7篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1975年 | 3篇 |
1974年 | 5篇 |
1973年 | 5篇 |
1972年 | 3篇 |
1971年 | 6篇 |
1969年 | 4篇 |
1968年 | 5篇 |
排序方式: 共有422条查询结果,搜索用时 15 毫秒
41.
We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
42.
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 相似文献
43.
44.
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 相似文献
45.
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 相似文献
46.
We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
47.
针对非线性非高斯导航系统信息处理问题,采用自组织算法、神经网络和遗传算法等改进传统非线性Kalman滤波算法,构建一种自适应的组合导航系统。应用具有冗余趋势项的自组织算法、Volterra神经网络和遗传算法,建立导航系统误差的非线性预测模型,进而计算得到其预测值;将该预测值与Kalman滤波算法求得的估计值进行比较得到差值,以此监测Kalman滤波算法的工作状态;采用自适应控制方法,在导航系统结构层面改进Kalman滤波算法,构建新型的导航系统误差补偿模型。开展基于导航系统KIND-34的半实物仿真研究,应用所提出的改进方法改善了导航系统误差的补偿效果,提高了组合导航系统的自适应能力和容错能力。 相似文献
48.
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 相似文献
49.
50.
In this article, we study aging properties of parallel and series systems with a random number of components. We show that the decreasing likelihood ratio property is closed under the formation of random minima. We also show, by counterexamples, that other aging properties are not closed under the formation of random minima or maxima. Some mistakes in the literature are corrected. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 238–243, 2014 相似文献