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 *

120 related articles for article (PubMed ID: 34720298)

  • 1. Scheduling in the Random-Order Model.
    Albers S; Janke M
    Algorithmica; 2021; 83(9):2803-2832. PubMed ID: 34720298
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
    Dósa G; Fügenschuh A; Tan Z; Tuza Z; Węsek K
    Cent Eur J Oper Res; 2018; 26(1):161-180. PubMed ID: 29375267
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Improved Online Algorithms for Knapsack and GAP in the Random Order Model.
    Albers S; Khan A; Ladewig L
    Algorithmica; 2021; 83(6):1750-1785. PubMed ID: 34720295
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Greedy Firefly Algorithm for Optimizing Job Scheduling in IoT Grid Computing.
    Yousif A; Alqhtani SM; Bashir MB; Ali A; Hamza R; Hassan A; Tawfeeg TM
    Sensors (Basel); 2022 Jan; 22(3):. PubMed ID: 35161596
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.
    Bansal N; Oosterwijk T; Vredeveld T; van der Zwaan R
    Algorithmica; 2016; 76(4):1077-1096. PubMed ID: 32355383
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Semi-online scheduling on two machines with GoS levels and partial information of processing time.
    Luo T; Xu Y
    ScientificWorldJournal; 2014; 2014():576234. PubMed ID: 24672335
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Best Fit Bin Packing with Random Order Revisited.
    Albers S; Khan A; Ladewig L
    Algorithmica; 2021; 83(9):2833-2858. PubMed ID: 34776569
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Two hybrid flow shop scheduling lines with assembly stage and compatibility constraints.
    Muñoz-Sánchez R; Martínez-Salazar I; González-Velarde JL; Ríos Solís YÁ
    PLoS One; 2024; 19(6):e0304119. PubMed ID: 38905191
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.
    Nederlof J; Swennenhuis CMF
    Algorithmica; 2022; 84(8):2309-2334. PubMed ID: 35880200
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm.
    Pan Y; Gao K; Li Z; Wu N
    IEEE Trans Cybern; 2023 Jun; 53(6):3818-3828. PubMed ID: 35468071
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Self-Adaptive Differential Evolution Algorithm for Scheduling a Single Batch-Processing Machine With Arbitrary Job Sizes and Release Times.
    Zhou S; Xing L; Zheng X; Du N; Wang L; Zhang Q
    IEEE Trans Cybern; 2021 Mar; 51(3):1430-1442. PubMed ID: 31567106
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Scheduling uniform machines with restricted assignment.
    Li S; Liu Z
    Math Biosci Eng; 2022 Jul; 19(9):9697-9708. PubMed ID: 35942778
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. More reliable protein NMR peak assignment via improved 2-interval scheduling.
    Chen ZZ; Lin G; Rizzi R; Wen J; Xu D; Xu Y; Jiang T
    J Comput Biol; 2005 Mar; 12(2):129-46. PubMed ID: 15767773
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An improved genetic algorithm with dynamic neighborhood search for job shop scheduling problem.
    Hu K; Wang L; Cai J; Cheng L
    Math Biosci Eng; 2023 Sep; 20(9):17407-17427. PubMed ID: 37920060
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Genetic Algorithm for Solving the No-Wait Three-Stage Surgery Scheduling Problem.
    Lin YK; Yen CH
    Healthcare (Basel); 2023 Mar; 11(5):. PubMed ID: 36900744
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Parallel batch scheduling of deteriorating jobs with release dates and rejection.
    Zou J; Miao C
    ScientificWorldJournal; 2014; 2014():270942. PubMed ID: 25143969
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.