Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-014-9898-0 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-014-9898-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093510225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of the \((1+1)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drift analysis and average time complexity of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing single source shortest paths using single-objective fitness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large population size can be unhelpful in evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation ability of evolutionary optimization with application to minimum set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of scheduling: a survey of milestones / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved 0/1-interchange scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of Local Search for Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical aspects of local search. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-014-9898-0 / rank
 
Normal rank

Latest revision as of 19:24, 9 December 2024

scientific article
Language Label Description Also known as
English
Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
scientific article

    Statements

    Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 September 2015
    0 references
    evolutionary algorithms
    0 references
    scheduling problem
    0 references
    local search algorithms
    0 references
    approximation algorithms
    0 references
    analysis of algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references