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 *

115 related articles for article (PubMed ID: 24574901)

  • 1. Single-machine scheduling to minimize total completion time and tardiness with two competing agents.
    Lee WC; Shiau YR; Chung YH; Ding L
    ScientificWorldJournal; 2014; 2014():596306. PubMed ID: 24574901
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Scheduling jobs and a variable maintenance on a single machine with common due-date assignment.
    Wan L
    ScientificWorldJournal; 2014; 2014():748905. PubMed ID: 25147861
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An Effective Solution for Large Scale Single Machine Total Weighted Tardiness Problem using Lunar Cycle Inspired Artificial Bee Colony Algorithm.
    Sharma N; Sharma H; Sharma A
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(5):1573-1581. PubMed ID: 30716047
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Due-window assignment scheduling with past-sequence-dependent setup times.
    Liu W; Wang X; Wang X; Zhao P
    Math Biosci Eng; 2022 Jan; 19(3):3110-3126. PubMed ID: 35240823
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Solving Single Machine Total Weighted Tardiness Problem with Unequal Release Date Using Neurohybrid Particle Swarm Optimization Approach.
    Cakar T; Koker R
    Comput Intell Neurosci; 2015; 2015():838925. PubMed ID: 26221134
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Due-window assignment scheduling with variable job processing times.
    Wu YB; Ji P
    ScientificWorldJournal; 2015; 2015():740750. PubMed ID: 25918745
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects.
    Yue L; Guan Z; Saif U; Zhang F; Wang H
    Springerplus; 2016; 5(1):1593. PubMed ID: 27652166
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Hybrid Scheduling Model for Independent Grid Tasks.
    Shanthini J; Kalaikumaran T; Karthik S
    ScientificWorldJournal; 2015; 2015():692084. PubMed ID: 26543897
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A branch and bound algorithm for optimal television commercial scheduling.
    Liao LW
    Math Biosci Eng; 2022 Mar; 19(5):4933-4945. PubMed ID: 35430848
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times.
    Jia X; Xue J; Wang SY; Wang JB
    Math Biosci Eng; 2022 Jun; 19(9):8923-8934. PubMed ID: 35942742
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Multiagent scheduling method with earliness and tardiness objectives in flexible job shops.
    Wu Z; Weng MX
    IEEE Trans Syst Man Cybern B Cybern; 2005 Apr; 35(2):293-301. PubMed ID: 15828657
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Approaches to eliminate waste and reduce cost for recycling glass.
    Chao CW; Liao CJ
    Waste Manag; 2011 Dec; 31(12):2414-21. PubMed ID: 21839628
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Some single-machine scheduling problems with learning effects and two competing agents.
    Li H; Li Z; Yin Y
    ScientificWorldJournal; 2014; 2014():471016. PubMed ID: 25009829
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. Single machine scheduling and due date assignment with past-sequence-dependent setup time and position-dependent processing time.
    Zhao CL; Hsu CJ; Hsu HF
    ScientificWorldJournal; 2014; 2014():620150. PubMed ID: 25258727
    [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. Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm.
    Zhang GH; Sun JH; Liu X; Wang GD; Yang YY
    Math Biosci Eng; 2019 Feb; 16(3):1334-1347. PubMed ID: 30947423
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.