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

Deadline-constrained security-aware workflow scheduling in hybrid cloud architecture

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2025年 162卷

作者： Abdi, Somayeh Ashjaei, Mohammad Mubeen, Saad Malardalen Univ Dept Networked & Embedded Syst Vasteras Sweden Islamic Azad Univ Dept Comp Engn Eslam Abad E Gharb Branch Eslam Abad E Gharb Iran

A hybrid cloud is an efficient solution to deal with the problem of insufficient resources of a private cloud when computing demands increase beyond its resource capacities. Cost-efficient workflow scheduling, considering security requirements and data dependency among tasks, is a prominent issue in the hybrid cloud. To address this problem, we propose a mathematical model that minimizes the monetary cost of executing a workflow and satisfies the security requirements of tasks under a deadline. The proposed model fulfills data dependency among tasks, and data transmission time is formulated with exact mathematical expressions. The derived model is a mixed-integer linear programming problem. We evaluate the proposed model with real-world workflows over changes in the input variables of the model, such as the deadline and security requirements. This paper also presents a post-optimality analysis that investigates the stability of the assignment problem. The experimental results show that the proposed model minimizes the cost by decreasing inter-cloud communications for dependent tasks. However, the optimal solutions are affected by the limitations that are imposed by the problem constraints.

关键词： Hybrid cloud Workflow scheduling mixed integer linear programming Cost minimization Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

A Resilience Enhancement Planning Framework Capturing Customers' Participation in Distribution Systems

引用

IEEE TRANSACTIONS ON SMART GRID 2025年第2期16卷 957-972页

作者： Eshkaftaki, Amin Alavi Latify, Mohammad Amin Fotuhi-Firuzabad, Mahmoud Dehghanian, Payman Isfahan Univ Technol Dept Elect & Comp Engn Esfahan *** Iran Sharif Univ Technol Dept Elect Engn Tehran 111554363 Iran George Washington Univ Dept Elect & Comp Engn Washington DC 20052 USA

This paper presents a novel planning framework to enhance the resilience of energy supply to customers in power distribution systems. The framework involves three key stakeholders: the regulator as the governing entity that enforces regulatory mechanisms to oversee the performance of the distribution system operator (DSO);the DSO that reinforces the infrastructure by placing emergency distributed generations and hardening sections, implements necessary operational decisions, and facilitates customers' participation by introducing appropriate incentives;and customers who may (i) gain the desired resilience through investing in self-generation, (ii) rely on the resilience provided by the DSO along with paying the agreed-upon insurance premiums, or (iii) opt for a mix of both approaches. The proposed framework is designed through a four-step process. First, the regulatory mechanisms are established by setting a standard resilience index for the penalty and reward model as well as a revenue cap for the DSO under a revenue-cap regulation using customized optimization problems aimed at optimizing DSO's costs without customers' participation. Next, an integrated resilience enhancement optimization problem that coordinates the strategies of the DSO and customers is formulated as a mixed-integer linear programming model, focusing on the global objective functions of the DSO and customers. Finally, the economic benefits are distributed between the DSO and customers who are justified for investment in self-generation using a suggested method based on Monte-Carlo estimation, in which the Fisher-Yates shuffle technique and a designated optimization problem are employed. Applied to the IEEE 33-bus test system for two case studies, the proposed framework is proven to be effective in enhancing resilience, achieving regulatory objectives, and providing economic benefits for both the DSO and customers, creating a mutually beneficial scenario for all parties involved.

关键词： Resilience Reactive power Planning Costs Investment Indexes linear programming Fault tolerance Substations mixed integer linear programming Customers disruptive events distribution system operator (DSO) mixed-integer linear programming (MILP) regulator resilience

来源：评论

学校读者我要写书评

暂无评论

Branch and bound for the fixed-shape unequal area facility layout problem

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2025年 203卷

作者： Ekstedt, Fredrik Salman, Raad Damaschke, Peter Fraunhofer Chalmers Res Ctr Ind Math Chalmers Sci Pk SE-41288 Gothenburg Sweden Chalmers Univ Technol Dept Comp Sci & Engn SE-41296 Gothenburg Sweden Univ Gothenburg SE-41296 Gothenburg Sweden

