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

Joint Planning of Production and Inspection of Parallel Machines with Two-phase of Failure

RELIABILITY ENGINEERING & SYSTEM SAFETY 2022年第0期217卷 108097-108097页

作者： Azimpoor, Samareh Taghipour, Sharareh Farmanesh, Babak Sharifi, Mani Ryerson Univ Dept Mech & Ind Engn Reliabil Risk & Maintenance Res Lab RRMR Lab Toronto ON Canada Oklahoma State Univ Dept Ind Engn & Management Stillwater OK USA

Utilizing available information on random machine breakdowns is highly effective in making joint production and inspection decisions. The current paper studies the joint planning of production schedule and inspection of identical parallel machines to process n jobs with different processing times. Each machine's failure is modeled using the two-stage delay time concept. The first stage is a defect arrival which does not cause a machine stoppage, but if it is not removed, may cause the machine failure. A machine's lifetime is divided into two stages in such a failure process: defect arrival and failure arrival stages. The defects and failures of the identical parallel machines follow non-linear and time-dependent distributions. Inspection activities are intended to identify potential defects in the machines and subsequently removing them prior to eventual failures. The objective is to establish the best jobs' schedule of the machines and the best sequence of inspection decisions that minimize the expected makespan. For this problem, unequal defect and failure arrival rates for the machines impose some complications to the expected makespan calculation. Therefore, obtaining an integrated scheduling and inspection plan requires considering all possible combinations of the jobs order and inspections on the machines that further increase the complexity of the algorithm implementation. We propose a branch and bound (B&B) algorithm that restricts the search time and space and demonstrates the effectiveness of integrating inspection and maintenance operations with the jobs sequence to minimize the expected makespan. We propose an upper bound and develop a lower bound to assign the maximum number of jobs on the empty capacity of the machines. We analyze the impact of the model's parameters on the results of the B&B algorithm and validate the algorithm's performance by comparing the results with the analytical solutions for small-sized problems for which analytical solution e

关键词： parallel machines scheduling delay time modelling inspection maintenance branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Service interruption and customer withdrawal in the congested facility location problem

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2022年第0期165卷

作者： Zamani, Shokufeh Arkat, Jamal Niaki, Seyed Taghi Akhavan Univ Kurdistan Dept Ind Engn Sanandaj Iran Sharif Univ Technol Dept Ind Engn Tehran Iran

This research addresses the location problem of congested facilities, assuming service in-terruptions and customer withdrawals. Service interruptions can occur as a result of events such as machine failures, power outages, and communication system disconnections. As long as no interruption occurs, each facility functions as a M/M/1 queuing system. Upon an interruption, the server stops working, and customers receiving service or waiting in line leave the queue before being served. Moreover, customers who visit the facility during the repair avoid entering the facility. The problem is first formulated as a mixed-integer nonlinear programming (MINLP) model, for which two piecewise mixed-integer linear programming (MILP) relaxations, an exact solution algorithm (the branch and bound algorithm), and a metaheuristic algorithm (the antlion algorithm), are then presented for solution. Numerical experiments indicate the efficiency of the branch and bound algorithm. The antlion algorithm also exhibits the proper convergence speed to obtain near-optimal solutions.

关键词： Queueing Facility Location Service Interruption Customer Withdrawal branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Oracle-based algorithms for binary two-stage robust optimization

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2020年第2期77卷 539-569页

作者： Kaemmerling, Nicolas Kurtz, Jannis TU Dortmund Univ Inst Transport Logist Leonhard Euler Str 2 D-44227 Dortmund Germany Rhein Westfal TH Aachen Chair Math Informat Proc Pontdriesch 12-14 D-52062 Aachen Germany

In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-stage robust problem by solving alternately the underlying deterministic problem and an adversarial problem. For the deterministic problem any oracle can be used which returns an optimal solution for every possible scenario. We show that the latter lower bound can be implemented in a branch and bound procedure, where the branching is performed only over the first-stage decision variables. All results even hold for non-linear objective functions which are concave in the uncertain parameters. As an alternative solution method we apply a column-and-constraint generation algorithm to the binary two-stage robust problem with objective uncertainty. We test both algorithms on benchmark instances of the uncapacitated single-allocation hub-location problem and of the capital budgeting problem. Our results show that the branch and bound procedure outperforms the column-and-constraint generation algorithm.

关键词： Two-stage robust optimization Non-linear binary optimization branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Minimizing total weighted completion and batch delivery times with machine deterioration and learning effect: a case study from wax production

引用

OPERATIONAL RESEARCH 2020年第3期20卷 1255-1287页

作者： Rostami, Mohammad Nikravesh, Shiva Shahin, Mahdi Univ Sci & Technol IUST Dept Ind Engn Tehran Iran Islamic Azad Univ Dept Ind Engn Sci & Res Branch Kerman Iran

