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 *

174 related articles for article (PubMed ID: 26702371)

  • 1. Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date.
    Xu Z; Zou Y; Kong X
    Springerplus; 2015; 4():782. PubMed ID: 26702371
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times.
    Ezugwu AE; Adeleke OJ; Viriri S
    PLoS One; 2018; 13(7):e0200030. PubMed ID: 29975783
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An Observation Scheduling Approach Based on Task Clustering for High-Altitude Airship.
    Chen J; Luo Q; Wu G
    Sensors (Basel); 2022 Mar; 22(5):. PubMed ID: 35271197
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Hybrid metaheuristics for solving a fuzzy single batch-processing machine scheduling problem.
    Molla-Alizadeh-Zavardehi S; Tavakkoli-Moghaddam R; Lotfi FH
    ScientificWorldJournal; 2014; 2014():214615. PubMed ID: 24883359
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Job Scheduling in Cloud Computing Using a Modified Harris Hawks Optimization and Simulated Annealing Algorithm.
    Attiya I; Abd Elaziz M; Xiong S
    Comput Intell Neurosci; 2020; 2020():3504642. PubMed ID: 32256551
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.
    Madni SHH; Abd Latiff MS; Abdullahi M; Abdulhamid SM; Usman MJ
    PLoS One; 2017; 12(5):e0176321. PubMed ID: 28467505
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine.
    Le HT; Geser P; Middendorf M
    Evol Comput; 2021 Sep; 29(3):415-439. PubMed ID: 34467994
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An improved hierarchical genetic algorithm for sheet cutting scheduling with process constraints.
    Rao Y; Qi D; Li J
    ScientificWorldJournal; 2013; 2013():202683. PubMed ID: 24489491
    [TBL] [Abstract][Full Text] [Related]  

  • 9. An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling.
    Meng X; Wang N; Liu J; Liu Q
    Comput Intell Neurosci; 2022; 2022():1843675. PubMed ID: 35154297
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A Knowledge-Based Two-Population Optimization Algorithm for Distributed Energy-Efficient Parallel Machines Scheduling.
    Pan Z; Lei D; Wang L
    IEEE Trans Cybern; 2022 Jun; 52(6):5051-5063. PubMed ID: 33119528
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines.
    Li S
    Math Biosci Eng; 2022 Jul; 19(11):10731-10740. PubMed ID: 36124567
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A computational efficient optimization of flow shop scheduling problems.
    Liang Z; Zhong P; Liu M; Zhang C; Zhang Z
    Sci Rep; 2022 Jan; 12(1):845. PubMed ID: 35039598
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem.
    Viana MS; Contreras RC; Morandin Junior O
    Sensors (Basel); 2022 Jun; 22(12):. PubMed ID: 35746343
    [TBL] [Abstract][Full Text] [Related]  

  • 14. 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]  

  • 15. A bi-criterion sequence-dependent scheduling problem with order deliveries.
    Xu JY; Lin WC; Hu KX; Chang YW; Wu WH; Hsu PH; Wu TH; Wu CC
    PeerJ Comput Sci; 2024; 10():e1763. PubMed ID: 38196963
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.
    Hidri L; Gharbi A; Louly MA
    ScientificWorldJournal; 2014; 2014():605198. PubMed ID: 25610911
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Application-aware deadline constraint job scheduling mechanism on large-scale computational grid.
    Tang X; Liao X
    PLoS One; 2018; 13(11):e0207596. PubMed ID: 30458034
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An improved chemical reaction optimization algorithm for solving the shortest common supersequence problem.
    Luo F; Chen C; Fuentes J
    Comput Biol Chem; 2020 Oct; 88():107327. PubMed ID: 32688010
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Multiple sequence alignment by parallel simulated annealing.
    Ishikawa M; Toya T; Hoshida M; Nitta K; Ogiwara A; Kanehisa M
    Comput Appl Biosci; 1993 Jun; 9(3):267-73. PubMed ID: 8324627
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A hyper-heuristic for the Longest Common Subsequence problem.
    Tabataba FS; Mousavi SR
    Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.