全文获取类型
收费全文 | 3440篇 |
免费 | 399篇 |
国内免费 | 35篇 |
专业分类
化学 | 341篇 |
力学 | 11篇 |
综合类 | 84篇 |
数学 | 1579篇 |
物理学 | 85篇 |
无线电 | 1774篇 |
出版年
2024年 | 14篇 |
2023年 | 44篇 |
2022年 | 88篇 |
2021年 | 96篇 |
2020年 | 95篇 |
2019年 | 99篇 |
2018年 | 81篇 |
2017年 | 124篇 |
2016年 | 154篇 |
2015年 | 140篇 |
2014年 | 273篇 |
2013年 | 218篇 |
2012年 | 219篇 |
2011年 | 235篇 |
2010年 | 221篇 |
2009年 | 247篇 |
2008年 | 230篇 |
2007年 | 228篇 |
2006年 | 174篇 |
2005年 | 156篇 |
2004年 | 115篇 |
2003年 | 104篇 |
2002年 | 80篇 |
2001年 | 81篇 |
2000年 | 58篇 |
1999年 | 48篇 |
1998年 | 38篇 |
1997年 | 27篇 |
1996年 | 25篇 |
1995年 | 22篇 |
1994年 | 10篇 |
1993年 | 15篇 |
1992年 | 12篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 8篇 |
1988年 | 20篇 |
1987年 | 5篇 |
1986年 | 6篇 |
1985年 | 17篇 |
1984年 | 13篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1979年 | 3篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有3874条查询结果,搜索用时 11 毫秒
91.
混合作业是经典的自由作业和异序作业的一种综合,其中一些工件可以按任意的机器顺序进行处理,而另一些工件必须遵守预先指定的机器顺序.本文研究安装、加工和拆卸时间分离的两台机器混合作业排序问题,该问题已经被知道是强NP困难的,本文把流水作业中的同顺序作业概念推广到混合作业,并得到这个混合作业问题在同顺序意义下的最优解,这个解对于一般情形是3/2近似解,但对于一些有意义的特殊情形是整体最优的. 相似文献
92.
A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling 总被引:1,自引:0,他引:1
We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to tackle this problem, using path relinking methodology as a solution combination method. Computational results on randomly generated problem sets are compared with the best available results indicating the efficiency of the proposed algorithm. 相似文献
93.
A hybrid genetic local search algorithm for the permutation flowshop scheduling problem 总被引:1,自引:0,他引:1
Traditionally, the permutation flowshop scheduling problem (PFSP) was with the criterion of minimizing makespan. The permutation flowshop scheduling problem to minimize the total flowtime has attracted more attention from researchers in recent years. In this paper, a hybrid genetic local search algorithm is proposed to solve this problem with each of both criteria. The proposed algorithm hybridizes the genetic algorithm and a novel local search scheme that combines two local search methods: the Insertion Search (IS) and the Insertion Search with Cut-and-Repair (ISCR). It employs the genetic algorithm to do the global search and two local search methods to do the local search. Two local search methods play different roles in the search process. The Insertion Search is responsible for searching a small neighborhood while the Insertion Search with Cut-and-Repair is responsible for searching a large neighborhood. Furthermore, the orthogonal-array-based crossover operator is designed to enhance the GA’s capability of intensification. The experimental results show the advantage of combining the two local search methods. The performance of the proposed hybrid genetic algorithm is very competitive. For the PFSP with the total flowtime criterion, it improved 66 out of the 90 current best solutions reported in the literature in short-term search and it also improved all the 20 current best solutions reported in the literature in long-term search. For the PFSP with the makespan criterion, the proposed algorithm also outperforms the other three methods recently reported in the literature. 相似文献
94.
Resource availability optimization is studied on a server–client system where different users are partitioned into priority classes. The aim is to provide higher resource availability according to the priority of each class. For this purpose, resource reservation is modeled by a homogeneous continuous time Markov chain (CTMC), but also by a cyclic non-homogeneous Markov chain (CNHMC) as there is a cyclic behavior of the users’ requests for resources. The contribution of the work presented consists in the formulation of a multiobjective optimization problem for both the above cases that aims to determine the optimal resource reservation policy providing higher levels of resource availability for all classes. The optimization problem is solved either with known methods or with a proposed kind of heuristic algorithm. Finally, explicit generalized approximate inverse preconditioning methods are adopted for solving efficiently sparse linear systems that are derived, in order to compute resource availability. 相似文献
95.
In this paper, we consider a parallel machine environment when all jobs have the same processing time and arbitrary release dates and deadlines of the jobs are given. We suppose that the available number of machines, which can be used simultaneously, may vary over time. The aim is to construct a feasible schedule in such a way that the maximal number of simultaneously used machines is minimal. We give a polynomial algorithm for this problem. 相似文献
96.
Stanis?aw Gawiejnowicz Wies?aw Kurc Lidia Pankowska 《Discrete Applied Mathematics》2006,154(15):2150-2166
In the paper a single machine time-dependent scheduling problem is considered. The processing time pj of each job is described by a function of the starting time t of the job, pj=1+αjt, where the job deterioration rate αj?0 for j=0,1,…,n and t?0. Jobs are nonpreemptable and independent, there are no ready times and no deadlines. The criterion of optimality of a schedule is the total completion time.First, the notion of a signature for a given sequence of job deterioration rates is introduced, two types of the signature are defined and their properties are shown. Next, on the basis of these properties a greedy polynomial-time approximation algorithm for the problem is formulated. This algorithm, starting from an initial sequence, iteratively constructs a new sequence concatenating the previous sequence with new elements, according to the sign of one of the signatures of this sequence.Finally, these results are applied to the problem with job deterioration rates which are consecutive natural numbers, αj=j for j=0,1,…,n. Arguments supporting the conjecture that in this case the greedy algorithm is optimal are presented. 相似文献
97.
Most successful heuristics for solving 1||∑wjTj are based on swap moves. We present an algorithm which improves the complexity of searching the swap neighborhood from O(n3) to O(n2). We show that this result also improves the complexity of the recently developed dynasearch heuristics. 相似文献
98.
We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan. 相似文献
99.
Two criteria in a combinatorial problem are often combined in a weighted sum objective using a weighting parameter between 0 and 1. For special problem types, e.g., when one of the criteria is a bottleneck value, efficient algorithms are known that solve for a given value of the weighting parameter. 相似文献
100.
Kanthen?K?HarikrishnanEmail author Hiroaki?Ishii 《Fuzzy Optimization and Decision Making》2005,4(2):141-147
We consider a batch scheduling problem on a single machine which processes jobs with resource dependent setup and processing time in the presence of fuzzy due-dates given as follows:1. There are n independent non-preemptive and simultaneously available jobs processed on a single machine in batches. Each job j has a processing time and a due-date.2. All jobs in a batch are completed together upon the completion of the last job in the batch. The batch processing time is equal to the sum of the processing times of its jobs. A common machine setup time is required before the processing of each batch.3. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource.4. The due-date of each job is flexible. That is, a membership function describing non-decreasing satisfaction degree about completion time of each job is defined.5. Under above setting, we find an optimal batch sequence and resource values such that the total weighted resource consumption is minimized subject to meeting the job due-dates, and minimal satisfaction degree about each due-date of each job is maximized. But usually we cannot optimize two objectives at a time. So we seek non-dominated pairs i.e. the batch sequence and resource value, after defining dominance between solutions.A polynomial algorithm is constructed based on linear programming formulations of the corresponding problems. 相似文献