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

Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem

COMPUTERS & OPERATIONS RESEARCH 2020年 122卷 104964-104964页

作者： Liou, Jin-Pin I Shou Univ Coll Management 1 Syuecheng Rd Kaohsiung 84001 Taiwan

In this study, we investigate the lower bound and dominance conditions of the N-job and M-machine permutation flowshop scheduling problem to minimize the makespan based on machine idle times. We have developed and validated three dominance conditions and a lower bound based on a new approach that minimizes the machine idle times in a flowshop to facilitate the efficiency of the branch and bound approach. Most importantly, we have developed a dominance condition that is independent of the preceding and subsequent partial schedules, which has been considered critical but has not previously been developed in flowshop scheduling research. Finally, the efficiency of our developed branch and bound approach based on machine idle times is compared with the efficiencies of some previous branch and bound algorithms from the literature. We show that the dominance conditions that we developed can significantly improve the efficiency of the branch and bound approach. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Flowshop scheduling Permutation flowshop Machine idle time branch and bound algorithm Makespan dominance condition

来源：评论

学校读者我要写书评

暂无评论

Minimizing maximum tardiness subject to collect the EOL products in a single machine scheduling problem with capacitated batch delivery and pickup systems

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2021年 161卷

作者： Rostami, Mohammad Shahrood Univ Technol Dept Ind Engn & Management Shahroud Iran

This paper introduces capacitated batch delivery and pickup systems (here it is named closed-loop batch delivery systems) in an integrated production scheduling and distribution operation problem for the first time. A comprehensive and integrated model is developed for production scheduling, delivering products to the multiple customers using batch delivery system, and picking-up End of Life (EOL) products in order to recycle and reuse in the manufacturer plant. The aim of this model is to minimize the maximum tardiness subject to collect the EOL product in order to improve sustainability. First, a Mixed Integer Linear Programming (MILP) model is developed to solve small-size instances. Due to the fact that this problem is NP-hard, a branch and bound algorithm is developed by introducing effective lower bounds in order to obtain optimal solutions for the large-size instances. In order to show the application of the problem, a real case study in a motor oil supply chain is presented. The results illustrate that paying attention to the problem of collecting used motor oils through simultaneous pick-up and delivery can reduce their disposal in nature or reduce non-standard recycling of motor oil, which in turn improves sustainability. Finally, experimental results on the random generation problems show that the proposed branch and bound algorithm is especially useful to solve large-size instances.

关键词： Closed-loop batch delivery system Maximum tardiness Sustainability Mixed integer linear programming branch and bound algorithm Case study

来源：评论

学校读者我要写书评

暂无评论

Modeling Geographical Anycasting Routing in Vehicular Networks

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2020年第4期14卷 1624-1647页

作者： Amirshahi, Alireza Romoozi, Morteza Raayatpanah, Mohammad Ali Asghari, Seyyed Amir Islamic Azad Univ Dept Comp Engn Qom Branch Qom Iran Islamic Azad Univ Dept Comp Engn Kashan Branch Kashan Iran Kharazmi Univ Fac Math Sci & Comp Tehran Iran Kharazmi Univ Tehran Comp & Elect Engn Dept Tehran Iran

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications;they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by branch and bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

关键词： Anycast routing Vehicular networks Time-expanded networks branch and bound algorithm Mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems

引用

COMPUTERS & OPERATIONS RESEARCH 2022年 144卷 1页

作者： Li, Debiao Ruan, Xiaoming Yue, Qing Fuzhou Univ Sch Econ & Management Fuzhou Peoples R China Shanghai Univ Int Business & Econ Management Sch Shanghai Peoples R China

