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

Hybrid Variable Neighborhood Search Algorithm for the Multi-objective Distributed Permutation Flowshop scheduling Problem with Sequence-Dependent Setup Times

Hybrid Variable Neighborhood Search Algorithm for the Multi-...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： She, Mingzhe Qiao, Fei Ma, Yumin Wang, Junkai Ai, Jiakang Liu, Juan Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China College of Electronics and Information Engineering Tongji University Shanghai201804 China

ISBN: (纸本)9781665410205

This paper addresses the multi-objective distributed permutation flowshop scheduling problem with sequence-dependent setup times (MODPFSP_SDST), whose optimization objectives are the makespan, the total energy consumption and the noise emission. An effective hybrid variable neighborhood search (HVNS) algorithm is proposed for solving this problem. HVNS utilizes a probabilistic matrix to store structural information of the promising solution, and then employs matrix-based search operators to execute variable neighborhood search. Additionally, the objective-oriented local intensification search is integrated to further enhance solution quality. Simulations and comparisons demonstrate the effectiveness of HVNS in solving the MODPFSP_SDST. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization scheduling Algorithm of Logistics Distribution Vehicles Based on Internet of Vehicles Platform 7th

Optimization Scheduling Algorithm of Logistics Distribution ...

引用

7th EAI International Conference on Advanced Hybrid Information Processing, ADHIP 2023

作者： Li, Zhuorong Yao, Yongchang Zhang, Haibo Li, Nan Sun, Jianmei Dalian University of Science and Technology Dalian116000 China Chongqing Vocational Institute of Tourism Chongqing409099 China

ISBN: (纸本)9783031505515

In the phase of logistics distribution vehicle scheduling, the distribution time and travel distance of vehicles are relatively long due to the influence of the real-time change attribute characteristics of the actual traffic environment state. Therefore, this paper proposes an optimization scheduling algorithm for logistics distribution vehicles based on the Internet of Vehicles platform. The Internet of Vehicles platform including acquisition layer, transmission layer, data layer and application layer is constructed to achieve the acquisition and analysis of real-time information of the actual traffic environment status. In the logistics distribution vehicle scheduling phase, the objective function of comprehensively arranging the number of vehicles, the total distance traveled by the distribution vehicles and the time window constraint punishment is constructed. After the objective function is input into the Internet of Vehicles platform, the greedy algorithm strategy is used to achieve the optimal scheduling of vehicles. In the test results, the design algorithm achieves the goal of shortening the vehicle delivery time and driving distance without considering the results under traffic conditions and the scheduling effect under dynamic conditions. To sum up, the optimization scheduling algorithm of logistics distribution vehicles based on the Vehicle-to-everything platform can help optimize the travel distance and distribution time of vehicles, and improve the efficiency and accuracy of logistics distribution. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Temporal Resource Slicing and scheduling Algorithm for 6G Networks Based on MPNN-DQN 24

Multi-Temporal Resource Slicing and Scheduling Algorithm for...

引用

24th IEEE International Conference on Communication Technology, ICCT 2024

作者： Wang, YiFei Zhu, XiaoRong Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9798350363760

This paper proposes a dynamic network slicing and resource scheduling algorithm for 6G networks, combining Message Passing Neural Networks (MPNN) and Deep Q-Learning (DQN). The algorithm uses MPNN to extract features from network nodes and links, updating their states through a message-passing mechanism. DQN then predicts the Q-value of each action based on these features, enabling fine-grained resource allocation. This approach dynamically adjusts both intra-slice and inter-slice resource allocations, significantly enhancing network resource utilization and service quality. Extensive simulations demonstrate the algorithm's ability to maintain stable resource allocation over longer time scales while improving real-time service performance on shorter time scales. Results indicate that the algorithm significantly outperforms existing methods in resource utilization, task completion rate, and service quality. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Robust Genetic Based Constraint scheduling Algorithm to Promote On-Demand Cloud Services 11

A Robust Genetic Based Constraint Scheduling Algorithm to Pr...

引用

11th International Conference on Electrical and Electronics Engineering, ICEEE 2024

作者： Hababeh, Ismail Daoud, Mohammad I. Omar, Medya School of Electrical Engineering and Information Technology German Jordanian University Amman Jordan

ISBN: (纸本)9798350362541

The scientific workflow scheduling provides an effective technique to improve cloud services performance and address the user constraints. However, many cloud services are limited in their execution time, storage, and cost, but few are anticipated to enhance workflow task scheduling based on certain quality of service constraints. This research presents a genetic algorithm for offline scheduling tasks with deadlines and budget constraints. The proposed approach utilizes the three-point crossover operation to generate better offspring. The proposed method is simulated in WorkflowSim and assessed using several state-of-the-art scientific workflows. The experimental results validate the competent performance of the proposed approach over well-known scheduling methods. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Tabu Search Algorithm for the Distributed Assembly Flowshop scheduling Problem with Sequence Dependent Setup Times 43

