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 *

138 related articles for article (PubMed ID: 34467994)

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

  • 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. Heuristic algorithms for the minmax regret flow-shop problem with interval processing times.
    Ćwik M; Józefczyk J
    Cent Eur J Oper Res; 2018; 26(1):215-238. PubMed ID: 29375268
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots.
    Lu Y; Tang Q; Pan Q; Zhao L; Zhu Y
    Sensors (Basel); 2023 Mar; 23(5):. PubMed ID: 36905012
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem.
    Fan J; Li Y; Xie J; Zhang C; Shen W; Gao L
    IEEE Trans Cybern; 2023 Mar; 53(3):1752-1764. PubMed ID: 34710048
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.
    Hart E; Sim K
    Evol Comput; 2016; 24(4):609-635. PubMed ID: 27120113
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 13. Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns.
    Han Y; Gong D; Jin Y; Pan Q
    IEEE Trans Cybern; 2019 Jan; 49(1):184-197. PubMed ID: 29990118
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An effective PSO-based memetic algorithm for flow shop scheduling.
    Liu B; Wang L; Jin YH
    IEEE Trans Syst Man Cybern B Cybern; 2007 Feb; 37(1):18-27. PubMed ID: 17278555
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
    Drake JH; Özcan E; Burke EK
    Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems.
    Khurshid B; Maqsood S; Khurshid Y; Naeem K; Khalid QS
    Sci Rep; 2024 Jan; 14(1):2376. PubMed ID: 38287049
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Hybrid Artificial Bee Colony Algorithm for a Parallel Batching Distributed Flow-Shop Problem With Deteriorating Jobs.
    Li JQ; Song MX; Wang L; Duan PY; Han YY; Sang HY; Pan QK
    IEEE Trans Cybern; 2020 Jun; 50(6):2425-2439. PubMed ID: 31603832
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
    Lissovoi A; Oliveto PS; Warwicker JA
    Evol Comput; 2020; 28(3):437-461. PubMed ID: 31120773
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Genetic Programming with Delayed Routing for Multiobjective Dynamic Flexible Job Shop Scheduling.
    Xu B; Mei Y; Wang Y; Ji Z; Zhang M
    Evol Comput; 2021; 29(1):75-105. PubMed ID: 32375006
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic.
    Anaya Fuentes GE; Hernández Gress ES; Seck Tuoh Mora JC; Medina Marín J
    PLoS One; 2018; 13(8):e0201868. PubMed ID: 30133477
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.