Along with the rising prevalence of chronic diseases and the increasing complexity of pharmaceutical care, pharmacy automation dispensing systems (PADS)s are utilized to improve the quality of patient care, reduce dispensing-related medication errors, and cut down medication-related expenses. After PADSs fulfill prescription orders, patients still have to dispense medications for each meal by themselves. It is well known that dispensing medications is time-consuming and exhausting, especially for chronic patients. During the manual dispensing process, some unexpected medical errors might appear, which would result in discomfort, harm, and even death. To provide efficient and patient-centered pharmacy care, we proposed automatically dispensing prescriptions by meal orders in PADS. Specifically, we formulated a novel three-stage assembly flowshop problem to fulfill prescription orders at the level of meal orders to minimize the total completion times of packing prescription orders. In our studied PADS, there are fully flexible parallel machines dispensing medication jobs and collating sub-orders (meal prescription orders) in the first and second stages, and one assembly machine packing prescription orders in the third stage. Based on the properties of the optimal schedule, we proposed a branch-and-bound (B&B) algorithm embedded with a constructive heuristic (CH) to obtain a fight upper bound. Since the three-stage assembly flowshop problem in PADS is strongly NP-hard, we also presented an improved tabu search (iTS) heuristic for the practical data size. Finally, we conducted a series of numerical experiments based on artificial data sets guided by characteristics obtained from practical pharmacy data sets. The computational results showed that the proposed CH algorithm is efficient, and when the computational time was allowed, the iTS algorithm could further enhance the performance. Moreover, the efficiency of collating sub-orders has a significant impact on the overa

关键词： Pharmacy automation dispensing systems The three-stage assembly flowshop problem branch and bound algorithm Improved tabu search heuristic

来源：评论

学校读者我要写书评

暂无评论

MINIMAL COST INDEX TRACKING UNDER NONLINEAR TRANSACTION COSTS AND MINIMAL TRANSACTION UNIT CONSTRAINTS

引用

International Journal of Theoretical and Applied Finance 2001年第6期4卷 939-957页

作者： HIROSHI KONNO ANNISTA WIJAYANAYAKE Center for Research in Advanced Financial Technology Tokyo Institute of Technology Japan Department of Industrial Engineering and Management Tokyo Institute of Technology Japan

Index tracking is a very common and popular approach in portfolio management. When there is neither (nonconvex) transaction costs nor minimal transaction unit constraints, the problem can be formulated as a convex least square problem, so that it can be solved by standard methods. However, when the transaction cost is nonconvex and not negligible, or if there is a minimal unit constraint on the amount of transaction, the problem becomes a nonconvex minimization problem with discrete variables. In this paper, we will propose a branch and bound algorithm for solving this class of problems and show that it can solve an index tracking problem of practical size in a reasonable amount of computation time.

关键词： Portfolio optimization index tracking concave transaction cost minimal transaction unit branch and bound algorithm mean-absolute deviation model

来源：评论

学校读者我要写书评

暂无评论

A New Procedure for the Cyclic Job Shop Problem

引用

IFAC Proceedings Volumes 2012年第6期45卷 69-74页

作者： Martin Fink Touria Ben Rahhou Laurent Houssin TUM-School of Management Technische Universität München 80333 Munich Germany CNRS LAAS 7 avenue du colonel Roche F-31077 Toulouse France Université de Toulouse UPS INSA INP ISAE F-31077 Toulouse France

The topic of this paper is the cyclic job shop problem which aims at minimizing the cycle time under precedence and resource constraints. Based on graph theory, we propose a new branch and bound enumeration procedure ... 详细信息

关键词： Cyclic scheduling Discrete optimization branch and bound algorithm Job shop problem

来源：评论

学校读者我要写书评

暂无评论

A Synchronized Model for Crash Prediction and Resource Allocation to Prioritize Highway Safety Improvement Projects

引用

Procedia - Social and Behavioral Sciences 2013年 104卷 992-1001页

作者： Sabyasachee Mishra Assistant Professor 3815 Central Avenue Department of Civil Engineering University of Memphis Memphis TN 38152 USA

Urban intersections are key locations of traffic crashes that contribute significantly to the economic losses. Safety management process undertaken by most states in the United States (U.S), is often referred to as the hazard elimination program which consists of three steps: (1) selections of hazardous locations, (candidate locations) where safety improvements are warranted, (2) development of countermeasures for potential reduction of crashes, (3) allocation of resources among the independent candidate locations in conformance to budgetary and other constraints. Often these three steps are independently considered with very limited detail on each step in the state planning agencies. This paper presents a simultaneous model which predicts the occurrence of crashes and allocates resources by maximizing benefits subjected to budget and other constraints. The analysis is carried out for a planning period of five years. The crash prediction is analysed as a negative binomial model. The resource allocation model is solved using branch and bound algorithm. Prediction and allocation is conducted simultaneously to achieve realistic results rather than analysing both steps independently. The allocation model further prioritizes the projects to be implemented to optimally distribute funds to maximize benefits. Model results reveal that the proposed approach can be used as a tool for resource allocation on highway safety projects for urban intersections.

