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

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Kim, Hyun-Jung Lee, Jun-Ho Lee, Tae-Eog Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Taejon 305701 South Korea

ISBN: (纸本)9781467317146

We examine a non-cyclic scheduling problem of a timed Petri net (TPN) with a branch and bound (B&B) algorithm. There have been many approaches and algorithms for conventional scheduling problems such as job shops, resource-constrained project scheduling problems (RCPSPs), and robotized system scheduling problems. Most of these methods have focused on their effectiveness or efficiency in solving their own problems. However, they tend to ignore the issue of compatibility with other scheduling problems and the solution methods are ad hoc and hard to be used for other scheduling problems with even small changes. Petri nets have been widely used for modeling and analyzing complex discrete event dynamic systems, such as robotized manufacturing cells or other automated manufacturing systems. There are studies on scheduling cyclic Petri net models and some non-cyclic Petri net models for specific applications. In this paper, we examine a scheduling problem for non-cyclic TPNs, where there is the starting and end transitions, and the transitions do not repeat an identical firing cycle. We also allow multiple arc weights in TPNs so as to model batch processing of tasks at a resource and multiple units of a resource required for a task. We briefly explain how various scheduling constraints and objectives can be modeled by TPNs. Then, we develop an efficient B&B procedure that utilizes a dynamic branching strategy and a resource-based lower bound. We finally present examples of the B&B algorithm for an RCPSP and a single-armed cluser tool scheduling problem.

关键词： branch and bound algorithm non-cyclic scheduling timed Petri net

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for maximum likelihood paired comparison ranking

引用

Biometrika 1972年第1期59卷 131-135页

作者： Decani, John S. University of Pennsylvania and Naval Air Development Center Warminster Pennsylvania United States

SUMMARY: A very simple algorithm for obtaining maximum likelihood rankings of k objects which have been compared pairwise is presented. After some preliminary calculations, only addition and subtraction are required so that it is possible to rank as many as ten objects using only a desk calculator. This is not practical with the linear programming algorithm proposed in an earlier paper, deCani (1969), where ranking ten objects requires the solution of a linear program with 120 constraints in 165 variables in addition to upper bound constraints. The algorithm proposed here is one of a class of algorithms called branch and bound algorithms. © 1972 Oxford University Press.

关键词： branch and bound algorithm Maximum likelihood Paired comparisons Ranking

来源：评论

学校读者我要写书评

暂无评论

A new branch and bound algorithm for loading problems in flexible manufacturing systems

引用

International Journal of Flexible Manufacturing Systems 1994年第4期6卷 361-381页

作者： Kim, Yeong-Dae Yano, Candace Arai Department of Industrial Engineering Korea Advanced Institute Of Science and Technology Yusong-gu Daejon 305-701 South Korea Department of Industrial Engineering and Operations Research The University of California Berkeley 94720 CA United States

Loading problems in flexible manufacturing systems involve assigning operations for selected part types and their associated tools to machines or machine groups. One of the objectives might be to maximize the expected production rate (throughput) of the system. Because of the difficulty in dealing with this objective directly, a commonly used surrogate objective is the closeness of the actual workload allocation to the continuous workload allocation that maximizes throughput. We test several measures of closeness and discuss correlations between these measures and throughput. Using the best measure, we show how to modify an existing branch and bound algorithm which was developed for the case of equal target workloads for all machine groups to accommodate unequal target workloads. We also develop a new branch and bound algorithm which can be used for both types of problems. The efficiency of the algorithm in finding optimal solutions is achieved through the application of better branching rules and improved dominance results. Computational results on randomly generated test problems indicate that the new algorithm performs well. © 1994 Kluwer Academic Publishers.

关键词： branch and bound algorithm FAS FMS machine loading problem

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm to Solve Nonconvex MINLP Problems via Novel Division Strategy: An Electric Power System Case Study 17

A Branch and Bound Algorithm to Solve Nonconvex MINLP Proble...

引用

17th IEEE International Conference on Environment and Electrical Engineering (IEEE EEEIC) / 1st IEEE Industrial and Commercial Power Systems Europe Conference (IEEE I and CPS Europe)