A Hybrid Tabu Search Algorithm for the Distributed Assembly ...

引用

43rd Chinese Control Conference, CCC 2024

作者： Song, Hong-Bo Chen, You-Rong Lin, Jian Song, Hai-Yu Zhang, Jing Zhejiang Shuren University College of Information Science and Technology Hangzhou310015 China Zhejiang University of Finance & Economics Department of Artificial Intelligence Hangzhou310018 China Zhejiang Police College Department of Computer and Information Security Hangzhou310051 China

ISBN: (纸本)9789887581581

In this paper, a Hybrid Tabu Search (HTS) algorithm is proposed to solve the Distributed Assembly Permutation Flowshop scheduling Problem with Sequence Dependent Setup Times (DAPFSP-SDST). For the objective of minimizing the maximal completion time (makespan), the optimization process is divided into two steps to minimize the Sum of Assembly Setup Times (SAST) and the Sum of Idle Time for Assembly Machine (SITAM), respectively. This is based on finding that minimization of makespan equals to minimization of the sum of SAST and SITAM for the DAPFSP-SDST. At the first step, a constructive algorithm is designed to obtain initial product sequences for the sake of SAST. Then, a tabu search algorithm is presented to perform on the product sequences for searching more promising areas in the solution space with both smaller SAST and various critical product sequences. At the second step, a critical-job-sequence-based local search algorithm is proposed to exploit these areas to find solutions with SITAM as small as possible. Finally, Experiment results show the effectiveness of the proposed HTS algorithm. © 2024 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

scheduling with Locality by Routing 49

Scheduling with Locality by Routing

引用

49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024

作者： Liu, Alison Hsiang-Hsuan Liu, Fu-Hong Department of Information and Computing Sciences Utrecht University Netherlands Department of Industrial Engineering and Engineering Management National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)9783959773355

This work examines a strongly NP-hard routing problem on trees, in which multiple servers need to serve a given set of requests (on vertices), where the routes of the servers start from a common source and end at their respective terminals. Each server can travel free of cost on its source-to-terminal path but has to pay for travel on other edges. The objective is to minimize the maximum cost over all servers. As the servers may pay different costs for traveling through a common edge, balancing the loads of the servers can be difficult. We propose a polynomial-time 4-approximation algorithm that applies the parametric pruning framework but consists of two phases. The first phase of the algorithm partitions the requests into packets, and the second phase of the algorithm assigns the packets to the servers. Unlike the standard parametric pruning techniques, the challenge of our algorithm design and analysis is to harmoniously relate the quality of the partition in the first phase, the balances of the servers’ loads in the second phase, and the hypothetical optimal values of the framework. For the problem in general graphs, we show that there is no algorithm better than 2-approximate unless P = NP. The problem is a generalization of unrelated machine scheduling and other classic scheduling problems. It also models scheduling problems where the job processing times depend on the machine serving the job and the other jobs served by that machine. This modeling provides a framework that physicalizes scheduling problems through the graph’s point of view. © Alison Hsiang-Hsuan Liu and Fu-Hong Liu.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

NAGA: A Deterministic Programmable Network With Update Timing Guarantees

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2025年第2期22卷 1874-1888页

作者： Deric, Nemanja Varasteh, Amir Blenk, Andreas Kellerer, Wolfgang Tech Univ Munich Chair Commun Networks D-80333 Munich Germany Siemens AG Fdn Technol Dept D-80333 Munich Germany

There is no system yet that provides predictable data plane and control plane operations in programmable networks. However, both predictable data plane and control plane operations are needed, e.g., in industrial networks. Particularly there, the operation of the network needs to be planned and, hence, relies on network operations that are deterministic and executed in a timely manner. To fill this gap, this paper proposes our system named NAGA, which provides data plane deterministic guarantees along with consistent and timely network updates in programmable networks. In order to not rely on specialized hardware, NAGA uses widely-available hardware capabilities such as priority queuing and label-based forwarding. Whereas the real implementation of NAGA in a P4-based testbed demonstrates that applications receive guaranteed performance in terms of latency and data rate, simulation studies show the ability of NAGA to be even deployed in large scale scenarios beyond industrial networks, such as wide area and data center networks.

关键词： Control systems Hardware scheduling algorithms Process control Delays Tagging Scalability Runtime Production facilities Packet loss Network control deterministic networking programmable devices