关键词： Negative Binomial model branch and bound algorithm Resource allocation

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Single-Stage Multi-Item Inventory Control Model

引用

IFAC Proceedings Volumes 2001年第8期34卷 73-78页

作者： Mohamed-Aly Ould-Louly Alexandre Dolgui Industrial Systems Optimization Lab. University of Technology of Troyes 12 rue Marie Curie BP2060 - 10010 Troves cedex France Ph: + 33 (0)3 25 71 56 29 Fax: +33 (0)3 25 71 56 49

We study assembly systems with one type of finished products and several types of components. The lead times of components are random variables, and the customer demand of finished product is constant. We proposed a Markov chain that enables the determination of system performance measures, and we show how to exploit this model for optimization. Our aim is to minimize the average holding cost for the components while keeping a given service level for customer demands. In this paper we propose lower bounds and dominance properties of goal function. These results can be used in a branch and bound algorithm.

关键词： Supply planning Inventory control Markov chains Optimization branch and bound algorithm Lower bound Dominance properties

来源：评论

学校读者我要写书评

暂无评论

A BMI-Based Design of Switched PID Controllers

引用

IFAC Proceedings Volumes 2004年第1期37卷 881-886页

作者： Jun Aoyama Katsumi Konishi Toru Yamamoto Takao Hinamoto Department of Artificial Complex Systems Control Graduate School of Engineering Hiroshima University 1-4-1 Kagamiyama Higashi-hiroshima Hiroshima 739-8527 Japan Information Media Center Hiroshima University. 1-4-2 Kagamiyama Higashi-hiroshima Hiroshima 739-8511 Japan Department of Technology and Information Education Graduate School of Education Hiroshima University 1-1-1 Kagumiyama Higashi-hiroshima Hiroshima 739-8524 Japan

This paper provides a design method for two-degrees-of-freedom PID controllers including switched PD compensator based on bilinear matrix inequalities (BMIs). Two design specifications based on H 2 norm are formulated in BMIs, and PID parameters can be exactly obtained by solving the BMI problems via branch and bound algorithms. A set of PD compensators can be obtained simultaneously by using proposed design method. The most effective parameter is selected out of the set of PD compensator based on the switching criterion which obtained from estimated system conditions using recursive least square algorithms. Numerical example is also shown.

关键词： PID controllers bilinear matrix inequalities H 2 norm process control branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Two-machine decentralized flow shop scheduling problem with inter-factory batch delivery system

引用

OPERATIONAL RESEARCH 2024年第3期24卷 39-39页

作者： Rostami, Mohammad Mohammadi, Milad Shahrood Univ Technol Dept Ind Engn & Management Shahroud Iran

Technological advancement, the emergence of more complex production systems, and the need for greater manufacturer competition have caused production systems to shift from a centralized environment to a decentralized one. Researchers have paid more attention to distributed flow shop scheduling problems and investigated various features and issues related to them in recent years. However, special types of these problems, in which the network structure is serial and inter-factory transportation is significant, have received less attention. This study investigated the two-machine decentralized flow shop scheduling problem, in which inter-factory transportation is handled by a batch delivery system. The goal was to simultaneously reduce the costs of makespan and batch delivery. A mixed-integer linear programming model capable of solving small-size instances in a logical running time was presented to better describe the problem. Then, in order to solve large-size instances in a logical running time, a fast branch and bound algorithm with a heuristic method were developed to obtain the appropriate upper bound as well as the tight lower bounds at each node. The computational results indicated that the B&B algorithm performed very well in terms of problem-solving running time. The findings also demonstrated that the heuristic method can solve the most complex instances by 100 jobs with less than 13% error.

关键词： Flow shop scheduling Decentralized Inter-factory batch delivery system branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：