全文获取类型
收费全文 | 313篇 |
免费 | 2篇 |
国内免费 | 15篇 |
专业分类
教育 | 195篇 |
科学研究 | 79篇 |
体育 | 2篇 |
综合类 | 40篇 |
信息传播 | 14篇 |
出版年
2022年 | 4篇 |
2021年 | 6篇 |
2020年 | 8篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 2篇 |
2016年 | 5篇 |
2015年 | 21篇 |
2014年 | 26篇 |
2013年 | 29篇 |
2012年 | 38篇 |
2011年 | 29篇 |
2010年 | 23篇 |
2009年 | 24篇 |
2008年 | 29篇 |
2007年 | 29篇 |
2006年 | 22篇 |
2005年 | 8篇 |
2004年 | 5篇 |
2003年 | 2篇 |
2002年 | 4篇 |
2001年 | 1篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 4篇 |
排序方式: 共有330条查询结果,搜索用时 15 毫秒
1.
Flow shop rescheduling problem under rush orders 总被引:1,自引:0,他引:1
INTRODUCTION Rescheduling problem in manufacturing system is considered as a particularly hard combinatorial optimization problem,closely related with uncer-tainty caused by exterior business environment and interior production conditions.Production resched-uling is a common practice in manufacturing compa-nies all over the world.Four sources of production disturbances have been identified:(1)incorrect work;(2)machine breakdowns;(3)rework due to quality problem;and(4)rush orders(Rangsarit… 相似文献
2.
3.
该文介绍了模糊流水车间调度问题,在此基础之上设计了一个解决该问题的混合遗传算法——嵌入多点最速下降法的遗传算法(GDA),将其与各种算法进行了仿真比较,论证了其有效性。 相似文献
4.
王得利 《唐山师范学院学报》2011,33(2):55-57
控制系统中任务的调度不仅影响系统的资源利用率,而且影响系统的控制性能。首先分析了周期性实时任务,并给出了任务模型。基于此,采用了EDF调度算法。根据系统的性能指标与任务的采样周期的关系,采用粒子群算法对系统性能进行优化。仿真结果表明,这种算法是有效的。 相似文献
5.
In this paper an overall scheme of the task management system of ternary optical computer (TOC) is proposed, and the software
architecture chart is given. The function and accomplishment of each module in the system are described in general. In addition,
according to the aforementioned scheme a prototype of TOC task management system is implemented, and the feasibility, rationality
and completeness of the scheme are verified via running and testing the prototype. 相似文献
6.
A hybrid two-stage flowshop scheduling problem was considered which involves m identical parallel machines at Stage 1 and a burn-in processor M at Stage 2, and the makespan was taken as the minimization objective. This scheduling problem is NP-hard in general. We divide it into eight subcases. Except for the following two subcases: (1) b≥ an, max{m, B} 〈 n; (2) a1 ≤ b ≤ an, m ≤ B 〈 n, for all other subcases, their NP-hardness was proved or pointed out, corresponding approximation algorithms were conducted and their worst-case performances were estimated. In all these approximation algorithms, the Multifit and PTAS algorithms were respectively used, as the jobs were scheduled in m identical parallel machines. 相似文献
7.
在分析Linux和嵌入式实时操作系统的基础上,提出Linux的实时化、嵌入化的解决方案. 相似文献
8.
The combination of online or semi-online with deterioration jobs has never been researched in scheduling problems. In this paper, two semi-online parallel machine scheduling problems with linear deterioration processing time are considered. In the first problem, it is assumed that the deterioration rates of jobs are known in an interval, that is, bj ∈[0, α], where 0 〈α≤ 1 and bj denotes the linear deterioration rate. In the second problem, it is assumed that the largest deterioration rate of jobs is known in advance, that is, b = max1≤j≤n {bj }. For each of the two problems, a heuristic MBLS algorithm is worked out and its worst-case ratio is analyzed. At the same time, the worst-case ratio of the list (LS) algorithm is investigated and it is proved that all the ratios are tight. 相似文献
9.
10.