全文获取类型
收费全文 | 1313篇 |
免费 | 130篇 |
国内免费 | 106篇 |
专业分类
电工技术 | 19篇 |
综合类 | 76篇 |
化学工业 | 24篇 |
金属工艺 | 46篇 |
机械仪表 | 296篇 |
建筑科学 | 63篇 |
矿业工程 | 8篇 |
能源动力 | 5篇 |
轻工业 | 17篇 |
水利工程 | 7篇 |
石油天然气 | 4篇 |
武器工业 | 3篇 |
无线电 | 25篇 |
一般工业技术 | 300篇 |
冶金工业 | 20篇 |
原子能技术 | 1篇 |
自动化技术 | 635篇 |
出版年
2024年 | 11篇 |
2023年 | 14篇 |
2022年 | 29篇 |
2021年 | 29篇 |
2020年 | 54篇 |
2019年 | 46篇 |
2018年 | 37篇 |
2017年 | 54篇 |
2016年 | 65篇 |
2015年 | 62篇 |
2014年 | 71篇 |
2013年 | 202篇 |
2012年 | 75篇 |
2011年 | 73篇 |
2010年 | 61篇 |
2009年 | 78篇 |
2008年 | 69篇 |
2007年 | 93篇 |
2006年 | 119篇 |
2005年 | 60篇 |
2004年 | 53篇 |
2003年 | 36篇 |
2002年 | 34篇 |
2001年 | 33篇 |
2000年 | 21篇 |
1999年 | 21篇 |
1998年 | 4篇 |
1997年 | 14篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1986年 | 1篇 |
1983年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有1549条查询结果,搜索用时 15 毫秒
1.
Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed. 相似文献
2.
A steelmaking-continuous casting (SCC) scheduling problem is an example of complex hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This paper investigates the SCC scheduling problem that involves controllable processing times (CPT) with multiple objectives concerning the total waiting time, earliness/tardiness and adjusting cost. The SCC scheduling problem with CPT is seldom discussed in the existing literature. This study is motivated by the practical situation of a large integrated steel company in which the just-in-time (JIT) and cost-cutting production strategy have become a significant concern. To address this complex HFSSP, the scheduling problem is decomposed into two subproblems: a parallel machine scheduling problem (PMSP) in the last stage and an HFSSP in the upstream stages. First, a hybrid differential evolution (HDE) algorithm combined with a variable neighborhood decomposition search (VNDS) is proposed for the former subproblem. Second, an iterative backward list scheduling (IBLS) algorithm is presented to solve the latter subproblem. The effectiveness of this bi-layer optimization approach is verified by computational experiments on well-designed and real-world scheduling instances. This study provides a new perspective on modeling and solving practical SCC scheduling problems. 相似文献
3.
4.
针对作业车间调度问题的特征,提出一种基于基因表达式的克隆选择算法。在这个方法中,采用基因表达式编程算法中的编码方式来表示调度方案,同时为了提出的方法具有更强的全局搜索能力,运用克隆选择算法作为搜索引擎。最后,验证提出的方法的有效性,对7组Benchmark实例进行测试。实验结果表明,基于基因表达式的克隆选择算法在求解作业车间调度问题中是非常有效的。 相似文献
5.
Production scheduling involves all activities of building production schedules, including coordinating and assigning activities to each person, group of people, or machine and arranging work orders in each workplace. Production scheduling must solve all problems such as minimizing customer wait time, storage costs, and production time; and effectively using the enterprise’s human resources. This paper studies the application of flexible job shop modelling on scheduling a woven labelling process. The labelling process includes several steps which are handled in different work-stations. Each workstation is also comprised of several identical parallel machines. In this study, job splitting is allowed so that the power of work stations can be utilized better. The final objective is to minimize the total completion time of all jobs. The results show a significant improvement since the new planning may save more than 60% of lead time compared to the current schedule. The contribution of this research is to propose a flexible job shop model for scheduling a woven labelling process. The proposed approach can also be applied to support complex production scheduling processes under fuzzy environments in different industries. A practical case study demonstrates the effectiveness of the proposed model. 相似文献
6.
通过大量的试验研究,设计了一个合理的环氧富锌车间底漆配方,制备出的涂料漆膜性能符合国家标准,且降低了涂料整体的污染程度。 相似文献
7.
In real scheduling problems, some disruptions and unexpected events may occur. These disruptions cause the initial schedule to quickly become infeasible and non-optimal. In this situation, an appropriate rescheduling method should be used. In this paper, a new approach has been proposed to achieve stable and robust schedule despite uncertain processing times and unexpected arrivals of new jobs. This approach is a proactive–reactive method which uses a two-step procedure. In the first step an initial robust solution is produced proactively against uncertain processing times using robust optimization approach. This initial robust solution is more insensitive against the fluctuations of processing times in future. In the next step, when an unexpected disruption occurs, an appropriate reactive method is adopted to deal with this unexpected event. In fact, in the second step, the reactive approach determines the best modified sequence after any unexpected disruption based on the classical objective and performance measures. The robustness measure is implemented in the reactive approach to increase the performance of the real schedule after disruption. Computational results indicate that this method produces better solutions in comparison with four classical heuristic approaches according to effectiveness and performance of solutions. 相似文献
8.
基于灰熵关联分析的流水车间多目标调度优化及算法实现 总被引:1,自引:0,他引:1
求解流水车间多目标调度优化问题及算法适应度值分配问题, 结合灰色关联度分析方法及信息熵理论提出灰熵关联度适应值分配策略, 利用灰关联系数结合熵值权重计算适应度值, 以灰熵关联度值引导启发式算法进化. 将该方法应用到差分算法及遗传算法中解决三目标流水车间调度问题. 实验表明: 灰熵关联度适应值分配策略能够解决该问题, 可以得到分布均匀的Pareto 前端; 同时, 基于此策略的差分算法得到的解好于遗传算法的解. 相似文献
9.
B. Naderi M. Zandieh M. Yazdani 《International Transactions in Operational Research》2014,21(6):1031-1044
This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open‐shop scheduling, where the processing times are only machine‐dependent. This variant of scheduling is called proportionate scheduling and its applications are used in many real‐world environments. This paper develops three polynomial time algorithms for the problem. First, we present a polynomial time algorithm that solves the problem optimally if , where n and m denote the numbers of jobs and machines, respectively. If, on the other hand, , we develop a polynomial time approximation algorithm with a worst‐case performance ratio of that improves the bound existing for general open‐shops. Next, in the case of , we take into account the problem under consideration as a master problem and convert it into a simpler secondary approximation problem. Furthermore, we formulate both the master and secondary problems, and compare their complexity sizes. We finally present another polynomial time algorithm that provides optimal solution for a special case of the problem where . 相似文献
10.
陈甫 《数字社区&智能家居》2014,(7):4442-4445
介绍了微信小店接口功能、服务端结构及微信小店接口开发的一般过程,并使用JAVA语言实现了微信小店服务端HTTPS传输、JSON数据生成和分析、获取ACCESS_TOKEN以及微信小店接口调用等主要环节。 相似文献