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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dynamic Power Adjustment and Resource Allocation Framework for LTE Networks 21

Dynamic Power Adjustment and Resource Allocation Framework f...

引用

21st IEEE International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)

作者： Secinti, Gokhan Ozcevik, Muge Erel Chowdhury, Kaushik R. Canberk, Berk Istanbul Tech Univ Dept Comp Engn Istanbul Turkey Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA

ISBN: (纸本)9781509025589

In current LTE deployments, the unsupervised and unilateral installation of home or localized base stations, so called eNodeBs, may easily lead to excessive energy consumption and over-provisioning of network infrastructure. In this paper, we propose an energy efficient framework, which dynamically adjusts the power requirements of the system and performs Resource Block (RBs) allocation based on needs. It specifically optimizes power consumption of LTE networks consisting of under-utilized eNodeBs. The Energy Efficiency (EE) issue is formulated as an optimization problem, which trades off EE for SE without adversely impacting the downlink throughput. In order to solve this problem, we develop a heuristic approach called as Two Phase Enhanced branch and bound algorithm (TPEBB) [1]. End-to-end latency, modeled by Markov queues, is used as the main metric for QoS in this study [2]. Finally, we compare the proposed framework with various competing methods to show almost 70% improvement in EE and end-to-end latency.

关键词： Power Adjustment Resource Allocation Co-tier Interference Energy Efficiency branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

GEMS, a Generic Engine for MDO Scenarios: Key Features In Application

GEMS, a Generic Engine for MDO Scenarios: Key Features In Ap...

引用

AIAA Aviation Forum and Exposition

作者： Gallard, F. Barjhoux, P. J. Olivanti, R. Gazaix, A. Inst Technol IRT St Exupery Syst Engn & Modeling Dept Toulouse France Inst Technol IRT St Exupery Toulouse France Univ Toulouse ICA F-31400 Toulouse France Airbus Operat SAS F-31060 Toulouse France Univ Toulouse ISAE SUPAERO F-31400 Toulouse France

ISBN: (数字)9781624105890

ISBN: (纸本)9781624105890

This paper illustrates the capabilities of the GEMS (a Generic Engine for MDO Scenarios) Multidisciplinary Design Optimization software library, on three MDO use cases. A range of aircraft MDO applications are covered, showing the versatility of GEMS, both in terms of problems that can be addressed, and type of users, from academic to industrial ones. The focus is made on how the framework concepts allow to set up the MDO processes in an automatic and versatile way. The first use case is a series of trade-offs and MDO processes for high-fidelity aerodynamics-structure-OAD (Overall Aircraft Design) industrial engine pylon design, which is the main application of the IRT Saint Exupery MDA-MDO project. The second use case, consists in two multi-level MDO formulations that are developed to address mixed categorical and continuous structural optimization problems. In the third use case, an algorithmic framework is developed to perform multi-fidelity adjoint-based aerodynamic shape optimization, aiming at decreasing the restitution time compared to mono-fidelity approaches.

关键词： Multidisciplinary Design Optimization Aerodynamic Shape Optimization Structural Optimization Aircraft Design branch and bound algorithm Structural Simulation Derivative Free Optimization Finite Element Modeling Nastran Application Programming Interface

来源：评论

学校读者我要写书评

暂无评论

algorithm and Application of a Kind of Quadratic Integer Programming Model

Algorithm and Application of a Kind of Quadratic Integer Pro...

引用

2nd International Conference on Business Intelligence and Financial Engineering

作者： Wang, Zhufang Liu, Yingjie Shenyang Univ Technol Sch Management Shenyang 110178 Peoples R China

ISBN: (纸本)9780769537054

In order to solve a kind of quadratic integer programming problem with unrestrained conditions and multi-objective function, improvements on the traditional branch and bound algorithm are carried out in this paper. By introducing response function, a practical branch and bound algorithm to solve the quadratic integer programming model is derived. The procedure of the proposed algorithm is explicated in this paper and an example with two manufactures is studied. Numerical results show that the proposed algorithm is more effective than the traditional branch and bound algorithm, and fit for more complex problems.

关键词： branch and bound algorithm quadratic integer programming response function cournot model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：