期刊文献+
共找到38,946篇文章
< 1 2 250 >
每页显示 20 50 100
MCWOA Scheduler:Modified Chimp-Whale Optimization Algorithm for Task Scheduling in Cloud Computing 被引量:1
1
作者 Chirag Chandrashekar Pradeep Krishnadoss +1 位作者 Vijayakumar Kedalu Poornachary Balasundaram Ananthakrishnan 《Computers, Materials & Continua》 SCIE EI 2024年第2期2593-2616,共24页
Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay ... Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay can hamper the performance of IoT-enabled cloud platforms.However,efficient task scheduling can lower the cloud infrastructure’s energy consumption,thus maximizing the service provider’s revenue by decreasing user job processing times.The proposed Modified Chimp-Whale Optimization Algorithm called Modified Chimp-Whale Optimization Algorithm(MCWOA),combines elements of the Chimp Optimization Algorithm(COA)and the Whale Optimization Algorithm(WOA).To enhance MCWOA’s identification precision,the Sobol sequence is used in the population initialization phase,ensuring an even distribution of the population across the solution space.Moreover,the traditional MCWOA’s local search capabilities are augmented by incorporating the whale optimization algorithm’s bubble-net hunting and random search mechanisms into MCWOA’s position-updating process.This study demonstrates the effectiveness of the proposed approach using a two-story rigid frame and a simply supported beam model.Simulated outcomes reveal that the new method outperforms the original MCWOA,especially in multi-damage detection scenarios.MCWOA excels in avoiding false positives and enhancing computational speed,making it an optimal choice for structural damage detection.The efficiency of the proposed MCWOA is assessed against metrics such as energy usage,computational expense,task duration,and delay.The simulated data indicates that the new MCWOA outpaces other methods across all metrics.The study also references the Whale Optimization Algorithm(WOA),Chimp Algorithm(CA),Ant Lion Optimizer(ALO),Genetic Algorithm(GA)and Grey Wolf Optimizer(GWO). 展开更多
关键词 Cloud computing schedulING chimp optimization algorithm whale optimization algorithm
下载PDF
Yield and Nutritive Values of Semi- and Non-Fall Dormant Alfalfa Cultivars under Late-Cutting Schedule in California’s Central Valley
2
作者 Sultan Begna Dan Putnam +2 位作者 Dong Wang Khaled Bali Longxi Yu 《American Journal of Plant Sciences》 CAS 2024年第10期858-876,共19页
California is one of the major alfalfa (Medicago sativa L) forage-producing states in the U.S, but its production area has decreased significantly in the last couple of decades. Selection of cultivars with high yield ... California is one of the major alfalfa (Medicago sativa L) forage-producing states in the U.S, but its production area has decreased significantly in the last couple of decades. Selection of cultivars with high yield and nutritive value under late-cutting schedule strategy may help identify cultivars that growers can use to maximize yield while maintaining area for sustainable alfalfa production, but there is little information on this strategy. A field study was conducted to determine cumulative dry matter (DM) and nutritive values of 20 semi- and non-fall dormant (FD) ratings (FD 7 and FD 8 - 10, respectively) cultivars under 35-day cut in California’s Central Valley in 2020-2022. Seasonal cumulative DM yields ranged from 6.8 in 2020 to 37.0 Mg·ha−1 in 2021. Four FD 8 - 9 cultivars were the highest yielding with 3-yrs avg. DM greater than the lowest yielding lines by 46%. FD 7 cultivar “715RR” produced the highest crude protein (CP: 240 g·Kg−1) while FD 8 cultivar “HVX840RR” resulted in the highest neutral detergent fiber digestibility (NDFD: 484 g·Kg−1, 7% greater than the top yielding cultivars) but with DM yield intermediate. Yields and NDFD correlated positively but weakly indicating some semi- and non-FD cultivars performing similarly. These results suggest that selecting high yielding cultivars under 35-day cutting schedule strategy can be used as a tool to help growers to maximize yield while achieving good quality forages for sustainable alfalfa production in California’s Central Valley. 展开更多
关键词 ALFALFA Maximizing Yield Nutritive Value CULTIVAR Cutting schedule Production Area California
下载PDF
基于NPV Scheduler软件的露天转地下矿山开采境界研究 被引量:3
3
作者 马宁 汪昌亮 丁鹏 《中国矿山工程》 2023年第2期21-25,共5页
基础的L-G图论法未考虑地下开采可能的成本优势,在露天转地下矿山开采境界圈定时存在一定的局限性。本文通过对价格法与储量盈利比较法计算的经济合理剥采比进行分析,结合NPV Scheduler软件研究了露天转地下开采境界圈定方法,并通过工... 基础的L-G图论法未考虑地下开采可能的成本优势,在露天转地下矿山开采境界圈定时存在一定的局限性。本文通过对价格法与储量盈利比较法计算的经济合理剥采比进行分析,结合NPV Scheduler软件研究了露天转地下开采境界圈定方法,并通过工程实例验证了该方法的合理性。研究成果对露天转地下矿山开采境界的确定具有一定的指导意义。 展开更多
关键词 露天转地下 NPV scheduler 经济合理剥采比 L-G图论法
下载PDF
基于Scheduled Sampling采样机制的人体行为预测
4
作者 杜薇 于雅楠 尹光华 《天津职业技术师范大学学报》 2023年第2期54-59,共6页
针对循环神经网络存在的预测误差累积问题,提出了融合Scheduled Sampling采样机制的序列预测算法。该算法选用较大概率p作为选择使用真实值或是前一帧预测数据作为当前时间步输入依据,并随着时间的推移p值逐渐变小,使解码器更倾向于使... 针对循环神经网络存在的预测误差累积问题,提出了融合Scheduled Sampling采样机制的序列预测算法。该算法选用较大概率p作为选择使用真实值或是前一帧预测数据作为当前时间步输入依据,并随着时间的推移p值逐渐变小,使解码器更倾向于使用预测序列作为输入,以此增加模型的健壮性。实验结果表明:该算法能够将Human3.6M数据集中绝大多数动作短期预测误差降低到0.5 dm左右,相比原方法降低了0.2~0.4 dm,在行为预测上表现良好。 展开更多
关键词 行为预测 循环神经网络 scheduled Sampling
下载PDF
Research on Evaluation of Multi-Timescale Flexibility and Energy Storage Deployment for the High-Penetration Renewable Energy of Power Systems
5
作者 Hongliang Wang Jiahua Hu +4 位作者 Danhuang Dong Cenfeng Wang Feixia Tang Yizheng Wang Changsen Feng 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第2期1137-1158,共22页
With the rapid and wide deployment of renewable energy,the operations of the power system are facing greater challenges when dispatching flexible resources to keep power balance.The output power of renewable energy is... With the rapid and wide deployment of renewable energy,the operations of the power system are facing greater challenges when dispatching flexible resources to keep power balance.The output power of renewable energy is uncertain,and thus flexible regulation for the power balance is highly demanded.Considering the multi-timescale output characteristics of renewable energy,a flexibility evaluation method based on multi-scale morphological decomposition and a multi-timescale energy storage deployment model based on bi-level decision-making are proposed in this paper.Through the multi-timescale decomposition algorithm on the basis of mathematical morphology,the multi-timescale components are separated to determine the flexibility requirements on different timescales.Based on the obtained flexibility requirements,a multi-timescale energy resources deployment model based on bi-level optimization is established considering the economic performance and the flexibility of system operation.This optimization model can allocate corresponding flexibility resources according to the economy,flexibility and reliability requirements of the power system,and achieve the trade-off between them.Finally,case studies demonstrate the effectiveness of our model and method. 展开更多
关键词 multi-timescale morphological decomposition flexibility evaluation energy storage deployment
下载PDF
A Modified Firefly Optimization Algorithm-Based Fuzzy Packet Scheduler for MANET
6
作者 Mercy Sharon Devadas N.Bhalaji Xiao-Zhi Gao 《Intelligent Automation & Soft Computing》 SCIE 2023年第6期2685-2702,共18页
In Mobile ad hoc Networks(MANETs),the packet scheduling process is considered the major challenge because of error-prone connectivity among mobile nodes that introduces intolerable delay and insufficient throughput wi... In Mobile ad hoc Networks(MANETs),the packet scheduling process is considered the major challenge because of error-prone connectivity among mobile nodes that introduces intolerable delay and insufficient throughput with high packet loss.In this paper,a Modified Firefly Optimization Algorithm improved Fuzzy Scheduler-based Packet Scheduling(MFPA-FSPS)Mechanism is proposed for sustaining Quality of Service(QoS)in the network.This MFPA-FSPS mechanism included a Fuzzy-based priority scheduler by inheriting the merits of the Sugeno Fuzzy inference system that potentially and adaptively estimated packets’priority for guaranteeing optimal network performance.It further used the modified Firefly Optimization Algorithm to optimize the rules uti-lized by the fuzzy inference engine to achieve the potential packet scheduling pro-cess.This adoption of a fuzzy inference engine used dynamic optimization that guaranteed excellent scheduling of the necessitated packets at an appropriate time with minimized waiting time.The statistical validation of the proposed MFPA-FSPS conducted using a one-way Analysis of Variance(ANOVA)test confirmed its predominance over the benchmarked schemes used for investigation. 展开更多
关键词 Packet scheduling firefly algorithm ad hoc networks fuzzy scheduler opnet simulator
下载PDF
Performance Improvement through Novel Adaptive Node and Container Aware Scheduler with Resource Availability Control in Hadoop YARN
7
作者 J.S.Manjaly T.Subbulakshmi 《Computer Systems Science & Engineering》 SCIE EI 2023年第12期3083-3108,共26页
The default scheduler of Apache Hadoop demonstrates operational inefficiencies when connecting external sources and processing transformation jobs.This paper has proposed a novel scheduler for enhancement of the perfo... The default scheduler of Apache Hadoop demonstrates operational inefficiencies when connecting external sources and processing transformation jobs.This paper has proposed a novel scheduler for enhancement of the performance of the Hadoop Yet Another Resource Negotiator(YARN)scheduler,called the Adaptive Node and Container Aware Scheduler(ANACRAC),that aligns cluster resources to the demands of the applications in the real world.The approach performs to leverage the user-provided configurations as a unique design to apportion nodes,or containers within the nodes,to application thresholds.Additionally,it provides the flexibility to the applications for selecting and choosing which node’s resources they want to manage and adds limits to prevent threshold breaches by adding additional jobs as needed.Node or container awareness can be utilized individually or in combination to increase efficiency.On top of this,the resource availability within the node and containers can also be investigated.This paper also focuses on the elasticity of the containers and self-adaptiveness depending on the job type.The results proved that 15%–20%performance improvement was achieved compared with the node and container awareness feature of the ANACRAC.It has been validated that this ANACRAC scheduler demonstrates a 70%–90%performance improvement compared with the default Fair scheduler.Experimental results also demonstrated the success of the enhancement and a performance improvement in the range of 60%to 200%when applications were connected with external interfaces and high workloads. 展开更多
关键词 Big data HADOOP YARN hadoop distributed file system(HDFS) MapReduce scheduling fair scheduler
下载PDF
Factors Determining the Postponement of Schedule Gyneaco-Obstetric Surgery at CHUMEFJE in Libreville (Gabon)
8
作者 Pamphile Assoumou Obiang Jacques Albert Bang Ntamack +7 位作者 Ophélia Makoyo Ulysse Minkobame Jean Pierre Malanda Anouchka Mewie Juvette Elsy Ntsame Robert Eya’ama Ernest Junior Minto’o Jean François Meye 《Open Journal of Obstetrics and Gynecology》 2023年第10期1699-1710,共12页
The study aimed to identify factors causing delays in scheduled gynaeco-obstetric surgeries at CHUMEFJE in Libreville from January 2019 to July 2020. Through a 16-month observational survey, it was found that out of 3... The study aimed to identify factors causing delays in scheduled gynaeco-obstetric surgeries at CHUMEFJE in Libreville from January 2019 to July 2020. Through a 16-month observational survey, it was found that out of 346 scheduled procedures, 128 (36.4%) were postponed. Organizational issues in the operating theatre were responsible for 80.3% of these delays, with 95.3% being preventable. To enhance efficiency, improvements in operating theatre organization are recommended. 展开更多
关键词 scheduled Gynaeco Obstetric Surgery POSTPONEMENT Determining Factors
下载PDF
DR-IS:Dynamic Response Incremental Scheduling in Time-Sensitive Network
9
作者 Pei Jinchuan Hu Yuxiang +1 位作者 Tian Le Li Ziyong 《China Communications》 SCIE CSCD 2024年第10期28-42,共15页
Time-Sensitive Network(TSN)with deterministic transmission capability is increasingly used in many emerging fields.It mainly guarantees the Quality of Service(QoS)of applications with strict requirements on time and s... Time-Sensitive Network(TSN)with deterministic transmission capability is increasingly used in many emerging fields.It mainly guarantees the Quality of Service(QoS)of applications with strict requirements on time and security.One of the core features of TSN is traffic scheduling with bounded low delay in the network.However,traffic scheduling schemes in TSN are usually synthesized offline and lack dynamism.To implement incremental scheduling of newly arrived traffic in TSN,we propose a Dynamic Response Incremental Scheduling(DR-IS)method for time-sensitive traffic and deploy it on a software-defined time-sensitive network architecture.Under the premise of meeting the traffic scheduling requirements,we adopt two modes,traffic shift and traffic exchange,to dynamically adjust the time slot injection position of the traffic in the original scheme,and determine the sending offset time of the new timesensitive traffic to minimize the global traffic transmission jitter.The evaluation results show that DRIS method can effectively control the large increase of traffic transmission jitter in incremental scheduling without affecting the transmission delay,thus realizing the dynamic incremental scheduling of time-sensitive traffic in TSN. 展开更多
关键词 incremental scheduling time-sensitive network traffic scheduling transmission jitter
下载PDF
采用NPV Scheduler软件对某大型露天矿山进行境界优化
10
作者 程志平 《采矿技术》 2023年第6期49-53,共5页
某大型矿床随着开采的进行以及补充勘探的深入,加上市场的变化,使得原来的境界设计条件发生了一些变化,因此需要根据最新的边界条件对境界进行优化设计。采用NPV Scheduler软件用L-G图论法对该铜矿的最终开采境界进行了优化圈定,使得最... 某大型矿床随着开采的进行以及补充勘探的深入,加上市场的变化,使得原来的境界设计条件发生了一些变化,因此需要根据最新的边界条件对境界进行优化设计。采用NPV Scheduler软件用L-G图论法对该铜矿的最终开采境界进行了优化圈定,使得最终境界更符合当前采选成本和市场条件。 展开更多
关键词 NPV scheduler 补充勘探 境界优化 L-G图论法 采选成本
下载PDF
Energy-Saving Distributed Flexible Job Shop Scheduling Optimization with Dual Resource Constraints Based on Integrated Q-Learning Multi-Objective Grey Wolf Optimizer
11
作者 Hongliang Zhang Yi Chen +1 位作者 Yuteng Zhang Gongjie Xu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第8期1459-1483,共25页
The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worke... The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality. 展开更多
关键词 Distributed flexible job shop scheduling problem dual resource constraints energy-saving scheduling multi-objective grey wolf optimizer Q-LEARNING
下载PDF
A Layered Energy-Efficient Multi-Node Scheduling Mechanism for Large-Scale WSN
12
作者 Xue Zhao Shaojun Tao +2 位作者 Hongying Tang Jiang Wang Baoqing Li 《Computers, Materials & Continua》 SCIE EI 2024年第4期1335-1351,共17页
In recent years, target tracking has been considered one of the most important applications of wireless sensornetwork (WSN). Optimizing target tracking performance and prolonging network lifetime are two equally criti... In recent years, target tracking has been considered one of the most important applications of wireless sensornetwork (WSN). Optimizing target tracking performance and prolonging network lifetime are two equally criticalobjectives in this scenario. The existing mechanisms still have weaknesses in balancing the two demands. Theproposed heuristic multi-node collaborative scheduling mechanism (HMNCS) comprises cluster head (CH)election, pre-selection, and task set selectionmechanisms, where the latter two kinds of selections forma two-layerselection mechanism. The CH election innovatively introduces the movement trend of the target and establishesa scoring mechanism to determine the optimal CH, which can delay the CH rotation and thus reduce energyconsumption. The pre-selection mechanism adaptively filters out suitable nodes as the candidate task set to applyfor tracking tasks, which can reduce the application consumption and the overhead of the following task setselection. Finally, the task node selection is mathematically transformed into an optimization problem and thegenetic algorithm is adopted to form a final task set in the task set selection mechanism. Simulation results showthat HMNCS outperforms other compared mechanisms in the tracking accuracy and the network lifetime. 展开更多
关键词 Node scheduling pre-selection target tracking WSN
下载PDF
A Novel Scheduling Framework for Multi-Programming Quantum Computing in Cloud Environment
13
作者 Danyang Zheng Jinchen Xv +3 位作者 Feng Yue Qiming Du ZhihengWang Zheng Shan 《Computers, Materials & Continua》 SCIE EI 2024年第5期1957-1974,共18页
As cloud quantum computing gains broader acceptance,a growing quantity of researchers are directing their focus towards this domain.Nevertheless,the rapid surge in demand for cloud-based quantum computing resources ha... As cloud quantum computing gains broader acceptance,a growing quantity of researchers are directing their focus towards this domain.Nevertheless,the rapid surge in demand for cloud-based quantum computing resources has led to a scarcity,which in turn hampers users from achieving optimal satisfaction.Therefore,cloud quantum computing service providers require a unified analysis and scheduling framework for their quantumresources and user jobs to meet the ever-growing usage demands.This paper introduces a new multi-programming scheduling framework for quantum computing in a cloud environment.The framework addresses the issue of limited quantum computing resources in cloud environments and ensures a satisfactory user experience.It introduces three innovative designs:1)Our framework automatically allocates tasks to different quantum backends while ensuring fairness among users by considering both the cloud-based quantum resources and the user-submitted tasks.2)Multi-programming mechanism is employed across different quantum backends to enhance the overall throughput of the quantum cloud.In comparison to conventional task schedulers,our proposed framework achieves a throughput improvement of more than two-fold in the quantum cloud.3)The framework can balance fidelity and user waiting time by adaptively adjusting scheduling parameters. 展开更多
关键词 Quantum computing schedulING multi-programming qubit mapping
下载PDF
Dynamic Offloading and Scheduling Strategy for Telematics Tasks Based on Latency Minimization
14
作者 Yu Zhou Yun Zhang +4 位作者 Guowei Li Hang Yang Wei Zhang Ting Lyu Yueqiang Xu 《Computers, Materials & Continua》 SCIE EI 2024年第8期1809-1829,共21页
In current research on task offloading and resource scheduling in vehicular networks,vehicles are commonly assumed to maintain constant speed or relatively stationary states,and the impact of speed variations on task ... In current research on task offloading and resource scheduling in vehicular networks,vehicles are commonly assumed to maintain constant speed or relatively stationary states,and the impact of speed variations on task offloading is often overlooked.It is frequently assumed that vehicles can be accurately modeled during actual motion processes.However,in vehicular dynamic environments,both the tasks generated by the vehicles and the vehicles’surroundings are constantly changing,making it difficult to achieve real-time modeling for actual dynamic vehicular network scenarios.Taking into account the actual dynamic vehicular scenarios,this paper considers the real-time non-uniform movement of vehicles and proposes a vehicular task dynamic offloading and scheduling algorithm for single-task multi-vehicle vehicular network scenarios,attempting to solve the dynamic decision-making problem in task offloading process.The optimization objective is to minimize the average task completion time,which is formulated as a multi-constrained non-linear programming problem.Due to the mobility of vehicles,a constraint model is applied in the decision-making process to dynamically determine whether the communication range is sufficient for task offloading and transmission.Finally,the proposed vehicular task dynamic offloading and scheduling algorithm based on muti-agent deep deterministic policy gradient(MADDPG)is applied to solve the optimal solution of the optimization problem.Simulation results show that the algorithm proposed in this paper is able to achieve lower latency task computation offloading.Meanwhile,the average task completion time of the proposed algorithm in this paper can be improved by 7.6%compared to the performance of the MADDPG scheme and 51.1%compared to the performance of deep deterministic policy gradient(DDPG). 展开更多
关键词 Component vehicular DYNAMIC task offloading resource scheduling
下载PDF
A Novel Predictive Model for Edge Computing Resource Scheduling Based on Deep Neural Network
15
作者 Ming Gao Weiwei Cai +3 位作者 Yizhang Jiang Wenjun Hu Jian Yao Pengjiang Qian 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第4期259-277,共19页
Currently,applications accessing remote computing resources through cloud data centers is the main mode of operation,but this mode of operation greatly increases communication latency and reduces overall quality of se... Currently,applications accessing remote computing resources through cloud data centers is the main mode of operation,but this mode of operation greatly increases communication latency and reduces overall quality of service(QoS)and quality of experience(QoE).Edge computing technology extends cloud service functionality to the edge of the mobile network,closer to the task execution end,and can effectivelymitigate the communication latency problem.However,the massive and heterogeneous nature of servers in edge computing systems brings new challenges to task scheduling and resource management,and the booming development of artificial neural networks provides us withmore powerfulmethods to alleviate this limitation.Therefore,in this paper,we proposed a time series forecasting model incorporating Conv1D,LSTM and GRU for edge computing device resource scheduling,trained and tested the forecasting model using a small self-built dataset,and achieved competitive experimental results. 展开更多
关键词 Edge computing resource scheduling predictive models
下载PDF
Performance Prediction Based Workload Scheduling in Co-Located Cluster
16
作者 Dongyang Ou Yongjian Ren Congfeng Jiang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第5期2043-2067,共25页
Cloud service providers generally co-locate online services and batch jobs onto the same computer cluster,where the resources can be pooled in order to maximize data center resource utilization.Due to resource competi... Cloud service providers generally co-locate online services and batch jobs onto the same computer cluster,where the resources can be pooled in order to maximize data center resource utilization.Due to resource competition between batch jobs and online services,co-location frequently impairs the performance of online services.This study presents a quality of service(QoS)prediction-based schedulingmodel(QPSM)for co-locatedworkloads.The performance prediction of QPSM consists of two parts:the prediction of an online service’s QoS anomaly based on XGBoost and the prediction of the completion time of an offline batch job based on randomforest.On-line service QoS anomaly prediction is used to evaluate the influence of batch jobmix on on-line service performance,and batch job completion time prediction is utilized to reduce the total waiting time of batch jobs.When the same number of batch jobs are scheduled in experiments using typical test sets such as CloudSuite,the scheduling time required by QPSM is reduced by about 6 h on average compared with the first-come,first-served strategy and by about 11 h compared with the random scheduling strategy.Compared with the non-co-located situation,QPSM can improve CPU resource utilization by 12.15% and memory resource utilization by 5.7% on average.Experiments show that the QPSM scheduling strategy proposed in this study can effectively guarantee the quality of online services and further improve cluster resource utilization. 展开更多
关键词 Co-located cluster workload scheduling online service batch jobs data center
下载PDF
Q-Learning-Assisted Meta-Heuristics for Scheduling Distributed Hybrid Flow Shop Problems
17
作者 Qianyao Zhu Kaizhou Gao +2 位作者 Wuze Huang Zhenfang Ma Adam Slowik 《Computers, Materials & Continua》 SCIE EI 2024年第9期3573-3589,共17页
The flow shop scheduling problem is important for the manufacturing industry.Effective flow shop scheduling can bring great benefits to the industry.However,there are few types of research on Distributed Hybrid Flow S... The flow shop scheduling problem is important for the manufacturing industry.Effective flow shop scheduling can bring great benefits to the industry.However,there are few types of research on Distributed Hybrid Flow Shop Problems(DHFSP)by learning assisted meta-heuristics.This work addresses a DHFSP with minimizing the maximum completion time(Makespan).First,a mathematical model is developed for the concerned DHFSP.Second,four Q-learning-assisted meta-heuristics,e.g.,genetic algorithm(GA),artificial bee colony algorithm(ABC),particle swarm optimization(PSO),and differential evolution(DE),are proposed.According to the nature of DHFSP,six local search operations are designed for finding high-quality solutions in local space.Instead of randomselection,Q-learning assists meta-heuristics in choosing the appropriate local search operations during iterations.Finally,based on 60 cases,comprehensive numerical experiments are conducted to assess the effectiveness of the proposed algorithms.The experimental results and discussions prove that using Q-learning to select appropriate local search operations is more effective than the random strategy.To verify the competitiveness of the Q-learning assistedmeta-heuristics,they are compared with the improved iterated greedy algorithm(IIG),which is also for solving DHFSP.The Friedman test is executed on the results by five algorithms.It is concluded that the performance of four Q-learning-assisted meta-heuristics are better than IIG,and the Q-learning-assisted PSO shows the best competitiveness. 展开更多
关键词 Distributed scheduling hybrid flow shop META-HEURISTICS local search Q-LEARNING
下载PDF
Improved STNModels and Heuristic Rules for Cooperative Scheduling in Automated Container Terminals
18
作者 Hongyan Xia Jin Zhu 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第2期1637-1661,共25页
Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the exis... Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average. 展开更多
关键词 Automated container terminal BUFFER cooperative scheduling heuristic rules space-time network
下载PDF
Joint computation offloading and parallel scheduling to maximize delay-guarantee in cooperative MEC systems
19
作者 Mian Guo Mithun Mukherjee +3 位作者 Jaime Lloret Lei Li Quansheng Guan Fei Ji 《Digital Communications and Networks》 SCIE CSCD 2024年第3期693-705,共13页
The growing development of the Internet of Things(IoT)is accelerating the emergence and growth of new IoT services and applications,which will result in massive amounts of data being generated,transmitted and pro-cess... The growing development of the Internet of Things(IoT)is accelerating the emergence and growth of new IoT services and applications,which will result in massive amounts of data being generated,transmitted and pro-cessed in wireless communication networks.Mobile Edge Computing(MEC)is a desired paradigm to timely process the data from IoT for value maximization.In MEC,a number of computing-capable devices are deployed at the network edge near data sources to support edge computing,such that the long network transmission delay in cloud computing paradigm could be avoided.Since an edge device might not always have sufficient resources to process the massive amount of data,computation offloading is significantly important considering the coop-eration among edge devices.However,the dynamic traffic characteristics and heterogeneous computing capa-bilities of edge devices challenge the offloading.In addition,different scheduling schemes might provide different computation delays to the offloaded tasks.Thus,offloading in mobile nodes and scheduling in the MEC server are coupled to determine service delay.This paper seeks to guarantee low delay for computation intensive applica-tions by jointly optimizing the offloading and scheduling in such an MEC system.We propose a Delay-Greedy Computation Offloading(DGCO)algorithm to make offloading decisions for new tasks in distributed computing-enabled mobile devices.A Reinforcement Learning-based Parallel Scheduling(RLPS)algorithm is further designed to schedule offloaded tasks in the multi-core MEC server.With an offloading delay broadcast mechanism,the DGCO and RLPS cooperate to achieve the goal of delay-guarantee-ratio maximization.Finally,the simulation results show that our proposal can bound the end-to-end delay of various tasks.Even under slightly heavy task load,the delay-guarantee-ratio given by DGCO-RLPS can still approximate 95%,while that given by benchmarked algorithms is reduced to intolerable value.The simulation results are demonstrated the effective-ness of DGCO-RLPS for delay guarantee in MEC. 展开更多
关键词 Edge computing Computation offloading Parallel scheduling Mobile-edge cooperation Delay guarantee
下载PDF
An Elite-Class Teaching-Learning-Based Optimization for Reentrant Hybrid Flow Shop Scheduling with Bottleneck Stage
20
作者 Deming Lei Surui Duan +1 位作者 Mingbo Li Jing Wang 《Computers, Materials & Continua》 SCIE EI 2024年第4期47-63,共17页
Bottleneck stage and reentrance often exist in real-life manufacturing processes;however,the previous research rarely addresses these two processing conditions in a scheduling problem.In this study,a reentrant hybrid ... Bottleneck stage and reentrance often exist in real-life manufacturing processes;however,the previous research rarely addresses these two processing conditions in a scheduling problem.In this study,a reentrant hybrid flow shop scheduling problem(RHFSP)with a bottleneck stage is considered,and an elite-class teaching-learning-based optimization(ETLBO)algorithm is proposed to minimize maximum completion time.To produce high-quality solutions,teachers are divided into formal ones and substitute ones,and multiple classes are formed.The teacher phase is composed of teacher competition and teacher teaching.The learner phase is replaced with a reinforcement search of the elite class.Adaptive adjustment on teachers and classes is established based on class quality,which is determined by the number of elite solutions in class.Numerous experimental results demonstrate the effectiveness of new strategies,and ETLBO has a significant advantage in solving the considered RHFSP. 展开更多
关键词 Hybrid flow shop scheduling REENTRANT bottleneck stage teaching-learning-based optimization
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部