Models of the Facility Layout Problem (FLP) can be useful for guiding the placement of resources in a factory building or similar. In real-world situations, the placement of the resources is often subject to a set of complex geometrical constraints, consisting of safety distances and work areas that cannot be encroached. This can result in disjoint regions or irregular shapes that must be placed so that a set of overlapping rules are fulfilled. In this paper, we formulate this problem as placing a fixed set of arbitrary polygon unions in a plane such that the overlapping constraints are not violated and the sum of weighted distances between them is minimized. A grid-based approximation and a branch and bound algorithm to solve this variation of the problem are developed. We compare the performance with a linearized QAP formulation solved with state-of-the art MILP solvers. The algorithm shows favorable results, solving problem instances with up to 8 resources to optimality within 48 h.

关键词： Unequal area facility layout planning Branch and bound Combinatorial optimization mixed integer linear programming Quadratic assignment problem

来源：评论

学校读者我要写书评

暂无评论

Integrated Planning Model for Optimizing Investments in Hydrogen Infrastructure Deployment: A Case Study of Yangtze River Delta Region, China

引用

ENERGY SCIENCE & ENGINEERING 2025年第3期13卷 1306-1322页

作者： Shen, Weijie Li, Hua Ding, Hongjian Zeng, Ming Xie, Chuansheng Zhang, Xiaochun North China Elect Power Univ Sch Econ & Management Beijing Peoples R China PowerChina Huadong Engn Corp Ltd Hangzhou Peoples R China

The hydrogen industry is of great significance for global energy system transition and decarbonization;thus, the holistic planning of hydrogen infrastructure from a supply chain level is necessary. To this end, first, the framework and methods in the hydrogen infrastructure deployment research were investigated systematically. Second, a hydrogen supply chain design (HSCD) model and a hydrogen refueling station location (HRSL) model were constructed. In view of the limitations of the two models, this paper reformulated the HRSL model through alternating the objective function and constraint, then proposed an integrated planning model using the & varepsilon;${\epsilon}$-constraint method, which relaxed the assumption condition and expanded the decision-making boundary of the original model, realizing the reasonable equilibrium of multiple segments. Finally, a case study was conducted using the Yangtze River Delta region as an example, and the main findings were as follows: (1) To meet the hydrogen demand of 25494t/d, the Yangtze River Delta region needs to build 94 coal gasification hydrogen plants, storage facilities with capacity of 12747t, transmission modes with capacity of 2333t/d, and 150 hydrogen refueling stations. (2) Railways have more advantages in large capacity and long-distance hydrogen transmission. (3) Road segments with higher traffic flow often have a higher capture proportion. (4) The investment cost accounts for the majority of hydrogen production plant construction, which is 43.80%.

关键词： hydrogen refueling station location hydrogen supply chain design mixed integer linear programming Yangtze River Delta region

来源：评论

学校读者我要写书评

暂无评论

Cyclic scheduling of multi-type wafers concurrent processing in single-arm cluster tools with residency time constraints

引用

EXPERT SYSTEMS WITH APPLICATIONS 2025年 269卷

作者： Li, Xin Yang, Wen Educ Univ Hong Kong Dept Math & Informat Technol Hong Kong 999077 Peoples R China Shenzhen Univ Coll Management Shenzhen 518055 Peoples R China

With the recent trend towards larger wafer sizes and smaller demand lots recently, there is a growing need for simultaneous production of multiple wafer types in a cluster tool. This presents a more complex scheduling challenge compared to identical types. Previous research primarily focuses on specific scenarios limited to the backward sequence, leaving a gap in the handling of more generalized scenarios without sequence restrictions. This paper proposes an approach towards the generalized cyclic scheduling of multiple wafer types in single- arm cluster tools, considering residency time constraints. A comprehensive operational scenario is described, using distinct symbols differentiate processing stages of wafers and their associated process modules. These elements are interconnected through shared process module sets. Based on detailed analysis of operations, a mixed integer linear programming model is proposed to handle the generalized scheduling problem. In the model, precedent relationships of robot operations are well defined, effectively preventing conflicts among them. Additionally, this model ensures the proper sequencing of processing stages in process modules - shared or not - to avoid overlap. Finally, the proposed approach is tested by both illustrative examples, especially including those previously considered unschedulable, and randomly generated instances. Testing results conduct the efficiency and validity of the proposed model.

关键词： Single-arm cluster tools Multiple wafer types Cyclic scheduling Residency time constraints mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Scheduling distributed heterogeneous non-permutation flowshop to minimize the total weighted tardiness

引用

EXPERT SYSTEMS WITH APPLICATIONS 2025年 272卷

