全文获取类型
收费全文 | 1929篇 |
免费 | 622篇 |
国内免费 | 255篇 |
出版年
2024年 | 3篇 |
2023年 | 22篇 |
2022年 | 26篇 |
2021年 | 50篇 |
2020年 | 50篇 |
2019年 | 38篇 |
2018年 | 33篇 |
2017年 | 93篇 |
2016年 | 144篇 |
2015年 | 89篇 |
2014年 | 178篇 |
2013年 | 165篇 |
2012年 | 164篇 |
2011年 | 142篇 |
2010年 | 118篇 |
2009年 | 166篇 |
2008年 | 126篇 |
2007年 | 143篇 |
2006年 | 182篇 |
2005年 | 168篇 |
2004年 | 145篇 |
2003年 | 97篇 |
2002年 | 65篇 |
2001年 | 73篇 |
2000年 | 50篇 |
1999年 | 54篇 |
1998年 | 49篇 |
1997年 | 38篇 |
1996年 | 23篇 |
1995年 | 18篇 |
1994年 | 18篇 |
1993年 | 15篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 7篇 |
1987年 | 1篇 |
排序方式: 共有2806条查询结果,搜索用时 31 毫秒
61.
This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
62.
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 相似文献
63.
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 相似文献
64.
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 相似文献
65.
We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
66.
《火灾事故调查规定》是规范火灾事故调查,保障公安机关消防机构依法履行职责,保护火灾当事人合法权益的基本规章。结合《火灾事故调查规定》的应用实践,阐述了新修订的《火灾事故调查规定》一些制度设计对火灾事故调查工作的影响,分析了其适用中存在的问题,提出了解决这些问题的对策,有助于进一步完善火灾事故调查制度。 相似文献
67.
68.
In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007. 相似文献
69.
70.
两点源诱偏系统是应用有源干扰的方式,利用反辐射导弹(ARM)本身的缺陷来对反辐射导弹的导引头进行干扰,从而达到保护主战雷达目的的一种有源干扰系统。主要从反辐射导弹的基本原理和有源诱偏的概念入手,对两点源诱偏系统进行理论推导、数学建模、布站设想,后引入毁伤概率指标对各种布站方式进行分类、仿真,对每一种仿真结果进行分析、评估,再把各种分析结果加以比较,从中找出最佳的布站方式。最后利用以上的分析结果,得出几点有用的结论。 相似文献