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 *

118 related articles for article (PubMed ID: 27964800)

  • 1. An adaptive large neighborhood search procedure applied to the dynamic patient admission scheduling problem.
    Lusby RM; Schwierz M; Range TM; Larsen J
    Artif Intell Med; 2016 Nov; 74():21-31. PubMed ID: 27964800
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Modeling and solving the dynamic patient admission scheduling problem under uncertainty.
    Ceschia S; Schaerf A
    Artif Intell Med; 2012 Nov; 56(3):199-205. PubMed ID: 23122690
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Data for a meta-analysis of the adaptive layer in adaptive large neighborhood search.
    Turkeš R; Sörensen K; Hvattum LM; Barrena E; Chentli H; Coelho LC; Dayarian I; Grimault A; Gullhav AN; Iris Ç; Keskin M; Kiefer A; Lusby RM; Mauri GR; Monroy-Licht M; Parragh SN; Riquelme-Rodríguez JP; Santini A; Santos VGM; Thomas C
    Data Brief; 2020 Dec; 33():106568. PubMed ID: 33304965
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A room-oriented artificial bee colony algorithm for optimizing the patient admission scheduling problem.
    Bolaji AL; Bamigbola AF; Adewole LB; Shola PB; Afolorunso A; Obayomi AA; Aremu DR; Almazroi AAA
    Comput Biol Med; 2022 Sep; 148():105850. PubMed ID: 35901536
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Discrete flower pollination algorithm for patient admission scheduling problem.
    Abdalkareem ZA; Al-Betar MA; Amir A; Ehkan P; Hammouri AI; Salman OH
    Comput Biol Med; 2022 Feb; 141():105007. PubMed ID: 34785077
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Exact and Metaheuristic Approaches for a Bi-Objective School Bus Scheduling Problem.
    Chen X; Kong Y; Dang L; Hou Y; Ye X
    PLoS One; 2015; 10(7):e0132600. PubMed ID: 26176764
    [TBL] [Abstract][Full Text] [Related]  

  • 7. The Hot Strip Mill Scheduling Problem With Uncertainty: Robust Optimization Models and Solution Approaches.
    Zhang R; Song S; Wu C
    IEEE Trans Cybern; 2023 Jul; 53(7):4079-4093. PubMed ID: 34990375
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A hybrid tabu search algorithm for automatically assigning patients to beds.
    Demeester P; Souffriau W; De Causmaecker P; Vanden Berghe G
    Artif Intell Med; 2010 Jan; 48(1):61-70. PubMed ID: 19833489
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem.
    Escamilla Serna NJ; Seck-Tuoh-Mora JC; Medina-Marin J; Hernandez-Romero N; Barragan-Vite I; Corona Armenta JR
    PeerJ Comput Sci; 2021; 7():e574. PubMed ID: 34141895
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.
    Coelho VN; Coelho IM; Souza MJ; Oliveira TA; Cota LP; Haddad MN; Mladenovic N; Silva RC; Guimarães FG
    Evol Comput; 2016; 24(4):637-666. PubMed ID: 27258842
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 13. An optimization based on simulation approach to the patient admission scheduling problem using a linear programing algorithm.
    Granja C; Almada-Lobo B; Janela F; Seabra J; Mendes A
    J Biomed Inform; 2014 Dec; 52():427-37. PubMed ID: 25194680
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Semi-online patient scheduling in pathology laboratories.
    Azadeh A; Baghersad M; Farahani MH; Zarrin M
    Artif Intell Med; 2015 Jul; 64(3):217-26. PubMed ID: 26012952
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Lower and upper bounds for the two-echelon capacitated location-routing problem.
    Contardo C; Hemmelmayr V; Crainic TG
    Comput Oper Res; 2012 Dec; 39(12):3185-3199. PubMed ID: 24511176
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates.
    Zhuang ZL; Lu ZY; Huang ZZ; Liu CL; Qin W
    Math Biosci Eng; 2019 May; 16(5):4491-4505. PubMed ID: 31499673
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A synergetic combination of small and large neighborhood schemes in developing an effective procedure for solving the job shop scheduling problem.
    Amirghasemi M; Zamani R
    Springerplus; 2014; 3():193. PubMed ID: 24808999
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Efficient sequential and parallel algorithms for finding edit distance based motifs.
    Pal S; Xiao P; Rajasekaran S
    BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Directed Bee Colony Optimization Algorithm to Solve the Nurse Rostering Problem.
    Rajeswari M; Amudhavel J; Pothula S; Dhavachelvan P
    Comput Intell Neurosci; 2017; 2017():6563498. PubMed ID: 28473849
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A short-term operating room surgery scheduling problem integrating multiple nurses roster constraints.
    Xiang W; Yin J; Lim G
    Artif Intell Med; 2015 Feb; 63(2):91-106. PubMed ID: 25563674
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.