作者： Xiong, Fuli Chen, Siyuan Xiong, Ningxin Jing, Lin Xian Univ Architecture & Technol Sch Informat & Control Engn Xian 710055 Peoples R China China Univ Petr Beijing Karamay Sch Petr Karamay 834000 Peoples R China

Flowshop scheduling is a critical problem in manufacturing and logistics, where jobs must be processed through a series of machines in a predefined order. In distributed heterogeneous flowshop scheduling, multiple factories with varying processing capacities and resources are involved, making the scheduling problem even more complex. Non-permutation flowshops (NPFS) further complicate this by allowing job sequences to differ across stages, thus significantly expanding the solution space compared to traditional permutation flowshops. Minimizing total weighted tardiness (TWT) is a key objective as it plays a crucial role in avoiding penalties for late deliveries. In this context, this paper addresses a distributed heterogeneous non-permutation flowshop scheduling problem with the objective of minimizing TWT (DHNPFSP_TWT). The problem involves multiple factories operating as NPFS, where job processing times differ across factories for the same production stage. Given the NP-hard nature of the problem, we first proposed a Manne-based mixed-integer linear programming model and a constraint programming (CP) model for small-scale instances. To solve medium- and largescale instances efficiently, we propose a three-phase adaptive evolutionary algorithm (TAE) that combines permutation and non-permutation search strategies, along with a job allocation adjustment phase. The TAE algorithm first finds a permutation solution using NEH3_en and random generation, followed by an adaptive local search and adaptive ruin and recreate algorithm for refinement and mutation. In the non-permutation phase, a greedy insertion strategy and local search techniques explore the solution space. The job allocation adjustment phase reallocates jobs based on the factory with the highest tardiness, and the second and third phases co-evolve to improve solution quality. Additionally, we propose a hybrid algorithm (AE_CP) integrating the strengths of adaptive evolutionary algorithms and CP to further enh

关键词： Distributed heterogeneous non-permutation flowshop Iterated greedy Constraint programming mixed integer linear programming Total weighted tardiness

来源：评论

学校读者我要写书评

暂无评论

Disaster risk-informed optimization using buffered failure probability for regional-scale building retrofit strategy

引用

STRUCTURAL SAFETY 2025年 114卷

作者： Seok, Uichan Byun, Ji-Eun Song, Junho Seoul Natl Univ Dept Civil & Environm Engn Seoul South Korea Univ Glasgow James Watt Sch Engn Glasgow Scotland

Regional retrofit planning of buildings is critical to address the increasing threat of natural disasters exacerbated by urban growth and climate change. To identify an optimal plan, this paper introduces a novel optimization framework. By integrating performance-based engineering (PBE) and reliability-based optimization (RBO), we propose buffered optimization and reliability method based mixed integer linear programming (BORM-MILP). The proposed formulation can identify optimal solutions using general optimization solvers, while handling a large number of PBE samples and buildings. Furthermore, the formulation introduces a modified active-set strategy tailored to regional-scale building retrofit optimization problems, further reducing computational memory. The proposed optimization framework is validated by a benchmark example of Seaside, Oregon. The optimization results are presented along in a map, offering visual support for decision-making processes. The application results are further investigated to analyze computational efficiency of the proposed active-set strategy, study convergence to the normal distribution, and identify a dominant factor for the building retrofit selection.

关键词： Building retrofit Performance-based engineering Reliability-based optimization Buffered failure probability mixed integer linear programming Community resilience

来源：评论

学校读者我要写书评

暂无评论

Hybrid quantum annealing decomposition framework for unit commitment

引用

ELECTRIC POWER SYSTEMS RESEARCH 2025年 238卷

作者： Ling, Jiajie Zhang, Quan Geng, Guangchao Jiang, Quanyuan Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China

Quantum computing is an emerging and promising technology that has overwhelming quantum advantages compared to its classical counterparts. Unit commitment (UC) is a critical issue in the power system, and it becomes more challenging with the integration of intermittent renewable energy. Therefore, this paper proposes an innovative decomposition and coordination optimization framework to accelerate the solution of UC, in which the interaction between an adiabatic quantum computer and a classical computer is designed to harness the immense computational power of quantum computers effectively. First, decomposition methods considering the requirements of quantum computers are introduced to decompose UC into smallscale models. Then, the paper presents a quadratic unconstrained binary optimization modeling method to transform UC problems into the form of quantum computing. Furthermore, due to the limitations of quantum computing resources, a reductive variable technique is proposed to reduce the number of slack variables in the optimization model and ensure that it remains feasible for quantum computers. Case studies conducted in test systems with a quantum annealing simulator and a real quantum annealing computer illustrate the feasibility and effectiveness of the method and demonstrate its potential in the era of quantum computing.