This paper investigates an integrated scheduling of production and distribution activities in the supply chain where both machine deterioration and learning effects have been consequently addressed. Manufacturer aims to minimize the total weighted completion time, while a distributor focuses on reducing shipping times with batch delivery by using capacitated vehicles. The aim of this problem is to minimize the sum of weighted completion times plus total delivery times. First, a mixed integer linear programming model is proposed. Then for a special case, a branch and bound algorithm is developed with utilizing the structural features of the problem. In order to solve large-scale instances of the general problem in a short/reasonable time, a simulated annealing algorithm is provided. Computational results show that the proposed heuristic techniques have high efficiency to achieve the optimal solution, and that they are useful to solve large sizes of the problems at a short time. Finally, by providing a real-life case of wax manufacturing and its distribution system, it is shown that the application of integrated decisions can significantly reduce costs imposed on the firms.

关键词： Single machine scheduling Machine deterioration Learning effect Capacitated vehicle Batch delivery system branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Load Control Problems in Direct Current Distribution Networks: Optimality, Equilibrium of Games

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2020年第2期28卷 347-360页

作者： Zou, Suli Ma, Zhongjing Liu, Shan BIT Sch Automat Beijing 100081 Peoples R China BIT Natl Key Lab Complex Syst Intelligent Control & D Beijing 100081 Peoples R China

Due to the promising development of direct current (dc) distribution networks, we focus on the demand-side management (DSM) problems which aim at the minimization of operational costs in dc distribution networks. Based on the established voltage model of power electronic loads, we formulate a DSM optimization problem that coordinates the bus voltage by minimizing the system cost, and the underlying optimization problem is nonconvex. In order to solve this nonconvex problem, we first reformulate it as a difference of convex programming problem, and then propose a novel algorithm based on branch and bound to implement the optimal solution. It is shown that the system is guaranteed to converge to the global optimum under the proposed method. As demonstrated with numerical examples, we analyze the convergence and global optimality of the proposed method, and discuss the computational complexity and scalability with respect to the size of distribution networks. Moreover, in case each of individual loads can make its own decisions by itself, the underlying optimization problem is implemented in the context of the noncooperative game. The existence of the Nash equilibrium is verified and demonstrated through simulation results.

关键词： Optimization Games Load modeling Power electronics Resistance Programming Convergence branch and bound algorithm dc distribution networks demand-side management (DSM) global optimality Nash equilibrium (NE) nonconvex optimization power electronic loads (PELs)

来源：评论

学校读者我要写书评

暂无评论

Collaborative caching strategy based on optimization of latency and energy consumption in MEC

引用

KNOWLEDGE-BASED SYSTEMS 2021年 233卷

作者： Li, Chunlin Zhang, Yong Sun, Qinqin Luo, Youlong Wuhan Univ Technol Dept Comp Sci Wuhan 430063 Peoples R China Fujian Prov Key Lab Coast & Isl Management Techno Xiamen Peoples R China

Mobile edge computing effectively reduces the network delay of requests during data transmission, reduces the transmission burden of data traffic in the network, and improves the quality of mobile services. However, the introduction of mobile edge computing architecture increases the cost of the actual network infrastructure deployment, which increases the complexity of resource management. An edge network architecture based on software-defined network technology is proposed, in which the SDN controller with the entire network state can manage data transmission more intelligently to maximize the utilization of edge servers. In addition, to solve the problems of high request delay and high operating cost in current caching strategies based on video services, a video caching strategy for mobile edge computing is proposed. First, we analyze the user's request data and use the neural network model to predict the content of the user's subsequent time slice request and pre-cache the user's request. Then, improve the quality of user experience and choose the most appropriate edge node cache deployment plan. Finally, a video caching strategy for mobile edge computing with coordinated optimization of delay and energy consumption is proposed. The branch and bound algorithm is used to solve the optimization problem. Finally, we compared our algorithm with the LFU algorithm, PBC algorithm, COC algorithm, and R-LCCA algorithm. Experimental results show that the algorithm has a high cache hit rate, thereby reducing the cost of video providers and improving the quality of user experience. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Mobile Edge Computing Popularity Prediction Cooperative caching strategy branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A Two-step Approach in Expert Evaluation of Correctional Information Technologies for Students with Autism Spectrum Disorders 3

A Two-step Approach in Expert Evaluation of Correctional Inf...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Single Machine Scheduling with Precedence Constrains, Release and Delivery Times 40th

Single Machine Scheduling with Precedence Constrains, Releas...

引用

40th Anniversary International Conference on Information Systems Architecture and Technology (ISAT)

作者： Grigoreva, Natalia St Petersburg State Univ Univ Nab 7-9 St Petersburg 199034 Russia

ISBN: (纸本)9783030304430;9783030304423

The goal of this paper is to propose algorithms for scheduling problem, where set of jobs performed on a single processor. Each job has a release time, when it becomes available for processing, a processing time and a delivery time. We study the case in which there exist precedence constrains among jobs and preemption is not allowed. The objective is to minimize the time, by which all jobs are delivered. The single machine scheduling problem is one of the classic NP-hard optimization problems, and it is useful in solving flowshop and jobshop scheduling problems. We develop branch and bound algorithm for the problem. We propose an approximation algorithm to find an upper bound, solve the preemptive version of the problem to provide a lower bound and use a binary branching rule, where at each branch node, a complete schedule is generated. To illustrate the effectiveness of our algorithms we tested them on randomly generated set of jobs.

关键词： Single processor branch and bound algorithm Release and delivery time Precedence constrains

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：