Papers
Topics
Authors
Recent
Search
2000 character limit reached

Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem

Published 22 Dec 2022 in cs.NE | (2212.11478v3)

Abstract: The Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing times to two identical machines such that the makespan is minimized. However, in real life scenarios, the actual processing time of each job may be stochastic around the expected value with a variance, under the influence of external factors, and the actual processing times of these jobs may be correlated with covariances. Thus within this paper, we propose a chance-constrained version of the Makespan Scheduling problem and investigate the theoretical performance of the classical Randomized Local Search and (1+1) EA for it. More specifically, we first study two variants of the Chance-constrained Makespan Scheduling problem and their computational complexities, then separately analyze the expected runtime of the two algorithms to obtain an optimal solution or almost optimal solution to the instances of the two variants. In addition, we investigate the experimental performance of the two algorithms for the two variants.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (53)
  1. Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI), pages 307–314.
  2. Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5(1):11–24.
  3. Chance-constrained programming. Management science, 6(1):73–79.
  4. The generalized minimum spanning tree problem: A parameterized complexity analysis of bi-level optimisation. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 519–526. ACM.
  5. Optimization of chance-constrained submodular functions. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 34, pages 1460–1467. ACM.
  6. Fast genetic algorithms. In Proceedings of the genetic and evolutionary computation conference, pages 777–784.
  7. Analyses of simple hybrid algorithms for the vertex cover problem. Evolutionary Computation, 17(1):3–19.
  8. Approximating covering problems by randomized search heuristics using multi-objective models. Evolutionary Computation, 18(4):617–633.
  9. Analysis of the (1+1) EA on subclasses of linear functions under uniform and linear constraints. Theoretical Computer Science, 832:3–19.
  10. Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell system technical journal, 45(9):1563–1581.
  11. Gunia, C. (2005). On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 571–578. ACM.
  12. Hayes, B. (2002). Computing science: The easiest hard problem. American Scientist, 90(2):113–117.
  13. A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pages 141–148. IEEE.
  14. Analysis of solution quality of a multiobjective optimization-based evolutionary algorithm for knapsack problem. In Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP), pages 74–85. Springer.
  15. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3:21–35.
  16. Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM (JACM), 34(1):144–162.
  17. A genetic algorithm for chance constrained programming. Journal of Information and Optimization Sciences, 17(2):409–422.
  18. Approximating vertex cover using edge-based representations. In Proceedings of the Workshop on Foundations of Genetic Algorithms (FOGA), pages 87–96. ACM.
  19. Fixed parameter evolutionary algorithms and maximum leaf spanning trees: A matter of mutation. In Proceedings of the Conference on Parallel Problem Solving from Nature (PPSN), pages 204–213. Springer.
  20. Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica, 65(4):754–771.
  21. Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems. In Proceedings of the Workshop on Foundations of Genetic Algorithms (FOGA), pages 112–131. ACM.
  22. A runtime analysis of parallel evolutionary algorithms in dynamic optimization. Algorithmica, 78(2):641–659.
  23. Chance constrained programming with joint constraints. Operations Research, 13(6):930–945.
  24. Optimising monotone chance-constrained submodular functions using evolutionary multi-objective algorithms. In Proceedings of the 16th International Conference on Parallel Problem Solving from Nature (PPSN), pages 404–417. Springer.
  25. Evolutionary algorithms for limiting the effect of uncertainty for the knapsack problem with stochastic profits. In Proceedings of the Conference on Parallel Problem Solving from Nature (PPSN), pages 294–307. Springer.
  26. Analysis of evolutionary algorithms in dynamic and stochastic environments, pages 323–357. Springer International Publishing, Cham.
  27. Runtime analysis of evolutionary algorithms for the knapsack problem with favorably correlated weights. In Proceedings of the Conference on Parallel Problem Solving from Nature (PPSN), pages 141–152. Springer.
  28. Runtime analysis of the (1+1) evolutionary algorithm for the chance-constrained knapsack problem. In Proceedings of the Workshop on on Foundations of Genetic Algorithms (FOGA), pages 147–153. ACM.
  29. Minimum spanning trees made easier via multi-objective optimization. Natural Computing, 5:305–319.
  30. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378(1):32–40.
  31. On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan scheduling. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pages 3742–3748. ACM.
  32. Numata, K. (1988). Approximate and exact algorithms for scheduling independent tasks on unrelated processors. Journal of the Operations Research Society of Japan, 31(1):61–81.
  33. Analysis of population-based evolutionary algorithms for the vertex cover problem. In Proceedings of the IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pages 1563–1570. IEEE.
  34. Analysis of the (1+1) EA for finding approximate solutions to vertex cover problems. IEEE Transactions on Evolutionary Computation, 13(5):1006–1029.
  35. Genetic algorithm based technique for solving chance constrained problems. European journal of operational research, 185(3):1128–1154.
  36. On the use of the dual formulation for minimum weighted vertex cover in evolutionary algorithms. In Proceedings of the Workshop on Foundations of Genetic Algorithms (FOGA), pages 37–44. ACM.
  37. Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 513–518. ACM.
  38. Parameterized analysis of multi-objective evolutionary algorithms and the weighted vertex cover problem. In Proceedings of the Conference on Parallel Problem Solving from Nature (PPSN), pages 729–739. Springer.
  39. On the performance of baseline evolutionary algorithms on the dynamic knapsack problem. In Proceedings of the Conference on Parallel Problem Solving from Nature (PPSN), pages 158–169. Springer.
  40. Pareto optimization for subset selection with dynamic cost constraints. Artificial Intelligence, 302:103597.
  41. Sahni, S. K. (1976). Algorithms for scheduling independent tasks. Journal of the ACM (JACM), 23(1):116–127.
  42. Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem. Algorithmica, 83(4):906–939.
  43. Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints. Algorithmica, 81(2):828–857.
  44. Runtime analysis of simple evolutionary algorithms for the chance-constrained makespan scheduling problem. In Proceedings of the Conference on Parallel Problem Solving from Nature (PPSN), pages 526–541. Springer.
  45. A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling. In Proceedings of the 12th International Conference on Parallel Problem Solving from Nature (PPSN), pages 52–61. Springer.
  46. Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 551–559. ACM.
  47. Witt, C. (2005). Worst-case and average-case approximations by simple randomized search heuristics. In Annual Symposium on Theoretical Aspects of Computer Science, pages 44–56. Springer.
  48. Witt, C. (2014). Revised analysis of the (1+1) EA for the minimum spanning tree problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 509–516. ACM.
  49. On the impact of the renting rate for the unconstrained nonlinear knapsack problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 413–419. ACM.
  50. Evolutionary algorithms for the chance-constrained knapsack problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 338–346. ACM.
  51. Specific single- and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 271–279. ACM.
  52. Runtime analysis of RLS and the (1+ 1) EA for the chance-constrained knapsack problem with correlated uniform weights. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pages 1187–1194. ACM.
  53. On the approximation ability of evolutionary optimization with application to minimum set cover. Artificial Intelligence, 180:20–33.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up