全文获取类型
收费全文 | 12235篇 |
免费 | 1490篇 |
国内免费 | 1524篇 |
专业分类
电工技术 | 1209篇 |
综合类 | 917篇 |
化学工业 | 339篇 |
金属工艺 | 209篇 |
机械仪表 | 1236篇 |
建筑科学 | 126篇 |
矿业工程 | 137篇 |
能源动力 | 192篇 |
轻工业 | 111篇 |
水利工程 | 241篇 |
石油天然气 | 41篇 |
武器工业 | 78篇 |
无线电 | 1508篇 |
一般工业技术 | 1310篇 |
冶金工业 | 212篇 |
原子能技术 | 45篇 |
自动化技术 | 7338篇 |
出版年
2024年 | 82篇 |
2023年 | 202篇 |
2022年 | 323篇 |
2021年 | 346篇 |
2020年 | 459篇 |
2019年 | 394篇 |
2018年 | 383篇 |
2017年 | 483篇 |
2016年 | 538篇 |
2015年 | 586篇 |
2014年 | 812篇 |
2013年 | 1284篇 |
2012年 | 927篇 |
2011年 | 909篇 |
2010年 | 692篇 |
2009年 | 836篇 |
2008年 | 877篇 |
2007年 | 871篇 |
2006年 | 748篇 |
2005年 | 690篇 |
2004年 | 552篇 |
2003年 | 435篇 |
2002年 | 353篇 |
2001年 | 256篇 |
2000年 | 196篇 |
1999年 | 193篇 |
1998年 | 142篇 |
1997年 | 117篇 |
1996年 | 110篇 |
1995年 | 81篇 |
1994年 | 78篇 |
1993年 | 49篇 |
1992年 | 46篇 |
1991年 | 41篇 |
1990年 | 30篇 |
1989年 | 23篇 |
1988年 | 15篇 |
1987年 | 3篇 |
1986年 | 17篇 |
1985年 | 13篇 |
1984年 | 12篇 |
1983年 | 9篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1976年 | 4篇 |
1975年 | 4篇 |
1972年 | 2篇 |
1971年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
1.
Sidhartha R. Das Basheer M. Khumawala 《International Journal of Flexible Manufacturing Systems》1991,3(2):121-147
Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system.The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence.A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions. 相似文献
2.
Andrzej Ciepielewski 《International journal of parallel programming》1991,20(6):421-451
Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB 相似文献
3.
In this paper, we study a manufacturing system consisting of two machines separated by two intermediate buffers, and capable of producing two different products. Each product requires a constant processing time on each of the machines. Each machine requires a constant non-negligible setup change time from one product to the other. The demand rate for each product is considered to be piecewise constant. Each machine undergoes failure and repair. The time-to-failure and time-to-repair are exponentially distributed random variables. The setup change and processing operations are resumable. We model our system as a continuous time, continuous flow process. An optimal control problem is formulated for the system to minimize the total expected discounted cost over an infinite horizon. To determine the optimal control policy structure, a discrete version of the problem is solved numerically using a dynamic programming formulation with a piecewise linear penalty function. A real-time control algorithm is then developed with the objective of maintaining low work-in-process inventory and keeping the production close to the demand. The algorithm uses a hierarchical control structure to generate the loading times for each product on each machine in real time and to respond to random disruptions in the system. The system is simulated using this algorithm to study its performance. The performance of the algorithm is also compared to alternative policies. 相似文献
4.
Scheduling emergency medicine residents (EMRs) is a complex task, which considers a large number of rules (often conflicting) related to various aspects such as limits on the number of consecutive work hours, number of day and night shifts that should be worked by each resident, resident staffing requirements according to seniority levels for the day and night shifts, restrictions on the number of consecutive day and night shifts assigned, vacation periods, weekend off requests, and fair distribution of responsibilities among the residents. Emergency rooms (ERs) are stressful workplaces, and in addition shift work is well-known to be more demanding than regular daytime work. For this reason, preparing schedules that suit the working rules for EMRs is especially important for reducing the negative impact on shift workers physiologically, psychologically, and socially. In this paper, we present a goal programming (GP) model that accommodates both hard and soft constraints for a monthly planning horizon. The hard constraints should be adhered to strictly, whereas the soft constraints can be violated when necessary. The relative importance values of the soft constraints have been computed by the analytical hierarchy process (AHP), which are used as coefficients of the deviations from the soft constraints in the objective function. The model has been tested in the ER of a major local university hospital. The main conclusions of the study are that problems of realistic size can be solved quickly and the generated schedules have very high qualities compared to the manually prepared schedules, which require a lot of effort and time from the chief resident who is responsible for this duty. 相似文献
5.
本文介绍单光子时间分辨在线谱仪系统中的多道分析器与IBM PC/XT微型计算机接口的工作原理及控制程序。 相似文献
6.
George Chryssolouris James E. Pierce Kristian Dicke 《International Journal of Flexible Manufacturing Systems》1992,4(3-4):309-330
This paper introduces a generic decision-making framework for assigning resources of a manufacturing system to production tasks. Resources are broadly defined production units, such as machines, human operators, or material handling vehicles; and tasks are activities performed by resources. In the specific context of FMS, resources correspond to individual machines; tasks correspond to operations to be performed on parts. The framework assumes a hierarchical structure of the system and calls for the execution of four consecutive steps to make a decision for the assignment of a resource to a task. These steps are 1) establishment of decision-making criteria, 2) formation of alternative assignments, 3) estimation of the consequences of the assignments, and 4) selection of the best alternative assignment. This framework has been applied to an existing FMS as an operational policy that decides what task will be executed on which resource of this FMS. Simulation runs provide some initial results of the application of this policy. It is shown that the policy provides flexibility in terms of system performance and computational effort. 相似文献
7.
Paolo Detti 《Journal of Scheduling》2008,11(3):205-212
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled
jobs. 相似文献
8.
Xianpeng Wang Lixin Tang 《The International Journal of Advanced Manufacturing Technology》2008,36(5-6):431-441
This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer
programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using
this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable
of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain
near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure
of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic
has been developed and tested on instances collected from practical production data. The experimental results show that the
proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional
serial method. 相似文献
9.
10.