关键词： Decomposition method Quantum annealing mixed integer linear programming Unit commitment

来源：评论

学校读者我要写书评

暂无评论

A Policy-Based Meta-Heuristic Algorithm for Energy-Aware Distributed No-Wait Flow-Shop Scheduling in Heterogeneous Factory Systems

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2025年第1期55卷 620-634页

作者： Zhao, Fuqing Song, Lisi Jiang, Tao Wang, Ling Dong, Chenxin Lanzhou Univ Technol Sch Comp & Commun Lanzhou 730050 Peoples R China Southern Univ Sci & Technol Dept Comp Sci & Engn Shenzhen 518055 Peoples R China Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Qingdao Hengxing Univ Sci & Technol Dept Automot Engn Qingdao 266100 Peoples R China

In the face of environmental deterioration and global climate change, the concept of carbon neutrality and carbon peaking has gained prominence as a means to balance development and environmental preservation worldwide. Energy-aware scheduling is becoming the key scenario for environment conservation in manufacturing. This study focuses on addressing the energy-aware distributed no-wait flow-shop scheduling problem in a heterogeneous factory system (EDNWFSP-HFS) to minimize total energy consumption (TEC) and total tardiness (TTDs). A mixed-integer linear programming (MILP) model is formulated and a policy-based meta-heuristic algorithm (MHA-PG) is specifically designed to solve EDNWFSP-HFS. First, the optimal allocation rules based on random sequence (OAR-RS) are designed to initialize the population. Second, a policy-based method is employed to guide the algorithm toward making a better decision. Third, the energy-saving strategy considering specific knowledge of EDNWFSP-HFS is summarized to further optimize the feasible solution. Extensive simulations are conducted, comparing the performance of MHA-PG against several state-of-the-art algorithms. The results demonstrate that the proposed algorithm outperforms the competing approaches in solving EDNWFSP-HFS, indicating its superior performance and effectiveness.

关键词： Climate change Manufacturing automation Metaheuristics Job shop scheduling Distributed management Energy management Heterogeneous networks Carbon neutral mixed integer linear programming Distributed flow-shop scheduling energy-aware scheduling heterogeneous factory system (HFS) policy-based meta-heuristic

来源：评论

学校读者我要写书评

暂无评论

A Universal Cooperative Decision-Making Framework for Connected Autonomous Vehicles With Generic Road Topologies

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2025年第4期74卷 5414-5429页

作者： Huang, Zhenmin Liu, Wenru Shen, Shaojie Ma, Jun Hong Kong Univ Sci & Technol Guangzhou Robot & Autonomous Syst Thrust Guangzhou 511453 Peoples R China Hong Kong Univ Sci & Technol Div Emerging Interdisciplinary Areas Hong Kong Peoples R China Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Peoples R China

Cooperative decision-making of Connected Autonomous Vehicles (CAVs) presents a longstanding challenge due to its inherent nonlinearity, non-convexity, and discrete characteristics, compounded by the diverse road topologies encountered in real-world traffic scenarios. The majority of current methodologies are only applicable to a single and specific scenario, predicated on scenario-specific assumptions. Consequently, their application in real-world environments is restricted by the innumerable nature of traffic scenarios. In this study, we propose a unified optimization approach that exhibits the potential to address cooperative decision-making problems related to traffic scenarios with generic road topologies. This development is grounded in the premise that the topologies of various traffic scenarios can be universally represented as Directed Acyclic Graphs (DAGs). Particularly, the reference paths and time profiles for all involved CAVs are determined in a fully cooperative manner, taking into account factors such as velocities, accelerations, conflict resolutions, and overall traffic efficiency. The cooperative decision-making of CAVs is approximated as a mixed-integer linear programming (MILP) problem building on the DAGs of road topologies. This favorably facilitates the use of standard numerical solvers and the global optimality can be attained through the optimization. Case studies corresponding to different multi-lane traffic scenarios featuring diverse topologies are scheduled as the test itineraries, and the efficacy of our proposed methodology is corroborated.

关键词： Decision making Topology Roads Optimization Games Merging Autonomous vehicles Trajectory planning Trajectory mixed integer linear programming Autonomous driving multi-agent systems connected autonomous vehicles (CAVs) cooperative decision-making non-convex optimization mixed-integer linear programming (MILP)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：