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

Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2017年 114卷 22-30页

作者： Lee, Ju-Yong Kim, Yeong-Dae Samsung Elect Co Ltd Syst Technol Team Semicond Business Yongin 17113 Gyeonggi Do South Korea Korea Adv Inst Sci & Technol Dept Ind Engn Daejeon 34141 South Korea

This paper deals with a two-machine flowshop problem in which the machine at the first stage requires preventive maintenance activities that have to be started within a given cumulative working time limit after the previous maintenance. That is, a maintenance activity can be started at any time unless the cumulative working time after the end of the previous maintenance exceeds the given limit. For the problem with the objective of minimizing total tardiness, we develop dominance properties and lower bounds for this scheduling problem as well as a heuristic algorithm, and suggest a branch and bound algorithm in which these properties, lower bounds, and heuristic algorithm are used. Computational experiments are performed to evaluate the algorithm and the results are reported.

关键词： Scheduling Flowshop Machine availability constraint branch and bound algorithm Total tardiness

来源：评论

学校读者我要写书评

暂无评论

The multi-resource agent bottleneck generalised assignment problem

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年第2期50卷 309-324页

作者： Karsu, Ozlem Azizoglu, Meral Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey

In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal solutions to the problems with up to 60 jobs when the number of agents is 5, and up to 30 jobs when the number of agents is 10, in less than 20 minutes. To find approximate solutions, we define a tabu search algorithm and alpha approximation algorithm. Our computational results have revealed that both algorithms can find high quality solutions to large sized instances very quickly. To the best of our knowledge our study is the first reported attempt to solve the problem. We hope our study fills an important gap in the literature.

关键词： bottleneck generalised assignment problem multi periods branch and bound algorithm linear programming relaxation

来源：评论

学校读者我要写书评

暂无评论

Learning and Optimization of Patient-Physician Matching Index in Specialty Care

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2024年第3期21卷 2730-2741页

作者： Li, Debiao Chen, Xiaoqiang Chen, Siping Fuzhou Univ Dept Management Sci & Engn Fuzhou 350116 Peoples R China Fujian Med Univ Dept Otolaryngol Union Hosp Fuzhou 350000 Fujian Peoples R China Univ Newcastle Sch Informat & Phys Sci Newcastle NSW 2308 Australia