来源：评论

学校读者我要写书评

暂无评论

Instance Configuration for Sustainable Job Shop scheduling 26

Instance Configuration for Sustainable Job Shop Scheduling

引用

26th International Workshop on Configuration, ConfWS 2024

作者： Pérez, Christian March, Carlos Salido, Miguel Universitat Politècnica de València Instituto de Automática e Informática Industrial Camì de Vera S/N Valencia Spain Universitat Politècnica de València valgrAI - Valencian Graduate School Research Network of Artificial Intelligence Camì de Vera S/N Valencia Spain

The Job Shop scheduling Problem (JSP) is a pivotal challenge in operations research and is essential for evaluating the effectiveness and performance of scheduling algorithms. scheduling problems are a crucial domain in combinatorial optimization, where resources (machines) are allocated to job tasks to minimize the completion time (makespan) alongside other objectives like energy consumption. This research delves into the intricacies of JSP, focusing on optimizing performance metrics and minimizing energy consumption while considering various constraints such as deadlines and release dates. Recognizing the multi-dimensional nature of benchmarking in JSP, this study underscores the significance of reference libraries and datasets like JSPLIB in enriching algorithm evaluation. The research highlights the importance of problem instance characteristics, including job and machine numbers, processing times, and machine availability, emphasizing the complexities introduced by energy consumption considerations. An innovative instance configurator is proposed, equipped with parameters such as the number of jobs, machines, tasks, and speeds, alongside distributions for processing times and energy consumption. The generated instances encompass various configurations, reflecting real-world scenarios and operational constraints. These instances facilitate comprehensive benchmarking and evaluation of scheduling algorithms, particularly in contexts of energy efficiency. A comprehensive set of 500 test instances has been generated and made publicly available, promoting further research and benchmarking in JSP. These instances enable robust analyses and foster collaboration in developing advanced, energy-efficient scheduling solutions by providing diverse scenarios. © 2024 Copyright for this paper by its authors.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Development of IC scheduling Management System

Development of IC Scheduling Management System

引用

2024 International Conference on Power, Electrical Engineering, Electronics and Control, PEEEC 2024

作者： Chen, Tingduo Xie, Nan Zhong, Xilong Chen, Weimin Zhejiang University of Water Resources and Electric Power College of Computer Science and Technology Zhejiang Hangzhou China China Jiliang University College of Mechanical and Electrical Engineering Zhejiang Hangzhou China

ISBN: (纸本)9798350378917

IC integrated circuits are the core component of modern electronic products, and their production process is complex and precise. Therefore, popularizing human knowledge of IC integrated circuits and introducing the concept of integrated circuit scheduling can effectively promote industrial automation and reduce labor costs. Making scientific decisions is extremely important and requires further exploration. This system adopts a front-end and back-end separation development mode, with Vue used for front-end development, which is used to build user interfaces and single page applications, and send requests to the back-end to obtain data and perform operations;The backend is developed using Spring Boot, which is used to build Java application frameworks, handle requests sent by the frontend, retrieve data from the database, execute business logic, and return results to the frontend. This combination approach can more flexibly and efficiently build modern web applications. The system also uses sorting algorithms and collaborative filtering algorithms, among which the sorting algorithm can prioritize each added task based on the user's selection, based on hardware input parameters, and process the process according to the priority order. This can more efficiently complete the processing process and provide users with a platform and application reference for learning integrated circuit related knowledge and communication. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A scheduling Algorithm for Mobile Charging Devices in Distribution System Considering the Comprehensive Influence of Multiple Factors 10

A Scheduling Algorithm for Mobile Charging Devices in Distri...

引用

10th IEEE International Power Electronics and Motion Control Conference, IPEMC 2024 ECCE Asia

作者： Chen, Feiyu Wang, Qingsong Song, Jiaming Buja, Giuseppe Southeast University School of Software Engineering Suzhou China Southeast University School of Electrical Engineering Nanjing China University of Padova Department of Industrial Engineering Italy

ISBN: (纸本)9798350351330

The current mismatch between the number of public fixed charging stations and the ownership of electric vehicles has brought enormous charging pressure, and mobile charging services can provide an alternative to battery replenishment. As an energy storage device, mobile charging device is also beneficial for improving the reliability of distribution systems. A scheduling algorithm for mobile charging devices is proposed in this paper, which considers comprehensive impact of multiple factors. The operation mode and application scenarios of mobile charging services are analyzed, the electric vehicle charging model and scheduling cost calculation model are established. Finally, the feasibility and effectiveness of the algorithm are verified through simulation example. © 2024 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：