首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   546篇
  免费   31篇
  国内免费   23篇
电工技术   9篇
综合类   14篇
化学工业   12篇
金属工艺   1篇
机械仪表   16篇
建筑科学   3篇
矿业工程   1篇
武器工业   1篇
无线电   19篇
一般工业技术   166篇
冶金工业   48篇
自动化技术   310篇
  2024年   2篇
  2023年   3篇
  2022年   6篇
  2021年   5篇
  2020年   9篇
  2019年   16篇
  2018年   11篇
  2017年   41篇
  2016年   26篇
  2015年   13篇
  2014年   23篇
  2013年   92篇
  2012年   25篇
  2011年   29篇
  2010年   14篇
  2009年   32篇
  2008年   21篇
  2007年   19篇
  2006年   35篇
  2005年   21篇
  2004年   21篇
  2003年   16篇
  2002年   9篇
  2001年   12篇
  2000年   8篇
  1999年   13篇
  1998年   16篇
  1997年   8篇
  1996年   12篇
  1995年   7篇
  1994年   7篇
  1993年   5篇
  1992年   5篇
  1991年   2篇
  1990年   5篇
  1989年   2篇
  1988年   2篇
  1986年   3篇
  1984年   1篇
  1979年   1篇
  1975年   1篇
  1957年   1篇