作者： de Jesus Delgado, Marcos Andre Pourakbari-Kasmaei, Mahdi Rider, Marcos Julio UFMT Dept Math Rondonopolis MT Brazil UNESP Dept Elect Engn Ilha Solteira SP Brazil Univ Estadual Campinas Dept Syst & Energy Campinas SP Brazil

ISBN: (纸本)9781538639177

This paper presents two branch and bound algorithms (B&B) for solving mixed-integer nonlinear programming (MINLP) problems with nonconvex search space. The main advantage of the proposed algorithms, comparing with the commonly used B&B algorithms, is using an innovative way of variables' separation and subproblems' division while, if necessary, one more variable is used in the separation process. This approach allows circumventing the probable difficulties caused by nonlinearity and nonconvexity. This paper aims at addressing the following issues of how to: 1) deal with nonlinear programming problems, 2) detect the infeasibility of the resulted NLP problems, and 3) deal with the nonconvexity of the problem. In order to show the applicability, the proposed algorithms are applied to one of the most complicated problems in power system, the long-term static transmission expansion planning, which is modeled as an MINLP problem. Several case studies such as Garver 6-bus, IEEE 24-bus, South Brazilian 46-bus, Bolivian 57-bus, and the Colombian 93-bus are conducted to reveal the effectiveness and shortcoming of the proposed algorithms. Results show that the proposed algorithms can find the best-known solutions for most of the aforementioned systems with a significant reduction in the number of subproblems.

关键词： branch and bound algorithm mixed-integer nonlinear programming transmission expansion planning

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for one supplier and multiple heterogeneous customers to solve a coordinated scheduling problem

A branch and bound algorithm for one supplier and multiple h...

引用

International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Hammoudan, Zakaria Grunder, Olivier Boudouh, Toufik El Moudni, Abdellah UTBM IRTES SET F-90010 Belfort France UTBM IRTES M3M F-90010 Belfort France

ISBN: (纸本)9781479967735

Considerable attention had previously been given to the single-vendor single-customer integrated inventory problem, but there had been very little work on the integrated single-vendor multi-customer and multi-product consideration. Here, we develop a generalized single-vendor multi-customer with multi-product consideration supply chain model with one transporter available to deliver the products from the supplier to the customers. The objective is to solve the proposed model and to find the minimized total cost, while guaranteeing a certain customer service level. A mathematical formulation of the problem is given in a general way. Then, we propose a branch and bound algorithm as an exact method and an efficient heuristic greedy algorithm. Both procedures are then compared through computational experiments which show that the heuristic algorithm is capable of generating near-optimal solutions within a short amount of CPU time.

关键词： customer services greedy algorithms inventory management scheduling supply chain management tree searching CPU time branch and bound algorithm coordinated scheduling problem customer service level heuristic greedy algorithm integrated single-vendor multicustomer consideration multiple heterogeneous customers multiproduct consideration supply chain model near-optimal solutions single-vendor single-customer integrated inventory problem supplier Equations Greedy algorithms Indexes Mathematical model Supply chains Vehicles greedy algorithm branch and bound algorithms customer services CPU time Tree searching Inventory management Supply chain management vehicle Mathematical Model supply chain

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for Three-Machine Flow Shop with Overlapping Waiting Time Constraints

A Branch and Bound Algorithm for Three-Machine Flow Shop wit...

引用

20th World Congress of the International-Federation-of-Automatic-Control (IFAC)

作者： Kim, Hyun-Jung Lee, Jun-Ho Sungkyunkwan Univ Dept Syst Management Engn Suwon 16419 South Korea Konkuk Univ Sch Business Seoul 05029 South Korea

This paper focuses on a three-machine flow shop scheduling problem with overlapping waiting time constraints for makespan minimization. In the problem, waiting times of each job between the first two machines and between the first and third machines are constrained by two distinctive time limits, respectively. Such overlapping waiting time constraints are one of the common scheduling requirements in semiconductor manufacturing since up to 20% of whole process steps are controlled with waiting time limits for better quality. For example, wafers completed with chemical treatment on a diffusion machine must be cleaned on a cleaning machine and then should be processed on another diffusion machine. In this case, two waiting time limits are independently applied between diffusion and cleaning machines and between two diffusion machines, respectively. We first identify several dominance properties of the problem and develop a branch and bound algorithm using the properties. We use heuristic algorithms to obtain a good initial solution and derive five different lower bounds. Computational tests are performed for evaluating the performance of the algorithm. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： flow shop waiting time constraint optimality branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimization Method for Evaluation and Decision-making of Distribution Network Planned Projects Based on branch and bound algorithm 2

