全文获取类型
收费全文 | 563篇 |
免费 | 193篇 |
国内免费 | 52篇 |
专业分类
808篇 |
出版年
2024年 | 5篇 |
2023年 | 8篇 |
2022年 | 9篇 |
2021年 | 23篇 |
2020年 | 13篇 |
2019年 | 14篇 |
2018年 | 13篇 |
2017年 | 30篇 |
2016年 | 33篇 |
2015年 | 30篇 |
2014年 | 47篇 |
2013年 | 43篇 |
2012年 | 40篇 |
2011年 | 61篇 |
2010年 | 38篇 |
2009年 | 47篇 |
2008年 | 28篇 |
2007年 | 50篇 |
2006年 | 33篇 |
2005年 | 32篇 |
2004年 | 37篇 |
2003年 | 18篇 |
2002年 | 23篇 |
2001年 | 20篇 |
2000年 | 24篇 |
1999年 | 22篇 |
1998年 | 12篇 |
1997年 | 11篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 9篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有808条查询结果,搜索用时 15 毫秒
281.
In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ Cj, the makespan Cmax, and the maximum lateness Lmax. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
282.
We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n5/ε4) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
283.
284.
285.
286.
287.
288.
We propose three related estimators for the variance parameter arising from a steady‐state simulation process. All are based on combinations of standardized‐time‐series area and Cramér–von Mises (CvM) estimators. The first is a straightforward linear combination of the area and CvM estimators; the second resembles a Durbin–Watson statistic; and the third is related to a jackknifed version of the first. The main derivations yield analytical expressions for the bias and variance of the new estimators. These results show that the new estimators often perform better than the pure area, pure CvM, and benchmark nonoverlapping and overlapping batch means estimators, especially in terms of variance and mean squared error. We also give exact and Monte Carlo examples illustrating our findings.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
289.
Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we study burn‐in procedure for a system that is maintained under periodic inspection and perfect repair policy. Assuming that the underlying lifetime distribution of a system has an initially decreasing and/or eventually increasing failure rate function, we derive upper and lower bounds for the optimal burn‐in time, which maximizes the system availability. Furthermore, adopting an age replacement policy, we derive upper and lower bounds for the optimal age parameter of the replacement policy for each fixed burn‐in time and a uniform upper bound for the optimal burn‐in time given the age replacement policy. These results can be used to reduce the numerical work for determining both optimal burn‐in time and optimal replacement policy. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
290.