首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7582篇
  免费   235篇
  国内免费   233篇
电工技术   621篇
综合类   230篇
化学工业   412篇
金属工艺   202篇
机械仪表   813篇
建筑科学   231篇
矿业工程   84篇
能源动力   384篇
轻工业   48篇
水利工程   47篇
石油天然气   58篇
武器工业   52篇
无线电   595篇
一般工业技术   392篇
冶金工业   200篇
原子能技术   39篇
自动化技术   3642篇
  2024年   14篇
  2023年   48篇
  2022年   90篇
  2021年   129篇
  2020年   113篇
  2019年   109篇
  2018年   114篇
  2017年   196篇
  2016年   230篇
  2015年   286篇
  2014年   406篇
  2013年   490篇
  2012年   411篇
  2011年   632篇
  2010年   349篇
  2009年   458篇
  2008年   512篇
  2007年   465篇
  2006年   486篇
  2005年   404篇
  2004年   311篇
  2003年   292篇
  2002年   252篇
  2001年   128篇
  2000年   136篇
  1999年   151篇
  1998年   116篇
  1997年   99篇
  1996年   89篇
  1995年   69篇
  1994年   76篇
  1993年   58篇
  1992年   38篇
  1991年   42篇
  1990年   45篇
  1989年   42篇
  1988年   23篇
  1987年   15篇
  1986年   20篇
  1985年   15篇
  1984年   25篇
  1983年   12篇
  1982年   20篇
  1981年   10篇
  1980年   3篇
  1979年   3篇
  1978年   7篇
  1977年   4篇
  1976年   3篇
  1974年   2篇
排序方式: 共有8050条查询结果,搜索用时 0 毫秒
1.
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.  相似文献   
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.
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.  相似文献   
4.
This study is to evaluate the potential for development of a cellulosic ethanol facility in Vietnam. Rice straw is abundant in Vietnam and highly concentrated in the Mekong Delta, where about 26 Mt year−1 of rice straw has been yearly produced. To minimize the overall production cost (PC) of ethanol from rice straw, it is crucial to choose the optimal facility size. The delivered cost of rice straw varied from 20.5 to 65.4 $ dry t−1 depending on transportation distance. The Mekong Delta has much lower rice straw prices compared with other regions in Vietnam because of high density and quantity of rice straw supply. Thus, this region has been considered as the most suitable location for deploying ethanol production in Vietnam. The optimal plant size of ethanol production in the region was estimated up to 200 ML year−1. The improvement in solid concentration of material in the hydrothermal pre-treatment step and using residues for power generation could substantially reduce the PC in Vietnam, where energy costs account for the second largest contribution to the PC, following only enzyme costs. The potential for building larger ethanol plants with low rice straw costs can reduce ethanol production costs in Vietnam. The current estimated production cost for an optimal plant size of 200 ML year−1 was 1.19 $ L−1. For the future scenario, considering improvements in pre-treatment, enzyme hydrolysis steps, specific enzyme activity, and applying residues for energy generation, the ethanol production cost could reduce to 0.45 $ L−1 for a plant size of 200 ML year−1 in Vietnam. These data indicated that the cost-competitiveness of ethanol production could be realized in Vietnam with future improvements in production technologies.  相似文献   
5.
本文针对并行网络、二元局部判决的情况,研究了在相关条件下基于N-P准则的分布式检测融合算法,给出了在联合概率密度已知和未知两种情况下的最优融合规则的理论推导及相应的解决方案,并在实验仿真的基础上,得到了部分有益的结论。  相似文献   
6.
The problem of operating freeze drying of pharmaceutical products in vials placed in trays of a freeze dryer to remove free water (in frozen state) at a minimum time was formulated as an optimal control problem. Two different types of freeze dryer designs were considered. In type I freeze dryer design, upper and lower plate temperatures were controlled together, while in type II freeze dryer design, upper and lower plate temperatures were controlled independently. The heat input to the material being dried and the drying chamber pressure were considered as control variables. Constraints were placed on the system state variables by the melting and scorch temperatures during primary drying stage. Necessary conditions of optimality for the primary drying stage of freeze drying process in vials are derived and presented. Furthermore, an approach for constructing the optimal control policies that would minimize the drying time for the primary drying stage was given. In order to analyze optimal control policy for the primary drying stage of the freeze-drying process in vials, a rigorous multi-dimensional unsteady state mathematical model was used. The theoretical approach presented in this work was applied in the freeze drying of skim milk. Significant reductions in the drying times of primary drying stage of freeze drying process in vials were obtained, as compared to the drying times obtained from conventional operational policies.  相似文献   
7.
This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem.  相似文献   
8.
Planning is an essential function of project management. Yet, many small- and medium-sized contractors do a relatively poor job of operational planning. Better prebid plans will reduce costs, shorten schedules, and improve labor productivity. Unfortunately, the published literature offers little guidance for smaller contractors on what constitutes effective planning. Most papers describe planning as a macrolevel process for owners. Most emphasize scope definition for industrial projects. This paper describes a microlevel planning process for contractors. It consists of eight steps which are: (1) assess contract risks; (2) develop a preliminary execution plan; (3) develop site layout plans; (4) identify the sequences that are essential-to-success; (5) develop detailed operational plans; (6) develop proactive strategies to assure construction input into design; (7) revise the preliminary plan; and (8) communicate and enforce the plan. The entire process is illustrated with a case study project and is fully illustrated with figures which show how to integrate the work of multiple contractors, keep key resources (crews or equipment) fully engaged with no downtime, provide time buffers so the work of follow on crews can be efficiently done, expedite the schedule using multiple work stations and concurrent work, ways to communicate the work plan to the superintendent and foremen, and how to assess the feasibility of various work methods. The steps are easy to understand and implement. They will yield immediate positive results.  相似文献   
9.
Coordinating production and distribution of jobs with bundling operations   总被引:1,自引:0,他引:1  
We consider an integrated scheduling and distribution model in which jobs completed by two different machines must be bundled together for delivery. The objective is to minimize the sum of the delivery cost and customers' waiting costs. Such a model not only attempts to coordinate the job schedules on both machines, but also aims to coordinate the machine schedules with the delivery plan. Polynomial-time heuristics and approximation schemes are developed for the model with only direct shipments as well as the general model with milk-run deliveries.  相似文献   
10.
詹铁柱 《包装工程》2002,23(2):59-61
跳出传统的设计思路,提出装多件内装物的瓦楞纸箱尺寸优化设计方法,建立优化设计模型,编写程序用于生产,节省纸用量,降低成本。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号