期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到10,204篇文章
< 1 2 … 250 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Long-release-interval-first real-time scheduling algorithm and its schedulability test 认领 引用
1
作者 沈卓炜 汪芸 《Journal of Southeast University(English Edition)》 EI CAS 2006年第4期484-489,共6页
To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic prior... To fulfill the requirements for hybrid real-time system scheduling, a long-release-interval-first （LRIF） real-time scheduling algorithm is proposed. The algorithm adopts both the fixed priority and the dynamic priority to assign priorities for tasks. By assigning higher priorities to the aperiodic soft real-time jobs with longer release intervals, it guarantees the executions for periodic hard real-time tasks and further probabilistically guarantees the executions for aperiodic soft real-time tasks. The schedulability test approach for the LRIF algorithm is presented. The implementation issues of the LRIF algorithm are also discussed. Simulation result shows that LRIF obtains better schedulable performance than the maximum urgency first （MUF） algorithm, the earliest deadline first （EDF） algorithm and EDF for hybrid tasks. LRIF has great capability to schedule both periodic hard real-time and aperiodic soft real-time tasks. 展开更多
关键词 real-time scheduling schedulability test earliest deadline first maximum urgency first long release interval first
暂未订购 下载PDF
A Real-Time Task Scheduling Algorithm Based on Bilateral Matching Games in a Distributed Computing Environment 认领 引用
2
作者 LI Shuo FANG Zuying +1 位作者 ZHOU Guoqiang DAI Guilan 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2026年第1期69-78,共10页
In the era of the Internet of Things,distributed computing alleviates the problem of insufficient terminal computing power by integrating idle resources of heterogeneous devices.However,the imbalance between task exec... In the era of the Internet of Things,distributed computing alleviates the problem of insufficient terminal computing power by integrating idle resources of heterogeneous devices.However,the imbalance between task execution delay and node energy consumption,and the scheduling and adaptation challenges brought about by device heterogeneity,urgently need to be addressed.To tackle this problem,this paper constructs a multi-objective real-time task scheduling model that considers task real-time performance,execution delay,system energy consumption,and node interests.The model aims to minimize the delay upper bound and total energy consumption while maximizing system satisfaction.A real-time task scheduling algorithm based on bilateral matching game is proposed.By designing a bidirectional preference mechanism between tasks and computing nodes,combined with a multi-round stable matching strategy,accurate matching between tasks and nodes is achieved.Simulation results show that compared with the baseline scheme,the proposed algorithm significantly reduces the total execution cost,effectively balances the task execution delay and the energy consumption of compute nodes,and takes into account the interests of each network compute node. 展开更多
关键词 dispersed computing real-time task task scheduling bilateral matching game
暂未订购 下载PDF
Information Diffusion Models and Fuzzing Algorithms for a Privacy-Aware Data Transmission Scheduling in 6G Heterogeneous ad hoc Networks 认领 引用 被引量：1
3
作者 Borja Bordel Sánchez Ramón Alcarria Tomás Robles 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第2期1214-1234,共21页
In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic h... In this paper,we propose a new privacy-aware transmission scheduling algorithm for 6G ad hoc networks.This system enables end nodes to select the optimum time and scheme to transmit private data safely.In 6G dynamic heterogeneous infrastructures,unstable links and non-uniform hardware capabilities create critical issues regarding security and privacy.Traditional protocols are often too computationally heavy to allow 6G services to achieve their expected Quality-of-Service(QoS).As the transport network is built of ad hoc nodes,there is no guarantee about their trustworthiness or behavior,and transversal functionalities are delegated to the extreme nodes.However,while security can be guaranteed in extreme-to-extreme solutions,privacy cannot,as all intermediate nodes still have to handle the data packets they are transporting.Besides,traditional schemes for private anonymous ad hoc communications are vulnerable against modern intelligent attacks based on learning models.The proposed scheme fulfills this gap.Findings show the probability of a successful intelligent attack reduces by up to 65%compared to ad hoc networks with no privacy protection strategy when used the proposed technology.While congestion probability can remain below 0.001%,as required in 6G services. 展开更多
关键词 6G networks ad hoc networks privacy scheduling algorithms diffusion models fuzzing algorithms
暂未订购 下载PDF
A Workflow Scheduling Method Based on the Combination of Tunicate Swarm Algorithm and Highest Response Ratio Next Scheduling 认领 引用
4
作者 Yujie Tian Ming Zhu +2 位作者 Jing Li Cong Liu Ziyang Zhang 《Computers, Materials & Continua》 SCIE EI 2026年第5期1950-1963,共14页
Workflow scheduling is critical for efficient cloud resource management.This paper proposes Tunicate Swarm-Highest Response Ratio Next,a novel scheduler that synergistically combines the Tunicate Swarm Algorithm with ... Workflow scheduling is critical for efficient cloud resource management.This paper proposes Tunicate Swarm-Highest Response Ratio Next,a novel scheduler that synergistically combines the Tunicate Swarm Algorithm with the Highest Response Ratio Next policy.The Tunicate Swarm Algorithm generates a cost-minimizing task-to-VM mapping scheme,while the Highest Response Ratio Next dynamically dispatches tasks in the ready queue with the highest-priority.Experimental results demonstrate that the Tunicate Swarm-Highest Response RatioNext reduces costs by up to 94.8%compared to meta-heuristic baselines.It also achieves competitive cost efficiency vs.a learning-based method while offering superior operational simplicity and efficiency,establishing it as a highly practical solution for dynamic cloud environments. 展开更多
关键词 Workflow scheduling cloud computing tunicate swarm algorithm highest response ratio next scheduling
暂未订购 下载PDF
Hyper-heuristic Evolutionary Algorithm Utilizing Q-learning for Addressing the Distributed Flexible Job-Shop Scheduling Problem in the Context of Worker Absenteeism 认领 引用
5
作者 Zhiqing Li Yongquan Zhou Qifang Luo 《Journal of Bionic Engineering》 SCIE EI CSCD 2026年第3期1932-1969,共38页
The Distributed Flexible Job Shop Scheduling Problem(DFJSP)is critical in modern manufacturing;however,existing research has not sufficiently addressed dynamic disturbances,particularly unexpected worker absences.This... The Distributed Flexible Job Shop Scheduling Problem(DFJSP)is critical in modern manufacturing;however,existing research has not sufficiently addressed dynamic disturbances,particularly unexpected worker absences.This study extends the DFJSPW model to introduce an enhanced framework,DFJSPWA,which optimizes maximum makespan,worker workload,and total energy consumption by integrating worker load factors with random absenteeism.To solve this complex problem,we propose a Q-learning-based Hyper-heuristic Evolutionary Algorithm(QLHHEA).This algorithm features a segmented encoding scheme that implicitly captures absenteeism information,utilizing a decoding process tailored for both standard and rescheduling contexts.Additionally,we construct a pool of twelve efficient Low-Level Heuristics(LLHs)combined with Q-learning to enable the adaptive selection of operators.Furthermore,a Hybrid Rescheduling Method(HRM)is developed,employing three response strategies based on worker status and the urgency of the absenteeism.Comprehensive experiments on 58 benchmark instances demonstrate that QLHHEA significantly outperforms six established algorithms,including MOEA/D and NSGA-II.Statistical validation confirms the superiority of the proposed method.This research provides a robust theoretical and methodological framework for improving scheduling efficiency and resource utilization in distributed production systems facing worker absenteeism. 展开更多
关键词 Worker absenteeism Distributed flexible job shop scheduling problem Hyper-heuristic evolutionary algorithm Dynamic rescheduling Q-learning
An Adaptive Imperialist Competitive Algorithm with Cooperation for Flexible Jobshop and Parallel Batch Processing Machine Scheduling 认领 引用
6
作者 Jie Wang Deming Lei 《Computers, Materials & Continua》 SCIE EI 2026年第6期1934-1960,共27页
Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prev... Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prevalent in real-life manufacturing processes and is seldom investigated.In this study,FJPBPMSP is examined,where flexible processing and batch processing are performed sequentially.An adaptive imperialist competitive algorithm with cooperation(CAICA)is proposed to minimize makespan and total energy consumption simultaneously.In CAICA,a four-string representation is adopted,and initial empires with novel structures are formed by uniformly dividing the population.An adaptive assimilation and revolution are designed.An adaptive assimilation and revolution are designed.An adaptive imperialist competition with cooperation is provided.Search strategies,imperialists,and colonies are also renewed by new procedures.Computational experiments are conducted on 50 instances.The computational results show that the new strategies of CAICA are effective,and CAICA can provide better results than its comparative algorithms in solving FJPBPMSP. 展开更多
关键词 Flexible jobshop scheduling parallel batch processing scheduling imperialist competition algorithm cooperation
暂未订购 下载PDF
Precedence Criteria and Gradient-Based Scheduling Algorithm for the Airplane Refueling Problem 认领 引用
7
作者 LIN Hao HE Cheng 《Chinese Quarterly Journal of Mathematics》 2026年第1期38-49,共12页
The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilom... The airplane refueling problem can be stated as follows.We are given n airplanes which can refuel one another during the flight.Each airplane has a reservoir volume wj(liters)and a consumption rate pj(liters per kilometer).As soon as one airplane runs out of fuel,it is dropping out of the flight.The problem asks for finding a refueling scheme such that the last plane in the air reach a maximal distance.An equivalent version is the n-vehicle exploration problem.The computational complexity of this non-linear combinatorial optimization problem is open so far.This paper employs the neighborhood exchange method of single-machine scheduling to study the precedence relations of jobs,so as to improve the necessary and sufficiency conditions of optimal solutions,and establish an efficient heuristic algorithm which is a generalization of several existing special algorithms. 展开更多
关键词 Combinatorial optimization Scheduling method The airplane refueling problem Optimality criteria Heuristic algorithm
暂未订购 下载PDF
A Compound Prescheduling Algorithm for Real-Time Tasks’ Battery-Aware Scheduling 认领 引用
8
作者 CAO Yang GAO Xun +1 位作者 LIAO Weihui LI Geyang 《Wuhan University Journal of Natural Sciences》 CAS 2009年第3期235-240,共6页
To minimize battery consumption for portable devices, the prescheduling policy of battery-aware scheduling was improved by optimizing slack distribution. A battery-aware compound task scheduling （BACTS） algorithm co... To minimize battery consumption for portable devices, the prescheduling policy of battery-aware scheduling was improved by optimizing slack distribution. A battery-aware compound task scheduling （BACTS） algorithm considering various aspects including task deadline, current and execution time was proposed and evaluated with the previously prevailing earliest deadline first （EDF） algorithm. The results indicate the proposed BACTS algorithm manages to figure out a feasible schedule （if available） in battery-aware task scheduling even for disorganized connected task graphs beyond the solving ability of EDF. Its schedule achieves better performance with lower charge consumption after prescheduling, and also lower or equal optimum charge consumption after voltage scaling. 展开更多
关键词 scheduling algorithm battery dynamic voltage scaling slack
暂未订购 下载PDF
Integrated scheduling optimization of carrier-based aircraft deck operation for comprehensive efficiency 认领 引用 被引量：1
9
作者 Wei Han Haonan Wu +2 位作者 Fang Guo Liangliang Cheng Xichao Su 《Defence Technology（防务技术）》 SCIE EI CAS CSCD 2026年第8期190-215,共26页
An aircraft carrier's formidable combat capability relies on sorties,with efficient deck operations as the core to enhance sortie and recovery capabilities.First,this study develops an integrated mathematical mode... An aircraft carrier's formidable combat capability relies on sorties,with efficient deck operations as the core to enhance sortie and recovery capabilities.First,this study develops an integrated mathematical model for carrier-based aircraft deployment,sortie,and maintenance scheduling to assist decision-makers in formulating sorties and coordinating resource allocation(e.g.,personnel,equipment),aiming to optimize the comprehensive effectiveness index of integrated carrier-based aircraft scheduling.Second,a hybrid multi-layer coded genetic algorithm(HMCGA)integrated with heuristic rules is proposed;it uses four-layer coding to resolve inter-sub-process coupling and supports integrated carrier-based aircraft scheduling,covering hangar transfer,deck transfer,aircraft maintenance support,and sortie execution.Then,case simulation shows the proposed model and algorithm effectively improve operational effectiveness and ensure accuracy.Finally,comparisons of 50 independent simulation results(PSO,DE,WOA,CPLEX)effectively validate HMCGA's superiority and universality in solving integrated carrier-based aircraft scheduling problems across fleet scales,further confirming the model and algorithm's reliability. 展开更多
关键词 Comprehensive efficiency Hybrid multi-layer coding genetic algorithm Scheduling optimization Integrated scheduling
暂未订购 下载PDF
Real-time decision support for bolter recovery safety:Long short-term memory network-driven aircraft sequencing 认领 引用
10
作者 Wei Han Changjiu Li +4 位作者 Xichao Su Yong Zhang Fang Guo Tongtong Yu Xuan Li 《Defence Technology（防务技术）》 SCIE EI CAS CSCD 2026年第2期184-205,共22页
The highly dynamic nature,strong uncertainty,and coupled multiple safety constraints inherent in carrier aircraft recovery operations pose severe challenges for real-time decision-making.Addressing bolter scenarios,th... The highly dynamic nature,strong uncertainty,and coupled multiple safety constraints inherent in carrier aircraft recovery operations pose severe challenges for real-time decision-making.Addressing bolter scenarios,this study proposes an intelligent decision-making framework based on a deep long short-term memory Q-network.This framework transforms the real-time sequencing for bolter recovery problem into a partially observable Markov decision process.It employs a stacked long shortterm memory network to accurately capture the long-range temporal dependencies of bolter event chains and fuel consumption.Furthermore,it integrates a prioritized experience replay training mechanism to construct a safe and adaptive scheduling system capable of millisecond-level real-time decision-making.Experimental demonstrates that,within large-scale mass recovery scenarios,the framework achieves zero safety violations in static environments and maintains a fuel safety violation rate below 10%in dynamic scenarios,with single-step decision times at the millisecond level.The model exhibits strong generalization capability,effectively responding to unforeseen emergent situations—such as multiple bolters and fuel emergencies—without requiring retraining.This provides robust support for efficient carrier-based aircraft recovery operations. 展开更多
关键词 Carrier-based aircraft Recovery scheduling Deep reinforcement learning Long short-term memory networks Dynamic real-time decision-making
暂未订购 下载PDF
LLM‑assisted adaptive large neighborhood search for agile earth observation satellite scheduling 认领 引用
11
作者 Feiran WANG Jiawei CHEN +4 位作者 Yonghao DU Yanjie SONG Yingwu CHEN Rammohan MALLIPEDDI Witold PEDRYCZ 《ENGINEERING Management》 CSCD 2026年第1期213-239,共27页
The Agile Earth Observation Satellite Scheduling Problem(AEOSSP)is a complex NP‑hard challenge that involves selecting,sequencing,and timing observation tasks to maximize imaging profits while adhering to various cons... The Agile Earth Observation Satellite Scheduling Problem(AEOSSP)is a complex NP‑hard challenge that involves selecting,sequencing,and timing observation tasks to maximize imaging profits while adhering to various constraints.In our study,we developed a mixed‑integer programming model for AEOSSP,incorporating key constraints related to visible time windows and time dependencies.To tackle this,we propose an Evolutionary Adaptive Large Neighborhood Search Algorithm(evALNS)enhanced by Large Language Models(LLMs).Our work pioneers the application of LLMs to ALNS by being the first to automatically develop and evolve its critical destroy heuristics.However,a naive application of LLMs is insufficient for such a complex domain.We therefore introduce a novel Dual‑Population Co‑Evolutionary Computing Framework(DPEC)to bridge the LLM’s knowledge gap by synergizing LLM‑generated heuristics with expert‑designed ones.This co‑evolution,guided by a Functional Natural Language Embedding(FNLE)strategy and customized prompts,significantly enhances the adaptability and efficiency of ALNS.Extensive numerical experiments demonstrated the superiority of the evALNS evolved under our framework,achieving an average profit improvement of 8.48%compared to the original ALNS with expert‑designed destroy operators. 展开更多
关键词 large language model algorithm design adaptive large neighborhood search satellite scheduling
暂未订购 下载PDF
A Model Predictive Scheduling Algorithm inReal-Time Control Systems 认领 引用 被引量：3
12
作者 Mengya Kang Chenglin Wen Chenxi Wu 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2018年第2期471-478,共8页
Abstract-The ineffective utilization of power resources has attracted much attention in current years. This paper proposes a real-time distributed load scheduling algorithm considering constraints of power supply. Fir... Abstract-The ineffective utilization of power resources has attracted much attention in current years. This paper proposes a real-time distributed load scheduling algorithm considering constraints of power supply. Firstly, an objective function is designed based on the constraint, and a base load forecasting model is established when aggregating renewable generation and non-deferrable load into a power system, which aims to transform the problem of deferrable loads scheduling into a distributed optimal control problem. Then, to optimize the objective function, a real-time scheduling algorithm is presented to solve the proposed control problem. At every time step, the purpose is to minimize the variance of differences between power supply and aggregate load, which can thus ensure the effective utilization of power resources. Finally, simulation examples are provided to illustrate the effectiveness of the proposed algorithm. 展开更多
关键词 Index Terms-Deferrable loads scheduling electric vehicles（EVs） optimal control power supply real-time distributed con-trol.
暂未订购 下载PDF
Optimal scheduling of active distribution networks based on multi-scenario fuzzy set based charging station resource prediction 认领 引用
13
作者 Zhang Maosong Zhang Chunyu +3 位作者 Hao Shi Yang Jie Yang Lingxiao Wang Xiuqin 《High Technology Letters》 EI CAS 2026年第1期97-108,共12页
With the large-scale integration of new energy sources,various resources such as energy storage,electric vehicles(EVs),and photovoltaics(PV) have participated in the scheduling of active distribution networks(ADNs),po... With the large-scale integration of new energy sources,various resources such as energy storage,electric vehicles(EVs),and photovoltaics(PV) have participated in the scheduling of active distribution networks(ADNs),posing new challenges to the operation and scheduling of distribution networks.Aiming at the uncertainty of PV and EV,an optimal scheduling model for ADNs based on multi-scenario fuzzy set based charging station resource forecasting is constructed.To address the scheduling uncertainties caused by PV and load forecasting errors,a day-ahead optimal scheduling model based on conditional value at risk(CVaR) for cost assessment is established,with the optimization objectives of minimizing the operation cost of distribution networks and the risk cost caused by forecasting errors.An improved subtractive optimizer algorithm is proposed to solve the model and formulate day-ahead optimization schemes.Secondly,a forecasting model for dispatchable resources in charging stations is constructed based on event-based fuzzy set theory.On this basis,an intraday scheduling model is built to comprehensively utilize the dispatchable resources of charging stations to coordinate with the output of distributed power sources,achieving optimal scheduling with the goal of minimizing operation costs.Finally,an experimental scenario based on the IEEE-33 node system is designed for simulation verification.The comparison of optimal scheduling results shows that the proposed method can fully exploit the potential scheduling resources of charging stations,improving the operation stability of ADNs and the accommodution capacity of new energy. 展开更多
关键词 charging station resource prediction subtractive optimizer algorithm multi-scenario fuzzy set two-stage optimal scheduling distribution network cost optimization
暂未订购 下载PDF
Innovative Approaches to Task Scheduling in Cloud Computing Environments Using an Advanced Willow Catkin Optimization Algorithm 认领 引用 被引量：2
14
作者 Jeng-Shyang Pan Na Yu +3 位作者 Shu-Chuan Chu An-Ning Zhang Bin Yan Junzo Watada 《Computers, Materials & Continua》 SCIE EI 2025年第2期2495-2520,共26页
The widespread adoption of cloud computing has underscored the critical importance of efficient resource allocation and management, particularly in task scheduling, which involves assigning tasks to computing resource... The widespread adoption of cloud computing has underscored the critical importance of efficient resource allocation and management, particularly in task scheduling, which involves assigning tasks to computing resources for optimized resource utilization. Several meta-heuristic algorithms have shown effectiveness in task scheduling, among which the relatively recent Willow Catkin Optimization (WCO) algorithm has demonstrated potential, albeit with apparent needs for enhanced global search capability and convergence speed. To address these limitations of WCO in cloud computing task scheduling, this paper introduces an improved version termed the Advanced Willow Catkin Optimization (AWCO) algorithm. AWCO enhances the algorithm’s performance by augmenting its global search capability through a quasi-opposition-based learning strategy and accelerating its convergence speed via sinusoidal mapping. A comprehensive evaluation utilizing the CEC2014 benchmark suite, comprising 30 test functions, demonstrates that AWCO achieves superior optimization outcomes, surpassing conventional WCO and a range of established meta-heuristics. The proposed algorithm also considers trade-offs among the cost, makespan, and load balancing objectives. Experimental results of AWCO are compared with those obtained using the other meta-heuristics, illustrating that the proposed algorithm provides superior performance in task scheduling. The method offers a robust foundation for enhancing the utilization of cloud computing resources in the domain of task scheduling within a cloud computing environment. 展开更多
关键词 Willow catkin optimization algorithm cloud computing task scheduling opposition-based learning strategy
暂未订购 下载PDF
A Shufled Frog-Leaping Algorithm with Competition for Parallel Batch Processing Machines Scheduling in Fabric Dyeing Process 认领 引用 被引量：1
15
作者 Mingbo Li Deming Lei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第5期1789-1808,共20页
As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that a... As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that at least one machine is not eligible for at least one job.PBPMSP and scheduling problems with machine eligibility are frequently considered;however,PBPMSP with machine eligibility is seldom explored.This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition(CSFLA)to minimize makespan.In CSFLA,the initial population is produced in a heuristic and random way,and the competitive search of memeplexes comprises two phases.Competition between any two memeplexes is done in the first phase,then iteration times are adjusted based on competition,and search strategies are adjusted adaptively based on the evolution quality of memeplexes in the second phase.An adaptive population shuffling is given.Computational experiments are conducted on 100 instances.The computational results showed that the new strategies of CSFLA are effective and that CSFLA has promising advantages in solving the considered PBPMSP. 展开更多
关键词 Batch processing machines shuffled frog-leaping algorithm competition parallel machines scheduling
暂未订购 下载PDF
An Adaptive Genetic Algorithm for Multiprocessor Real-time Task Scheduling 认领 引用
16
作者 李亚军 杨宇航 《Journal of Donghua University(English Edition)》 EI CAS 2009年第2期111-118,共8页
Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we re... Real-time task scheduling is of primary significance in multiprocessor systems.Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems.In this paper,we represent those two goals as the minimization of the average response time and the average task laxity.To achieve this,we propose a genetic-based algorithm with problem-specific and efficient genetic operators.Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency.The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively. 展开更多
关键词 scheduling genetic algorithm real-time deadline
暂未订购 下载PDF
Multi-strategy Enhanced Hiking Optimization Algorithm for Task Scheduling in the Cloud Environment 认领 引用
17
作者 Libang Wu Shaobo Li +2 位作者 Fengbin Wu Rongxiang Xie Panliang Yuan 《Journal of Bionic Engineering》 SCIE EI CSCD 2025年第3期1506-1534,共29页
Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been prop... Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been proposed. The Hiking Optimization Algorithm (HOA) have been used in multiple fields. However, HOA suffers from local optimization, slow convergence, and low efficiency of late iteration search when solving cloud task scheduling problems. Thus, this paper proposes an improved HOA called CMOHOA. It collaborates with multi-strategy to improve HOA. Specifically, Chebyshev chaos is introduced to increase population diversity. Then, a hybrid speed update strategy is designed to enhance convergence speed. Meanwhile, an adversarial learning strategy is introduced to enhance the search capability in the late iteration. Different scenarios of scheduling problems are used to test the CMOHOA’s performance. First, CMOHOA was used to solve basic cloud computing task scheduling problems, and the results showed that it reduced the average total cost by 10% or more. Secondly, CMOHOA has been applied to edge fog cloud scheduling problems, and the results show that it reduces the average total scheduling cost by 2% or more. Finally, CMOHOA reduced the average total cost by 7% or more in scheduling problems for information transmission. 展开更多
关键词 Task scheduling Chebyshev chaos Hybrid speed update strategy Metaheuristic algorithms The Hiking Optimization Algorithm(HOA)
An Adaptive Firefly Algorithm for Dependent Task Scheduling in IoT-Fog Computing 认领 引用
18
作者 Adil Yousif 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第3期2869-2892,共24页
The Internet of Things(IoT)has emerged as an important future technology.IoT-Fog is a new computing paradigm that processes IoT data on servers close to the source of the data.In IoT-Fog computing,resource allocation ... The Internet of Things(IoT)has emerged as an important future technology.IoT-Fog is a new computing paradigm that processes IoT data on servers close to the source of the data.In IoT-Fog computing,resource allocation and independent task scheduling aim to deliver short response time services demanded by the IoT devices and performed by fog servers.The heterogeneity of the IoT-Fog resources and the huge amount of data that needs to be processed by the IoT-Fog tasks make scheduling fog computing tasks a challenging problem.This study proposes an Adaptive Firefly Algorithm(AFA)for dependent task scheduling in IoT-Fog computing.The proposed AFA is a modified version of the standard Firefly Algorithm(FA),considering the execution times of the submitted tasks,the impact of synchronization requirements,and the communication time between dependent tasks.As IoT-Fog computing depends mainly on distributed fog node servers that receive tasks in a dynamic manner,tackling the communications and synchronization issues between dependent tasks is becoming a challenging problem.The proposed AFA aims to address the dynamic nature of IoT-Fog computing environments.The proposed AFA mechanism considers a dynamic light absorption coefficient to control the decrease in attractiveness over iterations.The proposed AFA mechanism performance was benchmarked against the standard Firefly Algorithm(FA),Puma Optimizer(PO),Genetic Algorithm(GA),and Ant Colony Optimization(ACO)through simulations under light,typical,and heavy workload scenarios.In heavy workloads,the proposed AFA mechanism obtained the shortest average execution time,968.98 ms compared to 970.96,1352.87,1247.28,and 1773.62 of FA,PO,GA,and ACO,respectively.The simulation results demonstrate the proposed AFA’s ability to rapidly converge to optimal solutions,emphasizing its adaptability and efficiency in typical and heavy workloads. 展开更多
关键词 Fog computing scheduling resource management firefly algorithm genetic algorithm ant colony optimization
暂未订购 下载PDF
A Resilient BIRCH-Based Smart Framework for Real-Time IoT Data Clustering 认领 引用
19
作者 Prabhat Das Dibya Jyoti Bora +2 位作者 Sajal Saha Cheng-Chi Lee Hirak Mazumdar 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第4期864-898,共35页
Real-time data processing is essential in the evolving landscape of IoT applications,ensuring efficiency,reliability,and adaptability.However,conventional clustering algorithms often face difficulties in managing high... Real-time data processing is essential in the evolving landscape of IoT applications,ensuring efficiency,reliability,and adaptability.However,conventional clustering algorithms often face difficulties in managing highfrequency,continuous IoT data streams due to limited adaptability and high computational overhead.To address these challenges,this study proposes a resilient adaptation of the BIRCH(Balanced Iterative Reducing and Clustering using Hierarchies)algorithm,tailored specifically for streaming IoT data.The enhanced approach dynamically recalculates clusters and determines the optimal number of clusters using the KneeLocator method.Unlike the original batchoriented BIRCH,the modified version processes data incrementally,enabling continuous adaptation to changing data distributions.The proposed method was validated on benchmark IoT datasets and compared against K-Means,DBSCAN,standard BIRCH,and other state-of-the-art streaming-based clustering algorithms.Results consistently show that the modified BIRCH outperforms existing approaches in execution speed,memory efficiency,scalability,and clustering accuracy.In addition,the algorithm has been deployed within a web-based application featuring interactive visualization and anomaly detection,highlighting its practical relevance for smart city and industrial IoT scenarios.To promote reproducibility and future research,the complete framework and source code have been made publicly available. 展开更多
关键词 IoT applications clustering algorithms smart city applications real-time data processing industrial IoT real-time clustering
暂未订购 下载PDF
Modeling and Optimization of Diffusion Process Scheduling under Strict Queue Time Constraints in Semiconductor Manufacturing 认领 引用
20
作者 Liangchao Chen Yan Qiao +3 位作者 Siwei Zhang Bin Liu Yonghua Shao Sijun Zhan 《Computer Modeling in Engineering & Sciences》 SCIE EI 2026年第4期488-519,共32页
This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing.The diffusion area comprises multiple tool groups.Each of them contains non-identical semiconductor tools.All tools can ... This article examines wafer lots scheduling in the diffusion area in semiconductor manufacturing.The diffusion area comprises multiple tool groups.Each of them contains non-identical semiconductor tools.All tools can process multiple wafer lots simultaneously,and wafer lots processed together in a tool are called a wafer batch.Besides,each wafer lot has specific queue time limits(QTLs)between consecutive processing operations,making the scheduling problem more complicated.To solve it,a discrete backtracking search optimization algorithm(DBSA)is designed for optimizing both wafer lot assignments and wafer batch processing sequences.Once the processing sequence of wafer batches at each tool is determined,a linear program(LP)is built to obtain optimal starting and completion time points of wafer batches while satisfying QTLs.If a schedule is examined to have no feasible solution by the LP,a proposed approach is used to regroup wafer lots to form wafer batches and adjust their processing sequences to potentially make it feasible.Extensive experiments show that DBSA reliably produces feasible schedules and outperforms GA,MixPSO,and GWO,with up to 17.75%,19.19%,and 9.21%reductions in average cycle time,respectively,demonstrating its superiority in both solution quality and practical applicability. 展开更多
关键词 Metaheuristic algorithms queue time limits scheduling semiconductor manufacturing
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 250 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