The algorithms improve the known results for 3 or more processor cases in the literature.杨启帆谈之奕姚恩瑜何勇浙江大学学报:自然科学英文版He, Y., Yang, Q. F., Tan, Z. Y., Yao, E. Y.: Algorithms for semi on-line multiprocessor scheduling problem. Journal of Zhejiang University SCIENCE ...
2430.Maximum-Deletions-on-a-String (M+) 2464.Minimum-Subarrays-in-a-Valid-Split (M) 2522.Partition-String-Into-Substrings-With-Values-at-Most-K (M+) 3202.Find-the-Maximum-Length-of-Valid-Subsequence-II (M) Interval 1235.Maximum-Profit-in-Job-Scheduling (H-) 1751.Maximum-Number-of-...
Then various Grid scheduling algorithms are discussed from different points of view, such as static vs. dynamic policies, objective functions, applications models, adaptation, QoS constraints, strategies dealing with dynamic behavior of resources, and so on. Based on a comprehensive understanding of ...
Stochastic scheduling problems are difficult stochastic control problems with combinatorial decision spaces. We focus on a class of stochastic scheduling p... DP Bertsekas,Castanon, D. A - IEEE Conference on Decision & Control 被引量: 468发表: 1999年 Approximation Algorithms for 2-Stage Stochastic...
Data Structures & Algorithms for Coding Interview If you appreciate my work, please 🌟 this repository. It motivates me. 🚀🚀In this repository, I have stored solutions to various problems and concepts of Data Structures and Algorithms in Python3 in a structured manner.✨✔...
We prove lower bounds on the competitive ratio of randomized algorithms for several on-line scheduling problems. The main result is a bound of e/(e1) for the on-line problem with objective minimizing the sum of completion times of jobs that arrive over time at their release times and are ...
They have also presented two algorithms, each consisting of three modules, i.e., selecting a process plan combination, computing the lower bound on makespan, and scheduling. While the scheduling module of the first algorithm depends on the developed MILP model, that of the second algorithm ...
During the last years we have worked on the design of approximation algorithms with a smaller approximation ratio and on the design of efficient polynomial time approximation schemes with a faster running time. We presented approximation algorithms with a smaller ratio for scheduling with fixed jobs ...
existing DE algorithms can be divided into single-strategy DE variants and multi-strategy DE variants. Single-strategy DE has only one mutation strategy to produce offspring. This type of approach relies heavily on improved mutation strategies or other auxiliary techniques. For example, Zhang et al...
Tanha, M., Hosseini Shirvani, M.S., Rahmani, A.M.: A hybrid meta-heuristic task scheduling algorithm based on genetic and thermodynamic simulated annealing algorithms in cloud computing environments. Neural Comput. Appl. 33, 16951–16984 (2021). https://doi.org/10.1007/s00521-021-06289-9 ...