It is challenging for a patient without medical knowledge to select a `capable' physician based on nontransparent medical information. The situation becomes pervasive in specialty care. Motivated by this existing patient-physician matching problem, we propose a novel physician matching index (PMI) obtained by an analytical framework integrated with an improved multi-disease pre-diagnosing Bayesian network (BN) model. The pre-diagnosis BN structure learning is critical since it provides the causal map among diseases and symptoms, but it has been proved to be NP-hard. To improve the computational tractability of the BN structure learning, we propose a dynamic programming based cache calculation algorithm integrated with expert knowledge. The optimal BN structure is obtained through an improved branch-and-bound algorithm. Given patients' symptoms and physicians' specialty information, we apply the trained pre-diagnosis BN model to obtain PMI, which can be extended to the weighted matching index by considering patient preferences. A case study of the patient-physician matching problem in the ear, nose, and throat (ENT) department is conducted. The branchand-bound algorithm with the proposed cache calculation algorithm learns the optimal BN structure with high pre-diagnosing accuracy and time efficiency. We disclose that the proposed PMI can rectify the misdiagnosis since the highly related diseases usually belong to one specialty. Moreover, we demonstrate the significance of the consistency between the physicians' specialty and the patients' disease distribution. We also highlight that the proposed PMI guides the patients in choosing physicians more appropriately under independent patient preferences.

关键词： Patient-physician matching Bayesian network branch and bound algorithm expert knowledge

来源：评论

学校读者我要写书评

暂无评论

Optimization of Time-Open Constrained Lambert Rendezvous Using Interval Analysis

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2013年第1期36卷 175-184页

作者： Chen, Tong van Kampen, E. Yu, H. Chu, Q. P. Beihang Univ Sch Astronaut Dept Guidance Nav & Control Beijing 100191 Peoples R China Delft Univ Technol Fac Aerosp Engn Sect Control & Simulat NL-2600 GB Delft Netherlands

By defining a parking time and a transfer time, a time-open constrained Lambert rendezvous problem is proposed in this paper. The purpose of optimization is to minimize the velocity increment for the orbital rendezvous. The interval branch and bound optimization algorithm is introduced for solving a rendezvous optimization problem with strong nonlinearity and nonconvexity. A numerical example is undertaken to validate the interval optimization algorithm. The results indicate that although the global optimal solution for the time-open constrained Lambert rendezvous problem can't be found by using only the interval algorithm in the restricted hardware environment because of the inevitable influence of interval dependency and the complex calculation for the cost function, the interval algorithm can narrow the search space and split the feasible space into many small subspaces. Combining the gradient-based optimization method, an improved interval algorithm is used to find the minimal velocity increment for orbital rendezvous, which is better than the optimal solution using the genetic algorithm.

关键词： Orbital Rendezvous Optimization algorithm Genetic algorithm Orbital Maneuvers Lambert's Problem Orbital Elements branch and bound algorithm Apogee Altitude Numerical Analysis Right Ascension

来源：评论

学校读者我要写书评

暂无评论

Towards Accurate Statistical Analysis of Security Margins: New Searching Strategies for Differential Attacks

引用

IEEE TRANSACTIONS ON COMPUTERS 2017年第10期66卷 1763-1777页

作者： Chen, Jiageng Teh, Jesen Liu, Zhe Su, Chunhua Samsudin, Azman Xiang, Yang Cent China Normal Univ Sch Comp Sci Wuhan 430072 Hubei Peoples R China Univ Sains Malaysia Sch Comp Sci Gelugor 11800 Penang Malaysia Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust SnT Esch Sur Alzette Luxembourg Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Nanjing 210016 Jiangsu Peoples R China Univ Aizu Aizu Wakamatsu Fukushima 9658580 Japan Swinburne Univ Technol Swinburne Res Hawthorn Vic 3122 Australia

In today's world of the internet, billions of computer systems are connected to one another in a global network. The internet provides an unsecured channel in which hundreds of terabytes of data is being transmitted daily. Computer and software systems rely on encryption algorithms such as block ciphers to ensure that sensitive data remains confidential and secure. However, adversaries can leverage the statistical behavior of underlying ciphers to recover encryption keys. Accurate evaluation of the security margins of these encryption algorithms remains to be a big challenge. In this paper, we tackle this issue by introducing several searching strategies based on differential cryptanalysis. By clustering differential paths, the searching algorithm derives more accurate distinguishers as compared to examining individual paths, which in turn provides a more accurate estimation of cipher security margins. We verify the effectiveness of this technique on ciphers with the generalized Feistel and SPN structures, whereby the best distinguishers for each of the investigated ciphers were obtained by discovering clusters with thousands of paths. With the KATAN block cipher family as a test case, we also show how to apply the searching algorithm alongside other cryptanalysis techniques such as the boomerang attack and related-key model to obtain the best cryptanalytic results. This also depicts the flexibility of the proposed searching scheme, which can be tailored to improve upon other differential attack variants. In short, the proposed searching strategy realizes an automated security evaluation tool with higher accuracy compared to previous techniques. In addition, it is applicable to a wide range of encryption schemes which makes it a flexible tool for both academic research and industrial purposes.

关键词： Accurate security margin differential path searching branch and bound algorithm active s-box LBlock TWINE PRESENT KATAN

来源：评论

学校读者我要写书评

暂无评论

First order rejection tests for multiple-objective optimization

引用

JOURNAL OF GLOBAL OPTIMIZATION 2014年第4期58卷 653-672页

作者： Goldsztejn, Alexandre Domes, Ferenc Chevalier, Brice CNRS LINA UMR 6241 Nantes France Univ Nantes LINA UMR 6241 Nantes France Univ Nantes Nantes France

Three rejection tests for multi-objective optimization problems based on first order optimality conditions are proposed. These tests can certify that a box does not contain any local minimizer, and thus it can be excluded from the search process. They generalize previously proposed rejection tests in several regards: Their scope include inequality and equality constrained smooth or nonsmooth multiple objective problems. Reported experiments show that they allow quite efficiently removing the cluster effect in mono-objective and multi-objective problems, which is one of the key issues in continuous global deterministic optimization.

关键词： Multi-objective deterministic global optimization First order optimality conditions Interval analysis branch and bound algorithm Cluster effect

来源：评论

学校读者我要写书评

暂无评论

ARTIFICIAL-INTELLIGENCE DESIGN CHALLENGE - BACKGROUND, ANALYSIS, AND RELATIVE PERFORMANCE OF algorithmS

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1988年第5期11卷 386-393页

作者： DEUTSCH, OL Charles Stark Draper Laboratory Inc. Cambridge Massachusetts

The Artificial Intelligence Design Challenge was an attempt to stimulate interest in a common problem involving the application of artificial intelligence technology to problems likely to be encountered in planning, scheduling, and battle management. These problems are characterized by high combinatorial complexity, uncertainty, constraints, and, in some cases, requirements for real-time performance on finite-speed processors. Participants in the design challenge submitted competing, alternative approaches, implemented in computer code executable on desktop microcomputers, for assessment and relative evaluation over a range of problems. The range of problems was generated by variation of an input data file at the time of contest judging. The participants were given a priori knowledge of only the range of data variations, and not the specific details. In this manner, robustness to problem variations was evaluated, as was normalized performance of competing algorithms and implementations.

关键词： Artificial Intelligence Annealing Microprocessors Linear Programming Floppy Disks NASA Goddard Space Flight Center branch and bound algorithm Aeroplane Guidance, Navigation, and Control Systems Wright Patterson Air Force Base

来源：评论

学校读者我要写书评

暂无评论

Preserving an aging transit fleet: An optimal resource allocation perspective based on service life and constrained budget

引用

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE 2013年第Jan.期47卷 111-123页

作者： Mishra, Sabyasachee Sharma, Sushant Khasnabis, Snehamay Mathew, Tom V. Univ Memphis Dept Civil Engn Memphis TN 38152 USA Purdue Univ Reg Univ Transportat Ctr NEXTRANS Ctr W Lafayette IN 47096 USA Wayne State Univ Dept Civil & Environm Engn Detroit MI 48202 USA Indian Inst Technol Dept Civil Engn Bombay 400076 Maharashtra India

Local, county and state level transit agencies with large fleets of buses and limited budgets seek a robust fund allocation mechanism to maintain service standards. However, equitable and optimal fund allocation for purchasing, operating and maintaining a transit fleet is a complex process. In this study, we develop an optimization model for allocation of funds among different fleet improvement programs within budget constraints over the planning period. This is achieved by minimizing the net present cost (NPC) of the investment within the constraint of a minimum level of fleet quality expressed as a surrogate of the remaining life of the fleet. Integer programming is used to solve the formulated optimization problem using branch and bound algorithm. The model formulation and application are demonstrated with a real world case study of transit agencies. It is observed that minimizing NPC provides a realistic way to allocate resources between different program options among different transit agencies while maintaining a desired quality level. The proposed model is generalized and can be used as a resource allocation tool for transit fleet management by any transit agency. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Transit fleet Net present cost Integer programming branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2010年第5期48卷 1225-1243页

作者： Che, Ada Yan, Pengyu Yang, Naiding Chu, Chengbin NW Polytech Univ Sch Management Xian 710072 Peoples R China Ecole Cent Paris Lab Genie Ind Chatenay Malabry France

This paper proposes an exact algorithm to solve a cyclic hoist scheduling problem in a printed circuit board (PCB) electroplating facility, where multi-type parts with fixed processing times are processed in the same time and the parts are not allowed to wait in the tanks or on the hoist. Finding an optimal schedule in such a production line is equivalent to finding two types of related sequences: part input sequence and hoist move sequence. We show that the entering times of the parts are the decision variables of the problem. We formulate our problem using the notion of prohibited intervals and solve it by enumerating the non-prohibited intervals of the decision variables. This enumeration is accomplished more efficiently with a dynamic branch and bound procedure, which utilises relaxed solutions to eliminate redundant non-prohibited intervals in the search process. The proposed algorithm is polynomial in the number of tanks if the number of part types is fixed, but exponential if it is arbitrary. Computational results on randomly generated test instances indicate that the algorithm is effective.

关键词： cyclic hoist scheduling multi-type parts fixed processing times no-wait branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A genetic algorithm for job shop scheduling - A case study

引用

COMPUTERS IN INDUSTRY 1996年第2期31卷 155-160页

作者： Kumar, NSH Srinivasan, G INDIAN INST TECHNOL DEPT HUMANITIES & SOCIAL SCIIND ENGN & MANAGEMENT DIVMADRAS 600036TAMIL NADUINDIA

The problem of scheduling n jobs on m machines with each job having a specific route has been one of considerable research over the last several decades. branch and bound algorithms for determining the optimal makespan have been developed and tested on small sized problems and dispatching rule based heuristic algorithms to minimize specific performance measures such as makespan, flowtime, tardiness, etc, are available to solve large sized problems. This paper addresses the same problem faced by an organization and reports the solution of this problem using genetic algorithms (GA) and a combination of dispatching rules. The proposed algorithm yields an improvement of about 30% in makespan over the present system.

关键词： branch and bound algorithm genetic algorithm dispatching rules job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：