These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

107 related articles for article (PubMed ID: 10021740)

  • 1. Genetic algorithms, path relinking, and the flowshop sequencing problem.
    Reeves CR; Yamada T
    Evol Comput; 1998; 6(1):45-60. PubMed ID: 10021740
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Genetic forma recombination in permutation flowshop problems.
    Cotta C; Troya JM
    Evol Comput; 1998; 6(1):25-44. PubMed ID: 10021739
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A PSO-based hybrid metaheuristic for permutation flowshop scheduling problems.
    Zhang L; Wu J
    ScientificWorldJournal; 2014; 2014():902950. PubMed ID: 24672389
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem.
    Peng C; Wu G; Liao TW; Wang H
    PLoS One; 2019; 14(9):e0223182. PubMed ID: 31560722
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Solving a real-world problem using an evolving heuristically driven schedule builder.
    Hart E; Ross P; Nelson J
    Evol Comput; 1998; 6(1):61-80. PubMed ID: 10021741
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An Effective Evolutionary Hybrid for Solving the Permutation Flowshop Scheduling Problem.
    Amirghasemi M; Zamani R
    Evol Comput; 2017; 25(1):87-111. PubMed ID: 26223000
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Graph drawing using tabu search coupled with path relinking.
    Dib FK; Rodgers P
    PLoS One; 2018; 13(5):e0197103. PubMed ID: 29746576
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Heuristic-based tabu search algorithm for folding two-dimensional AB off-lattice model proteins.
    Liu J; Sun Y; Li G; Song B; Huang W
    Comput Biol Chem; 2013 Dec; 47():142-8. PubMed ID: 24077543
    [TBL] [Abstract][Full Text] [Related]  

  • 9. An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems.
    Wang Y; Li X; Ruiz R; Sui S
    IEEE Trans Cybern; 2018 May; 48(5):1553-1566. PubMed ID: 28600270
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Adapting operator settings in genetic algorithms.
    Tuson A; Ross P
    Evol Comput; 1998; 6(2):161-84. PubMed ID: 10021745
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Intelligent Decision-Making of Scheduling for Dynamic Permutation Flowshop via Deep Reinforcement Learning.
    Yang S; Xu Z; Wang J
    Sensors (Basel); 2021 Feb; 21(3):. PubMed ID: 33540868
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems.
    Blot A; Kessaci MÉ; Jourdan L; Hoos HH
    Evol Comput; 2019; 27(1):147-171. PubMed ID: 30407875
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Discrete bat algorithm for optimal problem of permutation flow shop scheduling.
    Luo Q; Zhou Y; Xie J; Ma M; Li L
    ScientificWorldJournal; 2014; 2014():630280. PubMed ID: 25243220
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Effective social spider optimization algorithms for distributed assembly permutation flowshop scheduling problem in automobile manufacturing supply chain.
    Zhang W; Hao J; Liu F
    Sci Rep; 2024 Mar; 14(1):6370. PubMed ID: 38493263
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An Integrated Method Based on PSO and EDA for the Max-Cut Problem.
    Lin G; Guan J
    Comput Intell Neurosci; 2016; 2016():3420671. PubMed ID: 26989404
    [TBL] [Abstract][Full Text] [Related]  

  • 16. An Improved Artificial Bee Colony Algorithm for Solving Hybrid Flexible Flowshop With Dynamic Operation Skipping.
    Li JQ; Pan QK; Duan PY
    IEEE Trans Cybern; 2016 Jun; 46(6):1311-24. PubMed ID: 26126292
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Single-machine scheduling with periodic maintenance and learning effect.
    Wu H; Zheng H
    Sci Rep; 2023 Jun; 13(1):9309. PubMed ID: 37291253
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem.
    Thammano A; Rungwachira P
    Heliyon; 2021 Sep; 7(9):e08029. PubMed ID: 34622046
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Time scheduling of transit systems with transfer considerations using genetic algorithms.
    Deb K; Chakroborty P
    Evol Comput; 1998; 6(1):1-24. PubMed ID: 10021738
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.