全文获取类型
收费全文 | 853篇 |
免费 | 336篇 |
国内免费 | 61篇 |
出版年
2024年 | 1篇 |
2023年 | 18篇 |
2022年 | 9篇 |
2021年 | 24篇 |
2020年 | 37篇 |
2019年 | 20篇 |
2018年 | 10篇 |
2017年 | 60篇 |
2016年 | 69篇 |
2015年 | 50篇 |
2014年 | 63篇 |
2013年 | 56篇 |
2012年 | 83篇 |
2011年 | 69篇 |
2010年 | 42篇 |
2009年 | 89篇 |
2008年 | 60篇 |
2007年 | 63篇 |
2006年 | 70篇 |
2005年 | 55篇 |
2004年 | 57篇 |
2003年 | 36篇 |
2002年 | 37篇 |
2001年 | 27篇 |
2000年 | 31篇 |
1999年 | 23篇 |
1998年 | 23篇 |
1997年 | 15篇 |
1996年 | 11篇 |
1995年 | 9篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 8篇 |
1989年 | 2篇 |
排序方式: 共有1250条查询结果,搜索用时 359 毫秒
31.
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 相似文献
32.
The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
33.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
34.
35.
MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。 相似文献
36.
37.
38.
39.
40.
In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献