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.展开更多
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.展开更多
Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN). Based on the research of Proportio...Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN). Based on the research of Proportional Fairness (PF) algorithm and Modified Largest Weighted Delay First (M-LWDF) algorithm, a new packet scheduling algorithm for real-time services in broadband WMAN, called Enhanced M-LWDF (EM-LWDF), was proposed. The algorithm phases in new information to measure the load of service queues and updates the state parameters in real-time way, which remarkably improves system performance.Simulation results show that comparing with M-LWDF algorithm, the proposed algorithm is advantageous in performances of queuing delay and fairness while guaranteeing system throughput.展开更多
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.展开更多
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.展开更多
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
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.展开更多
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.展开更多
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.展开更多
A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose c...A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose challenges to devising a rational scheduling plan.Therefore,considering the practical production constraints,this paper investigates a cold rolling scheduling problem for processing jobs with specific due dates and batch attributions on parallel heterogeneous machines with continuous production requirements.Firstly,the scheduling problem is formulated as a mixed integer linear program(MILP)model with an economic objective.Then,a modified genetic algorithm(GA)is proposed to search for the optimal solution to the MILP problem.Specifically,this method includes a heuristic initialization mechanism to generate feasible initial solutions,three heuristic mutation operators to generate promising candidate solutions,and a parallel computing mechanism to accelerate the evaluation process of the GA.The simulation results demonstrate that the proposed method can be effectively implemented to generate optimized scheduling schemes in the cold rolling process.展开更多
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.展开更多
The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on th...The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP.展开更多
With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research s...With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research studies a distributed flexible job shop scheduling problem with assembly operations.Firstly,a mixed integer programming model is formulated to minimize the maximum completion time.Secondly,a Q-learning-assisted coevolutionary algorithmis presented to solve themodel:(1)Multiple populations are developed to seek required decisions simultaneously;(2)An encoding and decoding method based on problem features is applied to represent individuals;(3)A hybrid approach of heuristic rules and random methods is employed to acquire a high-quality population;(4)Three evolutionary strategies having crossover and mutation methods are adopted to enhance exploration capabilities;(5)Three neighborhood structures based on problem features are constructed,and a Q-learning-based iterative local search method is devised to improve exploitation abilities.The Q-learning approach is applied to intelligently select better neighborhood structures.Finally,a group of instances is constructed to perform comparison experiments.The effectiveness of the Q-learning approach is verified by comparing the developed algorithm with its variant without the Q-learning method.Three renowned meta-heuristic algorithms are used in comparison with the developed algorithm.The comparison results demonstrate that the designed method exhibits better performance in coping with the formulated problem.展开更多
Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device ...Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device energy utilization.To tackle these challenges,this study proposes an optimal scheduling model for energy storage power plants based on edge computing and the improved whale optimization algorithm(IWOA).The proposed model designs an edge computing framework,transferring a large share of data processing and storage tasks to the network edge.This architecture effectively reduces transmission costs by minimizing data travel time.In addition,the model considers demand response strategies and builds an objective function based on the minimization of the sum of electricity purchase cost and operation cost.The IWOA enhances the optimization process by utilizing adaptive weight adjustments and an optimal neighborhood perturbation strategy,preventing the algorithm from converging to suboptimal solutions.Experimental results demonstrate that the proposed scheduling model maximizes the flexibility of the energy storage plant,facilitating efficient charging and discharging.It successfully achieves peak shaving and valley filling for both electrical and heat loads,promoting the effective utilization of renewable energy sources.The edge-computing framework significantly reduces transmission delays between energy devices.Furthermore,IWOA outperforms traditional algorithms in optimizing the objective function.展开更多
Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing ...Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility.展开更多
To improve the traffic scheduling capability in operator data center networks,an analysis prediction and online scheduling mechanism(APOS)is designed,considering both the network structure and the network traffic in t...To improve the traffic scheduling capability in operator data center networks,an analysis prediction and online scheduling mechanism(APOS)is designed,considering both the network structure and the network traffic in the operator data center.Fibonacci tree optimization algorithm(FTO)is embedded into the analysis prediction and the online scheduling stages,the FTO traffic scheduling strategy is proposed.By taking the global optimal and the multi-modal optimization advantage of FTO,the traffic scheduling optimal solution and many suboptimal solutions can be obtained.The experiment results show that the FTO traffic scheduling strategy can schedule traffic in data center networks reasonably,and improve the load balancing in the operator data center network effectively.展开更多
Real-time scheduling as an on-line optimization process must output dispatch results in real time. However, the calculation time required and the economy have a trade-off relationship. In response to a real-time sched...Real-time scheduling as an on-line optimization process must output dispatch results in real time. However, the calculation time required and the economy have a trade-off relationship. In response to a real-time scheduling problem, this paper proposes a real-time scheduling strategy considering the operation interval division of distributed generators(DGs) and batteries in the microgrid. Rolling scheduling models, including day-ahead scheduling and hours-ahead scheduling, are established, where the latter considers the future state-of-charge deviations. For the real-time scheduling, the output powers of the DGs are divided into two intervals based on the ability to track the day-ahead and hours-ahead schedules. The day-ahead and hours-ahead scheduling ensure the economy, whereas the real-time scheduling overcomes the timeconsumption problem. Finally, a grid-connected microgrid example is studied, and the simulation results demonstrate the effectiveness of the proposed strategy in terms of economic and real-time requirements.展开更多
Based on the analysis of collective activities of ant colonies, the typicalexample of swarm intelligence, a new approach to construct swarm intelligence basedmulti-agent-system (SMAS) for dynamic real-time scheduling ...Based on the analysis of collective activities of ant colonies, the typicalexample of swarm intelligence, a new approach to construct swarm intelligence basedmulti-agent-system (SMAS) for dynamic real-time scheduling for semiconductor wafer fab is proposed.The relevant algorithm, pheromone-based dynamic real-time scheduling algorithm (PBDR), is given.MIMAC test bed data set mini-fab is used to compare PBDR with FIFO (first in first out),SRPT(shortest remaining processing time) and CR(critical ratio) under three different release rules,i.e. deterministic rule, Poisson rule and CONWIP (constant WIP). It is shown that PBDR is prior toFIFO, SRPT and CR with better performance of cycle time, throughput, and on-time delivery,especially for on-time delivery performance.展开更多
A dynamic database based dynamic scheduling system is proposed.As the schedule is being preformed, the scheduling task data in the dynamic database is updated timely.Genetic algorithm (GA) is employed for generating o...A dynamic database based dynamic scheduling system is proposed.As the schedule is being preformed, the scheduling task data in the dynamic database is updated timely.Genetic algorithm (GA) is employed for generating optimised production plan quickly and easily in response to changes on the shop floor. The current status of the shop is considered while rescheduling, and new plan is used in conjunction with the existing schedule to improve the effeciency of flexble manufacturing systems. Simulation results demonstrate the effectiveness of the proposed system.展开更多
基金The Natural Science Foundation of Jiangsu Province(NoBK2005408)
文摘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.
文摘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.
基金This work was funded by the National High Technology Research and Development Program ("863" Program) of China under Grant No.2007AA01Z289
文摘Packet scheduling algorithm is the key technology to guarantee Quality of Service (QoS) and balance the fairness between users in broadband Wireless Metropolitan Area Network (WMAN). Based on the research of Proportional Fairness (PF) algorithm and Modified Largest Weighted Delay First (M-LWDF) algorithm, a new packet scheduling algorithm for real-time services in broadband WMAN, called Enhanced M-LWDF (EM-LWDF), was proposed. The algorithm phases in new information to measure the load of service queues and updates the state parameters in real-time way, which remarkably improves system performance.Simulation results show that comparing with M-LWDF algorithm, the proposed algorithm is advantageous in performances of queuing delay and fairness while guaranteeing system throughput.
基金Supported by the National High Technology Research and Development Program of China (863 Program) (2002AA1Z1490)the Spe-cialized Research Fund for the Doctoral Program of Higher Education of China (20040486049)
文摘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.
文摘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.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
基金the Deanship of Graduate Studies and Scientific Research at Najran University for funding this work under the Easy Funding Program grant code(NU/EFP/SERC/13/166).
文摘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.
基金supported by the National Natural Science Foundation of China (52275480)the Guizhou Provincial Science and Technology Program of Qiankehe Zhongdi Guiding ([2023]02)+1 种基金the Guizhou Provincial Science and Technology Program of Qiankehe Platform Talent Project (GCC[2023]001)the Guizhou Provincial Science and Technology Project of Qiankehe Platform Project (KXJZ[2024]002).
文摘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.
基金supported by the National Natural Science Foundation of China(Grant Number 61573264).
文摘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.
基金Supported by National Natural Science Foundation of China(Grant No.62273362)National Key Research and Development Program of China(Grant No.2024YFB3312100)。
文摘A well-designed production schedule for cold rolling can enhance steel enterprises'operational efficiency and profitability.Nevertheless,the intricate constraints and numerous steps involved in cold rolling pose challenges to devising a rational scheduling plan.Therefore,considering the practical production constraints,this paper investigates a cold rolling scheduling problem for processing jobs with specific due dates and batch attributions on parallel heterogeneous machines with continuous production requirements.Firstly,the scheduling problem is formulated as a mixed integer linear program(MILP)model with an economic objective.Then,a modified genetic algorithm(GA)is proposed to search for the optimal solution to the MILP problem.Specifically,this method includes a heuristic initialization mechanism to generate feasible initial solutions,three heuristic mutation operators to generate promising candidate solutions,and a parallel computing mechanism to accelerate the evaluation process of the GA.The simulation results demonstrate that the proposed method can be effectively implemented to generate optimized scheduling schemes in the cold rolling process.
文摘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.
基金supported in part by the National Natural Science Foundation of China under Grant No.52175490.
文摘The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP.
文摘With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research studies a distributed flexible job shop scheduling problem with assembly operations.Firstly,a mixed integer programming model is formulated to minimize the maximum completion time.Secondly,a Q-learning-assisted coevolutionary algorithmis presented to solve themodel:(1)Multiple populations are developed to seek required decisions simultaneously;(2)An encoding and decoding method based on problem features is applied to represent individuals;(3)A hybrid approach of heuristic rules and random methods is employed to acquire a high-quality population;(4)Three evolutionary strategies having crossover and mutation methods are adopted to enhance exploration capabilities;(5)Three neighborhood structures based on problem features are constructed,and a Q-learning-based iterative local search method is devised to improve exploitation abilities.The Q-learning approach is applied to intelligently select better neighborhood structures.Finally,a group of instances is constructed to perform comparison experiments.The effectiveness of the Q-learning approach is verified by comparing the developed algorithm with its variant without the Q-learning method.Three renowned meta-heuristic algorithms are used in comparison with the developed algorithm.The comparison results demonstrate that the designed method exhibits better performance in coping with the formulated problem.
基金supported by the Changzhou Science and Technology Support Project(CE20235045)Open Subject of Jiangsu Province Key Laboratory of Power Transmission and Distribution(2021JSSPD12)+1 种基金Talent Projects of Jiangsu University of Technology(KYY20018)Postgraduate Research&Practice Innovation Program of Jiangsu Province(SJCX23_1633).
文摘Energy storage power plants are critical in balancing power supply and demand.However,the scheduling of these plants faces significant challenges,including high network transmission costs and inefficient inter-device energy utilization.To tackle these challenges,this study proposes an optimal scheduling model for energy storage power plants based on edge computing and the improved whale optimization algorithm(IWOA).The proposed model designs an edge computing framework,transferring a large share of data processing and storage tasks to the network edge.This architecture effectively reduces transmission costs by minimizing data travel time.In addition,the model considers demand response strategies and builds an objective function based on the minimization of the sum of electricity purchase cost and operation cost.The IWOA enhances the optimization process by utilizing adaptive weight adjustments and an optimal neighborhood perturbation strategy,preventing the algorithm from converging to suboptimal solutions.Experimental results demonstrate that the proposed scheduling model maximizes the flexibility of the energy storage plant,facilitating efficient charging and discharging.It successfully achieves peak shaving and valley filling for both electrical and heat loads,promoting the effective utilization of renewable energy sources.The edge-computing framework significantly reduces transmission delays between energy devices.Furthermore,IWOA outperforms traditional algorithms in optimizing the objective function.
文摘Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility.
基金supported by National Natural Science Foundation of China(No.62163036).
文摘To improve the traffic scheduling capability in operator data center networks,an analysis prediction and online scheduling mechanism(APOS)is designed,considering both the network structure and the network traffic in the operator data center.Fibonacci tree optimization algorithm(FTO)is embedded into the analysis prediction and the online scheduling stages,the FTO traffic scheduling strategy is proposed.By taking the global optimal and the multi-modal optimization advantage of FTO,the traffic scheduling optimal solution and many suboptimal solutions can be obtained.The experiment results show that the FTO traffic scheduling strategy can schedule traffic in data center networks reasonably,and improve the load balancing in the operator data center network effectively.
基金supported by the National Key R&D Program of China (2018YFA0702200)the Fundamental Research Funds of Shandong University。
文摘Real-time scheduling as an on-line optimization process must output dispatch results in real time. However, the calculation time required and the economy have a trade-off relationship. In response to a real-time scheduling problem, this paper proposes a real-time scheduling strategy considering the operation interval division of distributed generators(DGs) and batteries in the microgrid. Rolling scheduling models, including day-ahead scheduling and hours-ahead scheduling, are established, where the latter considers the future state-of-charge deviations. For the real-time scheduling, the output powers of the DGs are divided into two intervals based on the ability to track the day-ahead and hours-ahead schedules. The day-ahead and hours-ahead scheduling ensure the economy, whereas the real-time scheduling overcomes the timeconsumption problem. Finally, a grid-connected microgrid example is studied, and the simulation results demonstrate the effectiveness of the proposed strategy in terms of economic and real-time requirements.
基金This project is supported by National 973 Project of China (No.2002-CB312202) National Natural Science Foundation of China (No.60374005, No.60104004) Chinese Postdoctoral Fellowship Foundation.
文摘Based on the analysis of collective activities of ant colonies, the typicalexample of swarm intelligence, a new approach to construct swarm intelligence basedmulti-agent-system (SMAS) for dynamic real-time scheduling for semiconductor wafer fab is proposed.The relevant algorithm, pheromone-based dynamic real-time scheduling algorithm (PBDR), is given.MIMAC test bed data set mini-fab is used to compare PBDR with FIFO (first in first out),SRPT(shortest remaining processing time) and CR(critical ratio) under three different release rules,i.e. deterministic rule, Poisson rule and CONWIP (constant WIP). It is shown that PBDR is prior toFIFO, SRPT and CR with better performance of cycle time, throughput, and on-time delivery,especially for on-time delivery performance.
基金This project is supported by National Natural ScienceFoundation of China (No.70071017,59889505)
文摘A dynamic database based dynamic scheduling system is proposed.As the schedule is being preformed, the scheduling task data in the dynamic database is updated timely.Genetic algorithm (GA) is employed for generating optimised production plan quickly and easily in response to changes on the shop floor. The current status of the shop is considered while rescheduling, and new plan is used in conjunction with the existing schedule to improve the effeciency of flexble manufacturing systems. Simulation results demonstrate the effectiveness of the proposed system.
