检索结果-内蒙古大学图书馆

3rd International Conference on Informatics and Data-Driven Medicine (IDDM)

作者： Shestakevych, Tetiana Andrunyk, Vasyl Lviv Polytech Natl Univ 12 Stepana Bandery Str Lvov Ukraine

Consolidation and processing of the experts' knowledge in the correction of communication and social skills of students with autism spectrum disorder seem to be both an actual task, and a challenge. Being well-aware of special needs of each and every student, psychologists and medics, as well as all the participants of education of ASD students, when making a decision about which information technology to use, apply their experience with exact ASD student. Expert evaluation technique enables support in such decision making, and its result can be used as input information to optimization task, solving which will allow taking into account different constraints.

关键词： Autism autism spectrum disorder ASD analytic hierarchy process AHP expert evaluation knapsack problem branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Scheduling on Identical Machines with Batch Arrivals in Semiconductor Testing House

Scheduling on Identical Machines with Batch Arrivals in Semi...

引用

International Conference on Industrial Engineering and Engineering Management

作者： Chung, T. P. Liao, C. J. Su, L. H. Natl Taiwan Univ Sci & Technol Dept Ind Management Taipei Taiwan Chung Yuan Christian Univ Dept Ind Engn Chungli Taiwan

ISBN: (纸本)9781424426294

In the scheduling literature, it is often assumed that jobs arrive either simultaneously or individually. However, this assumption is invalid in most practical situations because jobs usually arrive in batches, e.g., the final testing house in the manufacturing of semiconductor. The concept of batch arrivals has been mentioned in some studies, but it has not been explored from an operational viewpoint. This paper first addresses an identical parallel machine problem with batch arrivals to minimize the total completion time. Since the problem is NP-hard, a heuristic based on binary integer program Is proposed. Computational results show that the proposed heuristic can efficiently obtain good solutions with an average percentage error of 0.41.

关键词： Batch arrivals identical parallel machines semiconductor scheduling branch and bound algorithm total completion time

来源：评论

学校读者我要写书评

暂无评论

Mining scheduling knowledge for job shop scheduling problem 15

Mining scheduling knowledge for job shop scheduling problem

引用

15th IFAC Symposium on Information Control Problems in Manufacturing

作者： Wang, C. L. Rong, G. Weng, W. Feng, Y. P. Zhejiang Univ Inst Cyber Syst & Control State Key Lab Ind Control Technol Hangzhou 310003 Zhejiang Peoples R China Waseda Univ Grad Sch Informat Prod & Syst Wakamatsu Ku Kitakyushu Fukuoka 8080135 Japan

The optimal or near-optimal schedules generated by traditional optimization or approximation methods for job shop scheduling problems (JSSP) contain valuable scheduling patterns about this kind of scheduling problems. These patterns could be used to improve the dispatching performance and provide insights into the corresponding scheduling problems. This paper uses timed Petri nets to describe the dispatching processes of the job shop scheduling scenarios. On this basis, a data mining based scheduling knowledge extraction framework is developed to mine the expected scheduling knowledge from the solutions generated by traditional optimization or approximation method for JSSP. Based on this, we show how to use the extracted knowledge as a new dispatching rule to generate complete schedules. A novel method is further developed to combine the extracted knowledge with traditional heuristics to construct new composite dispatching rules which could gain better performance. Besides, we propose a novel approach to utilize the extracted knowledge to improve a Petri net based branch and bound algorithm used in this paper. A series of experiments is carried out to evaluate the performance of the proposed methods. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Job shop scheduling Data mining Dispatching rule Petri net branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A statistical model for global optimization by means of select and clone

引用

Optimization 2000年第1期48卷 117-135页

作者： Žiltnskas, Antanas Institute of Mathematics and Informatics VMU Vilnius Akaemijos str 4 Lithuania

A statistical model for global optimization is constructed generalizing some properties of the Wiener process to the multidimensional case. A new approach, which is similar to the branch and bound approach, is proposed to the construction of algorithms based on statistical models. A two dimensional version of the algorithm is implemented, and test results are presented. © 2000 OPA (Overseas Publishers Association) N.V.

关键词： branch and bound algorithm Global optimization Multi-dimensional algorithms Select and clone technique Statistical model Wiener process

来源：评论

学校读者我要写书评

暂无评论

Computational Approaches for Efficient Scheduling of Steel Plants as Demand Response Resource 19

Computational Approaches for Efficient Scheduling of Steel P...

引用

19th Power Systems Computation Conference (PSCC)

作者： Zhang, Xiao Hug, Gabriela Kolter, Zico Harjunkoski, Iiro Carnegie Mellon Univ Elect & Comp Engn Pittsburgh PA 15213 USA Swiss Fed Inst Technol Informat Technol & Elect Engn Zurich Switzerland Carnegie Mellon Univ Comp Sci Pittsburgh PA 15213 USA ABB Corp Res Ladenburg Germany

ISBN: (纸本)9788894105124

Demand response is seeing increased popularity worldwide and industrial loads are actively taking part in this trend. As a host of energy-intensive industrial processes, steel plants have both the motivation and potential to provide demand response. However, the scheduling of steel plants is very complex and the involved computations are intense. In this paper, we focus on these difficulties and propose methods such as adding cuts and implementing an application-specific branch and bound algorithm to make the computations more tractable.

关键词： branch and bound algorithm mixed integer programming demand response steel plant scheduling resource task network

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL CAPITAL INVESTMENT IN THE EXPANSION OF AN EXISTING WATER RESOURCES SYSTEMS

引用

JAWRA Journal of the American Water Resources Association 1971年第6期7卷 1194-1209页

作者： Himmelblau, D.M. Department of Chemical Engineering E. P. Schoch Laboratories University of Texas at Austin Austin Texas 78712 United States