An Optimization Method for Evaluation and Decision-making of...

引用

2nd IEEE Conference on Energy Internet and Energy System Integration (EI2)

作者： Jiang, Wei Wu, Jie Qi, Hui Feng, Wei Duan, Xiaofeng Southeast Univ Nanjing Jiangsu Peoples R China State Grid Taizhou Power Supply Co Taizhou Peoples R China

ISBN: (纸本)9781538685495

Under the traditional management mode of the distribution network, the marginal cost of large-scale investment to improve efficiency is becoming much higher, so the State Grid Corporation of China(SGCC) puts forward the concept of "unit planning". Under this background, by aiming at the highest score, this paper constructs a problem-based method to evaluate the development level of the distribution network, and introduces the amount of planned projects, the total investment and others as constraints to construct the objective function. Aimed to solve the objective function, this paper proposes the implementation steps of scheme optimization by determining the corresponding data requirements and the processing methods of specific data. For improving the computational efficiency, the algorithm is optimized by combining the branch and bound algorithm(BBA). It is proved that the proposed method can achieve the optimal scheme by the practical data of a certain city in Jiangsu Province in 2017.

关键词： unit planning planned projects evaluation of distribution network optimal scheme branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for the Cell Formation Problem 4th

A Branch and Bound Algorithm for the Cell Formation Problem

引用

4th International Conference on Network Analysis (NET)

作者： Utkina, Irina Batsyn, Mikhail Natl Res Univ Lab Algorithms & Technol Networks Anal Higher Sch Econ 136 Rodionova Str Nizhnii Novgorod Russia

ISBN: (纸本)9783319296081;9783319296067

The cell formation problem (CFP) is an NP-hard optimization problem considered for cell manufacturing systems. Because of its high computational complexity several heuristics have been developed for solving this problem. In this paper we present a branch and bound algorithm which provides exact solutions of the CFP. This algorithm finds optimal solutions for 13 problems of the 35 popular benchmark instances from the literature.

关键词： Cell formation problem branch and bound algorithm NP-hard problems Combinatorial optimization Upper bound Exact solution

来源：评论

学校读者我要写书评

暂无评论

branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems

引用

International Journal of Robust and Nonlinear Control 1991年第4期1卷 295-317页

作者： Balakrishnan, V. Boyd, S. Balemi, S. Information Systems Laboratory Department of Electrical Engineering Stanford University Stanford California 94305 United States Institut Für Automatik Eth-Zentrum Zurich 8092 Switzerland

We consider linear systems with unspecified parameters that lie between given upper and lower bounds. Except for a few special cases, the computation of many quantities of interest for such systems can be performed only through an exhaustive search in parameter space. We present a general branch and bound algorithm that implements this search in a systematic manner and apply it to computing the minimum stability degree. Copyright © 1991 John Wiley & Sons, Ltd.

关键词： branch and bound algorithm Minimum stability degree Parameter‐dependent linear systems

来源：评论

学校读者我要写书评

暂无评论

Solving the fuzzy assignment problems via utilizing branch and bound algorithm-practically treated

ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS

引用

ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS 2022年第48期48卷 481-490页

作者： Dawood, Shimaa Mohammed Elaibi, Waleed Mohammed Chachan, Hanan Ali Mustansiriyah Univ Coll Sci Dept Math Baghdad Iraq Mustansiriyah Univ Dept Stat Coll Adm & Econ Baghdad Iraq

In this paper described of assignment cost for the numbers that are fuzzy. Here, the assignment problem, which is fuzzy or invalid, is turned into crisp values throughout robust ranking technique, and by using branch and bound algorithm we gated the optimal solution and at a less *** applied example is taken from Source No. (9) to solving the assignment problem for the Cotton Industries Company in Iraq and find the optimal assignment and total cost.

关键词： fuzzy assignment problem branch and bound algorithm assignment problem robust ranking technique

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：