{"id":"W2123622158","doi":"10.1109/rtcsa.1999.811284","title":"Hybrid genetic algorithms for scheduling partially ordered tasks in a multi-processor environment","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Fair-share scheduling; Dynamic priority scheduling; Genetic algorithm; Quality control and genetic algorithms; Combinatorial optimization; Parallel computing; Optimization problem; Algorithm; Theoretical computer science; Distributed computing; Meta-optimization; Mathematics; Machine learning; Schedule","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052378,0.0006363892,0.0006305029,0.001029131,0.0004323194,0.0009019674,0.0008346822,0.000894816,0.0007813099],"category_scores_gemma":[0.001893268,0.0003732955,0.0004669896,0.001267691,0.000761934,0.0009495468,0.0005801158,0.0006126705,0.0001966681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006706294,"about_ca_system_score_gemma":0.0005777067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002633519,"about_ca_topic_score_gemma":0.002515448,"domain_scores_codex":[0.9995253,0.000203728,0.00002027481,0.0000445507,0.0001601698,0.00004601428],"domain_scores_gemma":[0.9993154,0.0004799152,0.00005709129,0.0000548749,0.00007095334,0.00002178412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008494165,0.00004377494,0.0003072464,0.00003675247,0.00005111615,0.00004590573,0.00005610414,0.9319929,0.00223375,0.0121443,0.0004218583,0.05258141],"study_design_scores_gemma":[0.000031571,0.00004176499,0.0000924608,0.00000561813,0.00001319361,0.00002204171,0.00001350502,0.9864016,0.0007510941,0.01203204,0.0005880017,0.000007111341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06571211,0.0008004366,0.9297257,0.0001640795,0.00004301326,0.00005508998,0.00003997434,0.000710641,0.002748935],"genre_scores_gemma":[0.5362887,0.0006378763,0.4602131,0.0001263135,0.00003476327,0.000241904,0.0001576931,0.00009581116,0.002203795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002633519,"threshold_uncertainty_score":0.005565584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02553000264354821,"score_gpt":0.2443336858314534,"score_spread":0.2188036831879052,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}