The study of the optimal expansion of existing water resources systems is of continuing importance because of the rising demand and limited supply of water in many areas of the world, particularly in the southwestern part of the United States of America. This study is concerned with the investigation of the optimal expansion of a realistic water resources system to meet an increasing demand for municipal and industrial use, irrigation, energy, and recreation over a planning horizon of T years. A number of possible dam sites are available for the further regulation of river (canal) flows in the basin and/or the regulation of imported waters into the basin. To maximize, over the set of alternative projects, the sum of discounted present value of net earnings subject to the demands and various institutional, physical and budgetary limits, an optimization problem (Problem I) was formed as a 0‐1 mixed integer programming problem and was decomposed into the set of all feasible combinations (Problem II). The economic return was determined for each combination (Problem III). Problem II was solved by a branch and bound procedure which selected each feasible combination of dams while the optimal return for each such combination (Problem III) was found by a network analysis code. Copyright © 1971, Wiley Blackwell. All rights reserved

关键词： KEY WORDS: water resources system optimal expansion capital investments integer programming decomposition branch and bound algorithm network analysis system operating rules

来源：评论

学校读者我要写书评

暂无评论

Crops Plantation Problem in Uncertain Environment 2nd

Crops Plantation Problem in Uncertain Environment

引用

2nd International Conference on Advanced Intelligent Technologies (ICAIT)

作者： Zhong, Haitao Liang, Fangchi Zheng, Mingfa Zhang, Lisheng Air Force Engn Univ Fundamentals Dept Xian 710051 Peoples R China

ISBN: (纸本)9789811697357;9789811697340

This article focuses on the crop planting problem under uncertainty environment based on uncertainty theory. Firstly, we consider that these crop profit coefficients are uncertain variables, and these labor factors are random variables, and an uncertainty model for crop planting problem is proposed. And then, the uncertainty model is transformed into a certain model by expected values. Further, we show a useful branch and bound algorithm procedure to obtain optimal planting plan. Finally, this model and approach can be applied for any other optimal problems with uncertainty factors.

关键词： branch and bound algorithm Crop planting Uncertainty coefficient Uncertainty theory

来源：评论

学校读者我要写书评

暂无评论

A CODED algorithm FOR CAPACITY EXPANSION OF A WATER QUALITY MANAGEMENT SYSTEM

引用

JAWRA Journal of the American Water Resources Association 1978年第4期14卷 809-826页

作者： O'Laoghaire D.T. Instituto Venezolano de Investigaciones Científicas Laboratorio de Ingeniería Ambiental Apartado Caracas 1827 Venezuela

ABSTRACT: This paper describes a mathematical model, an algorithm and a computer program that were specially developed to study the problem of a water quality management system undergoing a rapidly increasing environmental stress. The model output will determine the locations, sizes and the timing of construction of new treatment plants plus an overall treatment plant operating policy so that environmental standards are maintained at a minimum cost. The model, as formulated, is a 0‐1 mixed integer programming problem which is solved by decomposing it into a capital budgeting problem (solved by Little's branch and bound algorithm) and an operational policy problem (solved by linear programming). The coded algorithm (in FORTRAN 10) has been tested with a semi‐realistic example. Copyright © 1978, Wiley Blackwell. All rights reserved

关键词： branch and bound algorithm capital investment integer programming linear programming system operating rules water quality management

来源：评论

学校读者我要写书评

暂无评论

On the Minimization of the Width of the Control Memory of Microprogrammed Processors

引用

IEEE Transactions on Computers 1979年第4期C-28卷 310-316页

作者： Baer, Jean-Loup Koyama, Barbara Department of Computer Science University of Washington Seattle WA 98195 United States Lawrence Livermore Laboratory Livermore CA United States

A branch and bound method to minimize the width of the control memory of microprogrammed processors is given. Although it is exponential in the worst case, it appears much more effective than previous enumerative solutions. Furthermore, it can lead quickly to near-optimal solutions representing “good engineering” reductions. Copyright © 1979 by the Institute of Electrical and Electronics Engineers, Inc.

关键词： bin packing branch and bound algorithm control store width microprogramming near-optimal solutions NP-complete

来源：评论

学校读者我要写书评

暂无评论

BRAND AND bound algorithmS FOR THE UNRELATED PARALLEL MACHINE SCHEDULING PROBLEM WITH RESOURCE COUNSTRAINTS

BRAND AND BOUND ALGORITHMS FOR THE UNRELATED PARALLEL MACHIN...

引用

38th International Conference on Computers and Industrial Engineering

作者： Tsai, Chi-Yang Lai, Yu-Hua Department of Industrial Engineering and Management Yuan Ze University Taiwan

ISBN: (纸本)9787121074370

When dealing with machine scheduling problems, the number of available machines is usually treated as the only constrained resource. However, in many practical cases, additional resources such as operators, part holders, or tools, are also needed during the operation and the amounts of these resources are generally limited. Therefore, one needs to put resource constraints into 'consideration in order to form feasible job schedules. In this study, the branch and bound method is applied on unrelated parallel machine scheduling problems with constrained resources. Two algorithms are developed to obtain the optimal solutions much that weighted completion time is minimized. The first algorithm is job oriented. That is, the search tree is constructed according to the sequential assignment of jobs on machines. The second algorithm, on the other hand, is resource oriented A variety of numerical examples are designed with different sizes and resource strength. Numerical experiments are conducted to evaluate the performance of the proposed algorithm. It is shown from our result that the resource-oriented branch and bound algorithm is more efficient in find the optimal solutions as the number of resource is significantly smaller than the number of jobs.

关键词： branch and bound algorithm unrelated parallel machines machine scheduling resource constraints sequence-dependent setup time

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：