全文获取类型
收费全文 | 2280篇 |
免费 | 47篇 |
国内免费 | 87篇 |
学科分类
工业技术 | 2414篇 |
出版年
2024年 | 4篇 |
2023年 | 4篇 |
2022年 | 6篇 |
2021年 | 19篇 |
2020年 | 18篇 |
2019年 | 25篇 |
2018年 | 23篇 |
2017年 | 50篇 |
2016年 | 47篇 |
2015年 | 96篇 |
2014年 | 117篇 |
2013年 | 186篇 |
2012年 | 158篇 |
2011年 | 182篇 |
2010年 | 111篇 |
2009年 | 178篇 |
2008年 | 196篇 |
2007年 | 175篇 |
2006年 | 164篇 |
2005年 | 122篇 |
2004年 | 98篇 |
2003年 | 94篇 |
2002年 | 73篇 |
2001年 | 27篇 |
2000年 | 30篇 |
1999年 | 30篇 |
1998年 | 32篇 |
1997年 | 28篇 |
1996年 | 18篇 |
1995年 | 13篇 |
1994年 | 10篇 |
1993年 | 8篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 9篇 |
1982年 | 8篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有2414条查询结果,搜索用时 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 mathematical model for open pit mine production scheduling with Grade Engineering® and stockpiling
《矿业科学技术学报(英文版)》2021,31(4):717-728
This paper presents the development and implementation of an innovative mixed integer programming based mathematical model for an open pit mining operation with Grade Engineering framework. Grade Engineering comprises a range of coarse-separation based pre-processing techniques that separate the desirable (i.e. high-grade) and undesirable (i.e. low-grade or uneconomic) materials and ensure the delivery of only selected quantity of high quality (or high-grade) material to energy, water, and cost-intensive processing plant. The model maximizes the net present value under a range of operational and processing constraints. Given that the proposed model is computationally complex, the authors employ a data pre-processing procedure and then evaluate the performance of the model at several practical instances using computation time, optimality gap, and the net present value as valid measures. In addition, a comparison of the proposed and traditional (without Grade Engineering) models reflects that the proposed model outperforms the traditional formulation. 相似文献
3.
The complexity and uncertainties associated with mining operations often lead to deviations from short-term plans. A proactive approach will predict such deviations and help minimise opportunity losses, providing economic and operational gains. This paper presents an optimisation tool as a dynamic shovel allocation decision-maker for mining operation simulation models. The objectives of the optimisation tool are to provide shovel allocations to mining faces in order to maximise production, meet desired head grade and tonnage at the crushers, and minimise shovel movements. This paper presents the development and implementation of the optimisation tool with an iron ore mine case study. 相似文献
4.
Mandeep Singh Ramdev Rohit Bajaj Ruchika Gupta 《New Review of Information Networking》2020,25(1):71-82
ABSTRACT Wireless Interoperability for Multiple Access (WiMAX) is one of the emerging fields of high-speed wireless communication that has enormous capabilities due to its range and the connection speed. Like wireless local area networks (LANs), WiMAX networks implement multiple quality of service (QoS) frameworks at the Media Access Control (MAC) level for assured data, voice, and video services. The question of ensuring QoS is basically how to distribute available resources to users in order to satisfy QoS parameters such as latency, jitter and throughput requirements. IEEE 802.16 standard does not have any particular guidelines on scheduling of incoming and outgoing data. This has caught the attention of researchers working on WiMAX. This article discusses the various issues in WiMAX along with a classification of various scheduling approaches based upon the type of scheduler for the sake of better understanding the scheduling problem and analyzing various available theories. 相似文献
5.
The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is pro-posed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the“excel-lent”infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Final y, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained. 相似文献
6.
This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances. 相似文献
7.
We propose a novel method for integrating planning and scheduling problems under production uncertainties. The integrated problem is formulated into a bi-level program. The planning problem is solved in the upper level, while the scheduling problems in the planning periods are solved under uncertainties in the lower level. The planning and scheduling problems are linked via service level constraints. To solve the integrated problem, a hybrid method is developed, which iterates between a mixed-integer linear programming solver for the planning problem and an agent-based reactive scheduling method. If the service level constraints are not met, a cutting plane constraint is generated by the agent-based scheduling method and appended to the planning problem which is solved to determine new production quantities. The hybrid method returns an optimality gap for validating the solution quality. The proposed method is demonstrated by two complicated problems which are solved efficiently with small gaps less than 1%. 相似文献
8.
We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions. 相似文献
9.
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. 相似文献
10.
Optimization of leakage power is essential for nanoscale CMOS (nano-CMOS) technology based integrated circuits for numerous reasons, including improving battery life of the system in which they are used as well as enhancing reliability. Leakage optimization at an early stage of the design cycle such as the register-transfer level (RTL) or architectural level provides more degrees of freedom to design engineers and ensures that the design is optimized at higher levels before proceeding to the next and more detailed phases of the design cycle. In this paper, an RTL optimization approach is presented that targets leakage-power optimization while performing simultaneous scheduling, allocation and binding. The optimization approach uses a nature-inspired firefly algorithm so that large digital integrated circuits can be effectively handled without convergence issues. The firefly algorithm optimizes the cost of leakage delay product (LDP) under various resource constraints. As a specific example, gate-oxide leakage is optimized using a 45 nm CMOS dual-oxide based pre-characterized datapath library. Experimental results over various architectural level benchmark integrated circuits show that average leakage optimization of 90% can be obtained. For a comparative perspective, an integer linear programming (ILP) based algorithm is also presented and it is observed that the firefly algorithm is as accurate as ILP while converging much faster. To the best of the authors׳ knowledge, this is the first ever paper that applies firefly based algorithms for RTL optimization. 相似文献