排序方式: 共有600条查询结果,搜索用时 0 毫秒
1.
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.
Minimizing the number of tool switches on a flexible machine   总被引:5,自引:0,他引:5  
This article analyzes a tool switching problem arising in certain flexible manufacturing environments. A batch of jobs have to be successively processed on a single flexible machine. Each job requires a subset of tools, which have to be placed in the tool magazine of the machine before the job can be processed. The tool magazine has a limited capacity, and, in general, the number of tools needed to produce all the jobs exceeds this capacity. Hence, it is sometimes necessary to change tools between two jobs in a sequence. The problem is then to determine a job sequence and an associated sequence of loadings for the tool magazine, such that the total number of tool switches is minimized. This problem has been previously considered by several authors; it is here revisited, both from a theoretical and from a computational viewpoint. Basic results concerning the computational complexity of the problem are established. Several heuristics are proposed for its solution, and their performance is computationally assessed.  相似文献   
3.
The paper presents a case study of the development of an expert decision support system which uses simple heuristic methods for fast determination of routes for simultaneous signals in a transmission network of limited capacity. It illustrates how heuristic solutions can be embodied in a model-based DSS and how the standard decision support literature, although intuitively appealing, provides little practical assistance in system construction or classification  相似文献   
4.
Decision routines unburden the cognitive capacity of the decision maker. In changing environments, however, routines may become maladaptive. In 2 experiments with a hypothetical stock market game (n = 241), the authors tested whether decision routines tend to persist at the level of decision strategies rather than at the level of options in strategy selection. The payoff structure of the task was changed after 80 decision trials, rendering a new strategy optimal with respect to expected payoff. Whereas most participants detected the appropriate strategy at the beginning of the task, they tended to retain it even when it was no longer optimal. A hint about a possible change had only a small influence on this maladaptive routine; a monetary incentive had none. Switching to a similar but not identical task relaxed the routine, but not much. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
5.
Interactive expert systems seek relevant information from a user in order to answer a query or to solve a problem that the user has posed. A fundamental design issue for such a system is therefore itsinformation-seeking strategy, which determines the order in which it asks questions or performs experiments to gain the information that it needs to respond to the user. This paper examines the problem of optimal knowledge acquisition through questioning in contexts where it is expensive or time-consuming to obtain the answers to questions. An abstract model of an expert classification system — considered as a set of logical classification rules supplemented by some statistical knowledge about attribute frequencies — is developed and applied to analyze the complexity and to present constructive algorithms for doing probabilistic question-based classification. New heuristics are presented that generalize previous results for optimal identification keys and questionnaires. For an important class of discrete discriminant analysis problems, these heuristics find optimal or near-optimal questioning strategies in a small fraction of the time required by an exact solution algorithm.  相似文献   
6.
Hyper heuristics is a relatively new optimisation algorithm. Numerous studies have reported that hyper heuristics are well applied in combinatorial optimisation problems. As a classic combinatorial optimisation problem, the row layout problem has not been publicly reported on applying hyper heuristics to its various sub-problems. To fill this gap, this study proposes a parallel hyper-heuristic approach based on reinforcement learning for corridor allocation problems and parallel row ordering problems. For the proposed algorithm, an outer layer parallel computing framework was constructed based on the encoding of the problem. The simulated annealing, tabu search, and variable neighbourhood algorithms were used in the algorithm as low-level heuristic operations, and Q-learning in reinforcement learning was used as a high-level strategy. A state space containing sequences and fitness values was designed. The algorithm performance was then evaluated for benchmark instances of the corridor allocation problem (37 groups) and parallel row ordering problem (80 groups). The results showed that, in most cases, the proposed algorithm provided a better solution than the best-known solutions in the literature. Finally, the meta-heuristic algorithm applied to three low-level heuristic operations is taken as three independent algorithms and compared with the proposed hyper-heuristic algorithm on four groups of parallel row ordering problem instances. The effectiveness of Q-learning in selection is illustrated by analysing the comparison results of the four algorithms and the number of calls of the three low-level heuristic operations in the proposed method.  相似文献   
7.
The warehouse order-picking operation is one of the most labour-intense activities that has an important impact on responsiveness and efficiency of the supply chain. An understanding of the impact of the simultaneous effects of customer demand patterns and order clustering, considering physical restrictions in product storage, is critical for improving operational performance. Storage restrictions may include storing non-uniform density stock keeping units (SKUs) whose dimensions and weight constrain the order-picking operation given that a priority must be followed. In this paper, a heuristic optimisation based on a quadratic integer programming is employed to generate a layout solution that considers customer demand patterns and order clustering. A simulation model is used to investigate the effects of creating and implementing these layout solutions in conjunction with density zones to account for restrictions in non-uniform density SKUs. Results from combining layout optimisation heuristics and density zoning indicate statistical significant differences between assignments that ignore the aforementioned factors and those that recognise it.  相似文献   
8.
We study a dynamic capacity allocation problem with admission control decisions of a company that caters for two demand classes with random arrivals, capacity requirements and strict due dates. We formulate the problem as a Markov decision process (MDP) in order to find the optimal admission control policy that maximises the expected profit of the company. Such a formulation suffers a state-space explosion. Moreover, it involves an additional dimension arising from the multiple possible order sizes that customers can request which further increases the complexity of the problem. To reduce the cardinality of possible policies, and, thus, the computational requirements, we propose a threshold-based policy. We formulate an MDP to generate such a policy. To deal with the curse of dimensionality, we develop threshold-based approximate algorithms based on the state-reduction heuristics with aggregation proposed previously. Our results reveal that for the majority of instances considered the optimal policy has a threshold structure. We then demonstrate the superiority of the proposed threshold-based approximate algorithms over two benchmark policies in terms of the generated profits and the robustness of the solutions to changes in operational conditions. Finally, we show that our proposed policies are also robust to changes in actual demand from its estimation.  相似文献   
9.
The agriculture sector still lacks the tools and models to enhance the utilization of different resources. This paper addresses the vineyard harvesting problem in developing countries, with the objective of optimizing the wine quality and minimizing the operational costs. Heuristics were introduced to better assign the harvesting days to the different grape blocks that exist in the vineyard's field. The quality of the grapes was a key target as it can transform production from a pinnacle wine to a bulk one. We solved several numerical examples for verification and demonstrative purposes and found that our proposed approach finds solutions that significantly reduce the harvesting costs in the vineyard and considerably outperform Branch and Bound algorithm especially for large problems.  相似文献   
10.
Given a set of products each with positive discrete demand, and a set of markets selling products at given prices, the traveling purchaser problem (TPP) looks for a tour visiting a subset of markets such that products demand is satisfied at minimum purchasing and traveling costs. In this paper we analyze a dynamic variant of the problem, where quantities may decrease as time goes on. Complete information is assumed on current state of the world, i.e. decision maker knows quantities available for each product in each market at present time and is informed about any consumption event when it occurs. Nevertheless, planner does not have any information on future events. Two groups of heuristics are described and compared. The first group consists of simplified approaches deciding which market to visit next on the basis of some greedy criteria considering only one of the two objective costs. The second one includes heuristics based on a look-ahead approach taking into account both traveling and purchasing costs and inserting some future prediction. Heuristics behavior has been tested on a large set of randomly generated instances under different levels of dynamism.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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